/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-RepeatedSemanticLbeWithDisjunctivePredicates.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-8d0d62b [2022-12-06 06:44:09,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:44:09,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:44:09,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:44:09,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:44:09,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:44:09,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:44:09,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:44:09,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:44:09,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:44:09,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:44:09,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:44:09,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:44:09,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:44:09,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:44:09,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:44:09,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:44:09,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:44:09,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:44:09,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:44:09,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:44:09,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:44:09,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:44:09,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:44:09,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:44:09,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:44:09,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:44:09,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:44:09,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:44:09,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:44:09,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:44:09,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:44:09,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:44:09,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:44:09,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:44:09,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:44:09,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:44:09,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:44:09,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:44:09,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:44:09,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:44:09,242 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:44:09,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:44:09,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:44:09,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:44:09,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:44:09,274 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:44:09,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:44:09,275 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:44:09,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:44:09,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:44:09,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:44:09,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:44:09,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:44:09,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:44:09,276 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:44:09,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:44:09,276 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:44:09,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:44:09,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:44:09,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:44:09,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:44:09,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:44:09,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:44:09,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:44:09,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:44:09,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:44:09,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:44:09,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:44:09,277 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:44:09,277 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-06 06:44:09,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:44:09,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:44:09,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:44:09,569 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:44:09,569 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:44:09,570 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-06 06:44:10,560 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:44:10,820 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:44:10,820 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe028_rmo.i [2022-12-06 06:44:10,829 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8bbd5aa/06bf0e4cddf9458585e314106ba0f198/FLAG900bb8719 [2022-12-06 06:44:10,844 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8bbd5aa/06bf0e4cddf9458585e314106ba0f198 [2022-12-06 06:44:10,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:44:10,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:44:10,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:44:10,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:44:10,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:44:10,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:44:10" (1/1) ... [2022-12-06 06:44:10,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f435f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:10, skipping insertion in model container [2022-12-06 06:44:10,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:44:10" (1/1) ... [2022-12-06 06:44:10,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:44:10,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:44:10,998 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-06 06:44:11,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,164 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:44:11,191 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:44:11,202 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-06 06:44:11,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,237 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,239 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:44:11,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:44:11,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:44:11,295 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:44:11,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11 WrapperNode [2022-12-06 06:44:11,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:44:11,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:44:11,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:44:11,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:44:11,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,355 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-06 06:44:11,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:44:11,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:44:11,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:44:11,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:44:11,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,388 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:44:11,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:44:11,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:44:11,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:44:11,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (1/1) ... [2022-12-06 06:44:11,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:44:11,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:44:11,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:44:11,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:44:11,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:44:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:44:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:44:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:44:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:44:11,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:44:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:44:11,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:44:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:44:11,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:44:11,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:44:11,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:44:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:44:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:44:11,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:44:11,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:44:11,464 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:44:11,642 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:44:11,643 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:44:11,988 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:44:12,189 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:44:12,189 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:44:12,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:44:12 BoogieIcfgContainer [2022-12-06 06:44:12,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:44:12,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:44:12,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:44:12,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:44:12,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:44:10" (1/3) ... [2022-12-06 06:44:12,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d53593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:44:12, skipping insertion in model container [2022-12-06 06:44:12,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:44:11" (2/3) ... [2022-12-06 06:44:12,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42d53593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:44:12, skipping insertion in model container [2022-12-06 06:44:12,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:44:12" (3/3) ... [2022-12-06 06:44:12,199 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_rmo.i [2022-12-06 06:44:12,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:44:12,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 06:44:12,214 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:44:12,274 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:44:12,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 06:44:12,409 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-06 06:44:12,410 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:12,421 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-06 06:44:12,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-06 06:44:12,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-06 06:44:12,429 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:12,459 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 06:44:12,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-06 06:44:12,516 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-06 06:44:12,516 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:12,517 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-06 06:44:12,520 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-06 06:44:12,521 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-06 06:44:18,034 INFO L203 LiptonReduction]: Total number of compositions: 91 [2022-12-06 06:44:18,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:44:18,053 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;@713368b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:44:18,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 06:44:18,059 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 06:44:18,062 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:18,062 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:18,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:18,065 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-06 06:44:18,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1656305620, now seen corresponding path program 1 times [2022-12-06 06:44:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:18,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233153338] [2022-12-06 06:44:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233153338] [2022-12-06 06:44:18,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233153338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:18,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:18,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:44:18,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855601532] [2022-12-06 06:44:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:18,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 06:44:18,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:18,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 06:44:18,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 06:44:18,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:44:18,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:18,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:18,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:44:18,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:18,544 INFO L130 PetriNetUnfolder]: 567/876 cut-off events. [2022-12-06 06:44:18,544 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:44:18,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 876 events. 567/876 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3446 event pairs, 567 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1776. Up to 865 conditions per place. [2022-12-06 06:44:18,557 INFO L137 encePairwiseOnDemand]: 19/20 looper letters, 18 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2022-12-06 06:44:18,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 83 flow [2022-12-06 06:44:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 06:44:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 06:44:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2022-12-06 06:44:18,565 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 06:44:18,566 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 21 transitions. [2022-12-06 06:44:18,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 83 flow [2022-12-06 06:44:18,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:44:18,572 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2022-12-06 06:44:18,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2022-12-06 06:44:18,576 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2022-12-06 06:44:18,577 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:18,577 INFO L89 Accepts]: Start accepts. Operand has 27 places, 19 transitions, 44 flow [2022-12-06 06:44:18,579 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:18,579 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:18,579 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 19 transitions, 44 flow [2022-12-06 06:44:18,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 44 flow [2022-12-06 06:44:18,588 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:44:18,588 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:18,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 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-06 06:44:18,589 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 44 flow [2022-12-06 06:44:18,589 INFO L188 LiptonReduction]: Number of co-enabled transitions 162 [2022-12-06 06:44:18,830 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:18,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 06:44:18,832 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 44 flow [2022-12-06 06:44:18,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:18,832 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:18,832 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:18,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:44:18,833 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-06 06:44:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1723183223, now seen corresponding path program 1 times [2022-12-06 06:44:18,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:18,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391100798] [2022-12-06 06:44:18,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:18,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:19,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391100798] [2022-12-06 06:44:19,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391100798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:19,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:19,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:44:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616221989] [2022-12-06 06:44:19,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:19,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:44:19,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:19,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:44:19,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:44:19,271 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:44:19,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:19,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:19,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:44:19,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:19,426 INFO L130 PetriNetUnfolder]: 527/856 cut-off events. [2022-12-06 06:44:19,426 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:19,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 856 events. 527/856 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3546 event pairs, 143 based on Foata normal form. 16/872 useless extension candidates. Maximal degree in co-relation 1700. Up to 609 conditions per place. [2022-12-06 06:44:19,433 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-06 06:44:19,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 112 flow [2022-12-06 06:44:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:44:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:44:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 06:44:19,436 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 06:44:19,436 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 30 transitions. [2022-12-06 06:44:19,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 112 flow [2022-12-06 06:44:19,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:44:19,438 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-06 06:44:19,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-06 06:44:19,439 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-06 06:44:19,440 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:19,440 INFO L89 Accepts]: Start accepts. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 06:44:19,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:19,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:19,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 06:44:19,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 52 flow [2022-12-06 06:44:19,446 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-06 06:44:19,446 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:44:19,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:44:19,446 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 19 transitions, 52 flow [2022-12-06 06:44:19,446 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 06:44:19,450 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:19,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 06:44:19,452 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-06 06:44:19,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:19,453 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:19,453 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:19,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:44:19,453 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-06 06:44:19,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1879071546, now seen corresponding path program 1 times [2022-12-06 06:44:19,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:19,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035471417] [2022-12-06 06:44:19,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:20,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:20,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035471417] [2022-12-06 06:44:20,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035471417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:20,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:20,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:44:20,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193285107] [2022-12-06 06:44:20,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:20,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:44:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:44:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:44:20,607 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:44:20,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:20,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:20,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:44:20,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:20,866 INFO L130 PetriNetUnfolder]: 498/815 cut-off events. [2022-12-06 06:44:20,866 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 06:44:20,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1761 conditions, 815 events. 498/815 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3360 event pairs, 138 based on Foata normal form. 12/827 useless extension candidates. Maximal degree in co-relation 1750. Up to 634 conditions per place. [2022-12-06 06:44:20,873 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 30 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 06:44:20,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 157 flow [2022-12-06 06:44:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:44:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:44:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 06:44:20,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2022-12-06 06:44:20,876 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 4 states and 39 transitions. [2022-12-06 06:44:20,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 157 flow [2022-12-06 06:44:20,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 151 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:20,878 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 70 flow [2022-12-06 06:44:20,878 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 06:44:20,880 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-06 06:44:20,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:20,880 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 70 flow [2022-12-06 06:44:20,881 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:20,881 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:20,881 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 70 flow [2022-12-06 06:44:20,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 70 flow [2022-12-06 06:44:20,889 INFO L130 PetriNetUnfolder]: 1/24 cut-off events. [2022-12-06 06:44:20,889 INFO L131 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2022-12-06 06:44:20,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 24 events. 1/24 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 37. Up to 4 conditions per place. [2022-12-06 06:44:20,890 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 70 flow [2022-12-06 06:44:20,890 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 06:44:20,992 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:20,994 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-06 06:44:20,994 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 70 flow [2022-12-06 06:44:20,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:20,994 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:20,994 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:20,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:44:20,995 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-06 06:44:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:20,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1878276983, now seen corresponding path program 1 times [2022-12-06 06:44:20,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:20,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139500085] [2022-12-06 06:44:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:21,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:21,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139500085] [2022-12-06 06:44:21,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139500085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:21,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:21,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218542392] [2022-12-06 06:44:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:21,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:44:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:21,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:44:21,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:44:21,244 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:44:21,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:21,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:21,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:44:21,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:21,492 INFO L130 PetriNetUnfolder]: 407/689 cut-off events. [2022-12-06 06:44:21,492 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-06 06:44:21,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 689 events. 407/689 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2915 event pairs, 100 based on Foata normal form. 64/748 useless extension candidates. Maximal degree in co-relation 1657. Up to 264 conditions per place. [2022-12-06 06:44:21,497 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 41 selfloop transitions, 5 changer transitions 1/48 dead transitions. [2022-12-06 06:44:21,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 250 flow [2022-12-06 06:44:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:44:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:44:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 06:44:21,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2022-12-06 06:44:21,498 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 70 flow. Second operand 4 states and 47 transitions. [2022-12-06 06:44:21,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 250 flow [2022-12-06 06:44:21,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:44:21,501 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 101 flow [2022-12-06 06:44:21,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2022-12-06 06:44:21,502 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 06:44:21,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:21,502 INFO L89 Accepts]: Start accepts. Operand has 36 places, 24 transitions, 101 flow [2022-12-06 06:44:21,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:21,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:21,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 101 flow [2022-12-06 06:44:21,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 101 flow [2022-12-06 06:44:21,516 INFO L130 PetriNetUnfolder]: 18/62 cut-off events. [2022-12-06 06:44:21,517 INFO L131 PetriNetUnfolder]: For 15/18 co-relation queries the response was YES. [2022-12-06 06:44:21,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 62 events. 18/62 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 189 event pairs, 7 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 139. Up to 36 conditions per place. [2022-12-06 06:44:21,518 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 101 flow [2022-12-06 06:44:21,518 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 06:44:21,634 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:21,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-06 06:44:21,636 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 101 flow [2022-12-06 06:44:21,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:21,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:21,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:21,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:44:21,637 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-06 06:44:21,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:21,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1658637151, now seen corresponding path program 1 times [2022-12-06 06:44:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:21,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187563931] [2022-12-06 06:44:21,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:21,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:21,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187563931] [2022-12-06 06:44:21,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187563931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:21,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:21,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:44:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619969718] [2022-12-06 06:44:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:21,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:44:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:44:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:44:21,864 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:44:21,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:21,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:21,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:44:21,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:22,033 INFO L130 PetriNetUnfolder]: 213/392 cut-off events. [2022-12-06 06:44:22,034 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-12-06 06:44:22,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 392 events. 213/392 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1471 event pairs, 50 based on Foata normal form. 37/428 useless extension candidates. Maximal degree in co-relation 1146. Up to 162 conditions per place. [2022-12-06 06:44:22,037 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 47 selfloop transitions, 8 changer transitions 1/57 dead transitions. [2022-12-06 06:44:22,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 57 transitions, 322 flow [2022-12-06 06:44:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:22,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-06 06:44:22,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6210526315789474 [2022-12-06 06:44:22,039 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 101 flow. Second operand 5 states and 59 transitions. [2022-12-06 06:44:22,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 57 transitions, 322 flow [2022-12-06 06:44:22,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 312 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:22,042 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 141 flow [2022-12-06 06:44:22,042 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-06 06:44:22,043 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2022-12-06 06:44:22,043 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:22,043 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 141 flow [2022-12-06 06:44:22,044 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:22,044 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:22,044 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 141 flow [2022-12-06 06:44:22,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 141 flow [2022-12-06 06:44:22,054 INFO L130 PetriNetUnfolder]: 10/48 cut-off events. [2022-12-06 06:44:22,054 INFO L131 PetriNetUnfolder]: For 43/55 co-relation queries the response was YES. [2022-12-06 06:44:22,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 48 events. 10/48 cut-off events. For 43/55 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 104 event pairs, 1 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 136. Up to 24 conditions per place. [2022-12-06 06:44:22,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 141 flow [2022-12-06 06:44:22,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 06:44:22,059 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:22,060 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 06:44:22,060 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 141 flow [2022-12-06 06:44:22,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:22,060 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:22,060 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:22,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:44:22,061 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-06 06:44:22,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1325211464, now seen corresponding path program 1 times [2022-12-06 06:44:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:22,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150925428] [2022-12-06 06:44:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:22,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:22,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150925428] [2022-12-06 06:44:22,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150925428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:22,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:22,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:44:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550083269] [2022-12-06 06:44:22,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:22,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:44:22,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:22,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:44:22,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:44:22,372 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:44:22,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:22,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:22,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:44:22,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:22,521 INFO L130 PetriNetUnfolder]: 143/270 cut-off events. [2022-12-06 06:44:22,521 INFO L131 PetriNetUnfolder]: For 280/280 co-relation queries the response was YES. [2022-12-06 06:44:22,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 270 events. 143/270 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 912 event pairs, 50 based on Foata normal form. 10/279 useless extension candidates. Maximal degree in co-relation 856. Up to 108 conditions per place. [2022-12-06 06:44:22,524 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 35 selfloop transitions, 11 changer transitions 1/48 dead transitions. [2022-12-06 06:44:22,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 304 flow [2022-12-06 06:44:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:44:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:44:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-12-06 06:44:22,526 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2022-12-06 06:44:22,526 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 141 flow. Second operand 6 states and 51 transitions. [2022-12-06 06:44:22,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 304 flow [2022-12-06 06:44:22,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 264 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 06:44:22,530 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 146 flow [2022-12-06 06:44:22,530 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 06:44:22,531 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-06 06:44:22,531 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:22,531 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 146 flow [2022-12-06 06:44:22,532 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:22,532 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:22,532 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 146 flow [2022-12-06 06:44:22,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 146 flow [2022-12-06 06:44:22,540 INFO L130 PetriNetUnfolder]: 7/35 cut-off events. [2022-12-06 06:44:22,540 INFO L131 PetriNetUnfolder]: For 44/50 co-relation queries the response was YES. [2022-12-06 06:44:22,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 35 events. 7/35 cut-off events. For 44/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 95. Up to 13 conditions per place. [2022-12-06 06:44:22,541 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 27 transitions, 146 flow [2022-12-06 06:44:22,541 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 06:44:24,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [605] L834-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_21 (+ v_~__unbuffered_cnt~0_22 1)) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] and [685] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse13 (= (mod v_~x$r_buff0_thd0~0_116 256) 0))) (let ((.cse14 (= (mod v_~x$w_buff0_used~0_486 256) 0)) (.cse12 (= (mod v_~x$r_buff1_thd0~0_121 256) 0)) (.cse11 (= 0 (mod v_~x$w_buff1_used~0_468 256))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_485 256) 0))) (.cse7 (not .cse13))) (let ((.cse6 (and .cse0 .cse7)) (.cse9 (not .cse11)) (.cse1 (not .cse12)) (.cse5 (select |v_#memory_int_567| |v_~#x~0.base_263|)) (.cse8 (not .cse14))) (and (= (mod v_~main$tmp_guard1~0_52 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_71) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= v_~main$tmp_guard1~0_52 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_48 0) (= v_~__unbuffered_p0_EAX~0_87 0) (= v_~__unbuffered_p2_EAX~0_130 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_46| 0)) (= (mod v_~main$tmp_guard0~0_71 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_40|) (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd0~0_115 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_467 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_121) v_~x$r_buff1_thd0~0_120) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_46| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_40|) (let ((.cse2 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_74 256) 0)) (.cse3 (= |v_ULTIMATE.start_main_#t~mem35#1_124| |v_ULTIMATE.start_main_#t~mem35#1_122|))) (or (and (= v_~__unbuffered_p2_EAX~0_131 v_~__unbuffered_p2_EAX~0_130) .cse2 (= |v_ULTIMATE.start_main_#t~ite36#1_123| |v_ULTIMATE.start_main_#t~ite36#1_121|) .cse3) (and (not .cse2) (= |v_ULTIMATE.start_main_#t~ite36#1_121| v_~__unbuffered_p2_EAX~0_130) (let ((.cse4 (= (mod v_~weak$$choice1~0_65 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem35#1_122| (select (select |v_#memory_int_566| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_83) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_83)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem35#1_122| |v_ULTIMATE.start_main_#t~ite36#1_121|)) (and (= |v_ULTIMATE.start_main_#t~ite36#1_121| v_~__unbuffered_p2_EAX~0_131) .cse4 .cse3)))))) (= |v_#memory_int_566| (store |v_#memory_int_567| |v_~#x~0.base_263| (store .cse5 |v_~#x~0.offset_263| |v_ULTIMATE.start_main_#t~ite33#1_116|))) (= v_~x$r_buff0_thd0~0_115 (ite .cse6 0 v_~x$r_buff0_thd0~0_116)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~x$w_buff0_used~0_485 (ite (and .cse7 .cse8) 0 v_~x$w_buff0_used~0_486)) (= (ite (or .cse6 (and .cse9 .cse1)) 0 v_~x$w_buff1_used~0_468) v_~x$w_buff1_used~0_467) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem31#1_145| |v_ULTIMATE.start_main_#t~mem31#1_143|))) (or (and (or (and .cse10 .cse9 .cse1 (= v_~x$w_buff1~0_256 |v_ULTIMATE.start_main_#t~ite32#1_140|)) (and (or .cse11 .cse12) (= |v_ULTIMATE.start_main_#t~mem31#1_143| (select .cse5 |v_~#x~0.offset_263|)) (= |v_ULTIMATE.start_main_#t~mem31#1_143| |v_ULTIMATE.start_main_#t~ite32#1_140|))) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite33#1_116| |v_ULTIMATE.start_main_#t~ite32#1_140|)) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite32#1_142| |v_ULTIMATE.start_main_#t~ite32#1_140|) .cse7 (= |v_ULTIMATE.start_main_#t~ite33#1_116| v_~x$w_buff0~0_246) .cse8))) (= |v_ULTIMATE.start_main_#t~nondet34#1_79| v_~weak$$choice1~0_65))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_246, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_116, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_123|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ~#x~0.offset=|v_~#x~0.offset_263|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_83, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_83, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_79|, ~x$w_buff1~0=v_~x$w_buff1~0_256, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_468, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_121, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_145|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_142|, #memory_int=|v_#memory_int_567|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_124|, ~#x~0.base=|v_~#x~0.base_263|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_246, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_83, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_83, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_74|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, ~weak$$choice1~0=v_~weak$$choice1~0_65, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_47|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_46|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_115, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_59|, ~#x~0.offset=|v_~#x~0.offset_263|, ~x$w_buff1~0=v_~x$w_buff1~0_256, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_467, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_71, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_115|, #memory_int=|v_#memory_int_566|, ~#x~0.base=|v_~#x~0.base_263|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_40|} AuxVars[|v_ULTIMATE.start_main_#t~mem35#1_122|, |v_ULTIMATE.start_main_#t~ite33#1_116|, |v_ULTIMATE.start_main_#t~mem31#1_143|, |v_ULTIMATE.start_main_#t~ite36#1_121|, |v_ULTIMATE.start_main_#t~ite32#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-06 06:44:24,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [598] L799-->P1EXIT: 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 [685] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse13 (= (mod v_~x$r_buff0_thd0~0_116 256) 0))) (let ((.cse14 (= (mod v_~x$w_buff0_used~0_486 256) 0)) (.cse12 (= (mod v_~x$r_buff1_thd0~0_121 256) 0)) (.cse11 (= 0 (mod v_~x$w_buff1_used~0_468 256))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_485 256) 0))) (.cse7 (not .cse13))) (let ((.cse6 (and .cse0 .cse7)) (.cse9 (not .cse11)) (.cse1 (not .cse12)) (.cse5 (select |v_#memory_int_567| |v_~#x~0.base_263|)) (.cse8 (not .cse14))) (and (= (mod v_~main$tmp_guard1~0_52 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_71) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= v_~main$tmp_guard1~0_52 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_48 0) (= v_~__unbuffered_p0_EAX~0_87 0) (= v_~__unbuffered_p2_EAX~0_130 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_46| 0)) (= (mod v_~main$tmp_guard0~0_71 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_40|) (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd0~0_115 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_467 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_121) v_~x$r_buff1_thd0~0_120) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_46| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_40|) (let ((.cse2 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_74 256) 0)) (.cse3 (= |v_ULTIMATE.start_main_#t~mem35#1_124| |v_ULTIMATE.start_main_#t~mem35#1_122|))) (or (and (= v_~__unbuffered_p2_EAX~0_131 v_~__unbuffered_p2_EAX~0_130) .cse2 (= |v_ULTIMATE.start_main_#t~ite36#1_123| |v_ULTIMATE.start_main_#t~ite36#1_121|) .cse3) (and (not .cse2) (= |v_ULTIMATE.start_main_#t~ite36#1_121| v_~__unbuffered_p2_EAX~0_130) (let ((.cse4 (= (mod v_~weak$$choice1~0_65 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem35#1_122| (select (select |v_#memory_int_566| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_83) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_83)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem35#1_122| |v_ULTIMATE.start_main_#t~ite36#1_121|)) (and (= |v_ULTIMATE.start_main_#t~ite36#1_121| v_~__unbuffered_p2_EAX~0_131) .cse4 .cse3)))))) (= |v_#memory_int_566| (store |v_#memory_int_567| |v_~#x~0.base_263| (store .cse5 |v_~#x~0.offset_263| |v_ULTIMATE.start_main_#t~ite33#1_116|))) (= v_~x$r_buff0_thd0~0_115 (ite .cse6 0 v_~x$r_buff0_thd0~0_116)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~x$w_buff0_used~0_485 (ite (and .cse7 .cse8) 0 v_~x$w_buff0_used~0_486)) (= (ite (or .cse6 (and .cse9 .cse1)) 0 v_~x$w_buff1_used~0_468) v_~x$w_buff1_used~0_467) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem31#1_145| |v_ULTIMATE.start_main_#t~mem31#1_143|))) (or (and (or (and .cse10 .cse9 .cse1 (= v_~x$w_buff1~0_256 |v_ULTIMATE.start_main_#t~ite32#1_140|)) (and (or .cse11 .cse12) (= |v_ULTIMATE.start_main_#t~mem31#1_143| (select .cse5 |v_~#x~0.offset_263|)) (= |v_ULTIMATE.start_main_#t~mem31#1_143| |v_ULTIMATE.start_main_#t~ite32#1_140|))) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite33#1_116| |v_ULTIMATE.start_main_#t~ite32#1_140|)) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite32#1_142| |v_ULTIMATE.start_main_#t~ite32#1_140|) .cse7 (= |v_ULTIMATE.start_main_#t~ite33#1_116| v_~x$w_buff0~0_246) .cse8))) (= |v_ULTIMATE.start_main_#t~nondet34#1_79| v_~weak$$choice1~0_65))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_246, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_116, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_123|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ~#x~0.offset=|v_~#x~0.offset_263|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_83, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_83, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_79|, ~x$w_buff1~0=v_~x$w_buff1~0_256, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_468, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_121, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_145|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_142|, #memory_int=|v_#memory_int_567|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_124|, ~#x~0.base=|v_~#x~0.base_263|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_246, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_83, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_83, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_74|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, ~weak$$choice1~0=v_~weak$$choice1~0_65, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_47|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_46|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_115, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_59|, ~#x~0.offset=|v_~#x~0.offset_263|, ~x$w_buff1~0=v_~x$w_buff1~0_256, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_467, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_71, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_115|, #memory_int=|v_#memory_int_566|, ~#x~0.base=|v_~#x~0.base_263|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_40|} AuxVars[|v_ULTIMATE.start_main_#t~mem35#1_122|, |v_ULTIMATE.start_main_#t~ite33#1_116|, |v_ULTIMATE.start_main_#t~mem31#1_143|, |v_ULTIMATE.start_main_#t~ite36#1_121|, |v_ULTIMATE.start_main_#t~ite32#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-06 06:44:25,610 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [652] L780-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.base_9| 0) (= |v_P0Thread1of1ForFork1_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] and [685] L856-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse13 (= (mod v_~x$r_buff0_thd0~0_116 256) 0))) (let ((.cse14 (= (mod v_~x$w_buff0_used~0_486 256) 0)) (.cse12 (= (mod v_~x$r_buff1_thd0~0_121 256) 0)) (.cse11 (= 0 (mod v_~x$w_buff1_used~0_468 256))) (.cse0 (not (= (mod v_~x$w_buff0_used~0_485 256) 0))) (.cse7 (not .cse13))) (let ((.cse6 (and .cse0 .cse7)) (.cse9 (not .cse11)) (.cse1 (not .cse12)) (.cse5 (select |v_#memory_int_567| |v_~#x~0.base_263|)) (.cse8 (not .cse14))) (and (= (mod v_~main$tmp_guard1~0_52 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_127 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_71) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43| 0) (= v_~main$tmp_guard1~0_52 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_48 0) (= v_~__unbuffered_p0_EAX~0_87 0) (= v_~__unbuffered_p2_EAX~0_130 1))) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_46| 0)) (= (mod v_~main$tmp_guard0~0_71 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_40|) (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd0~0_115 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_467 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_121) v_~x$r_buff1_thd0~0_120) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_46| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_40|) (let ((.cse2 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_74 256) 0)) (.cse3 (= |v_ULTIMATE.start_main_#t~mem35#1_124| |v_ULTIMATE.start_main_#t~mem35#1_122|))) (or (and (= v_~__unbuffered_p2_EAX~0_131 v_~__unbuffered_p2_EAX~0_130) .cse2 (= |v_ULTIMATE.start_main_#t~ite36#1_123| |v_ULTIMATE.start_main_#t~ite36#1_121|) .cse3) (and (not .cse2) (= |v_ULTIMATE.start_main_#t~ite36#1_121| v_~__unbuffered_p2_EAX~0_130) (let ((.cse4 (= (mod v_~weak$$choice1~0_65 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem35#1_122| (select (select |v_#memory_int_566| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_83) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_83)) (not .cse4) (= |v_ULTIMATE.start_main_#t~mem35#1_122| |v_ULTIMATE.start_main_#t~ite36#1_121|)) (and (= |v_ULTIMATE.start_main_#t~ite36#1_121| v_~__unbuffered_p2_EAX~0_131) .cse4 .cse3)))))) (= |v_#memory_int_566| (store |v_#memory_int_567| |v_~#x~0.base_263| (store .cse5 |v_~#x~0.offset_263| |v_ULTIMATE.start_main_#t~ite33#1_116|))) (= v_~x$r_buff0_thd0~0_115 (ite .cse6 0 v_~x$r_buff0_thd0~0_116)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|) (= v_~x$w_buff0_used~0_485 (ite (and .cse7 .cse8) 0 v_~x$w_buff0_used~0_486)) (= (ite (or .cse6 (and .cse9 .cse1)) 0 v_~x$w_buff1_used~0_468) v_~x$w_buff1_used~0_467) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~mem31#1_145| |v_ULTIMATE.start_main_#t~mem31#1_143|))) (or (and (or (and .cse10 .cse9 .cse1 (= v_~x$w_buff1~0_256 |v_ULTIMATE.start_main_#t~ite32#1_140|)) (and (or .cse11 .cse12) (= |v_ULTIMATE.start_main_#t~mem31#1_143| (select .cse5 |v_~#x~0.offset_263|)) (= |v_ULTIMATE.start_main_#t~mem31#1_143| |v_ULTIMATE.start_main_#t~ite32#1_140|))) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite33#1_116| |v_ULTIMATE.start_main_#t~ite32#1_140|)) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite32#1_142| |v_ULTIMATE.start_main_#t~ite32#1_140|) .cse7 (= |v_ULTIMATE.start_main_#t~ite33#1_116| v_~x$w_buff0~0_246) .cse8))) (= |v_ULTIMATE.start_main_#t~nondet34#1_79| v_~weak$$choice1~0_65))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_246, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_116, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_123|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ~#x~0.offset=|v_~#x~0.offset_263|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_83, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_83, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_79|, ~x$w_buff1~0=v_~x$w_buff1~0_256, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_468, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_121, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_486, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_145|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_142|, #memory_int=|v_#memory_int_567|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_124|, ~#x~0.base=|v_~#x~0.base_263|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_246, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_43|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_83, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_83, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_74|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_87, ~weak$$choice1~0=v_~weak$$choice1~0_65, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_47|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_46|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_130, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_115, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_59|, ~#x~0.offset=|v_~#x~0.offset_263|, ~x$w_buff1~0=v_~x$w_buff1~0_256, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_467, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_71, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_485, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_115|, #memory_int=|v_#memory_int_566|, ~#x~0.base=|v_~#x~0.base_263|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_40|} AuxVars[|v_ULTIMATE.start_main_#t~mem35#1_122|, |v_ULTIMATE.start_main_#t~ite33#1_116|, |v_ULTIMATE.start_main_#t~mem31#1_143|, |v_ULTIMATE.start_main_#t~ite36#1_121|, |v_ULTIMATE.start_main_#t~ite32#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-06 06:44:26,320 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:44:26,321 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3790 [2022-12-06 06:44:26,321 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 140 flow [2022-12-06 06:44:26,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:26,321 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:26,321 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:26,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:44:26,321 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-06 06:44:26,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:26,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1394111387, now seen corresponding path program 1 times [2022-12-06 06:44:26,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:26,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309686831] [2022-12-06 06:44:26,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:26,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:26,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:26,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309686831] [2022-12-06 06:44:26,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309686831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:26,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:26,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27471330] [2022-12-06 06:44:26,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:26,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:44:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:26,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:44:26,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:44:26,490 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:44:26,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 140 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:26,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:26,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:44:26,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:26,602 INFO L130 PetriNetUnfolder]: 196/352 cut-off events. [2022-12-06 06:44:26,603 INFO L131 PetriNetUnfolder]: For 486/486 co-relation queries the response was YES. [2022-12-06 06:44:26,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 352 events. 196/352 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1394 event pairs, 14 based on Foata normal form. 3/355 useless extension candidates. Maximal degree in co-relation 1093. Up to 219 conditions per place. [2022-12-06 06:44:26,604 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 30 selfloop transitions, 1 changer transitions 18/49 dead transitions. [2022-12-06 06:44:26,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 361 flow [2022-12-06 06:44:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:44:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:44:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 06:44:26,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 06:44:26,607 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 140 flow. Second operand 4 states and 40 transitions. [2022-12-06 06:44:26,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 361 flow [2022-12-06 06:44:26,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 49 transitions, 267 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-12-06 06:44:26,609 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 97 flow [2022-12-06 06:44:26,609 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-06 06:44:26,610 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2022-12-06 06:44:26,610 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:26,610 INFO L89 Accepts]: Start accepts. Operand has 35 places, 24 transitions, 97 flow [2022-12-06 06:44:26,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:26,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:26,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 97 flow [2022-12-06 06:44:26,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 97 flow [2022-12-06 06:44:26,617 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-06 06:44:26,617 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 06:44:26,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 40 events. 8/40 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 73. Up to 10 conditions per place. [2022-12-06 06:44:26,617 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 97 flow [2022-12-06 06:44:26,617 INFO L188 LiptonReduction]: Number of co-enabled transitions 132 [2022-12-06 06:44:27,140 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:27,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 531 [2022-12-06 06:44:27,141 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 95 flow [2022-12-06 06:44:27,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:27,141 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:27,141 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:27,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:44:27,141 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-06 06:44:27,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash -113466749, now seen corresponding path program 1 times [2022-12-06 06:44:27,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:27,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126227816] [2022-12-06 06:44:27,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:27,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:28,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:28,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126227816] [2022-12-06 06:44:28,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126227816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:28,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:28,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:44:28,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455650465] [2022-12-06 06:44:28,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:28,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:44:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:28,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:44:28,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:44:28,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-06 06:44:28,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:28,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:28,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-06 06:44:28,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:29,089 INFO L130 PetriNetUnfolder]: 138/284 cut-off events. [2022-12-06 06:44:29,090 INFO L131 PetriNetUnfolder]: For 214/214 co-relation queries the response was YES. [2022-12-06 06:44:29,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 284 events. 138/284 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1189 event pairs, 49 based on Foata normal form. 6/287 useless extension candidates. Maximal degree in co-relation 777. Up to 169 conditions per place. [2022-12-06 06:44:29,091 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 25 selfloop transitions, 7 changer transitions 15/48 dead transitions. [2022-12-06 06:44:29,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 279 flow [2022-12-06 06:44:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:44:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:44:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 06:44:29,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-12-06 06:44:29,092 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 95 flow. Second operand 6 states and 46 transitions. [2022-12-06 06:44:29,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 279 flow [2022-12-06 06:44:29,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 271 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 06:44:29,093 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 136 flow [2022-12-06 06:44:29,094 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-06 06:44:29,094 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2022-12-06 06:44:29,094 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:29,094 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 136 flow [2022-12-06 06:44:29,095 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:29,095 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:29,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 136 flow [2022-12-06 06:44:29,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 136 flow [2022-12-06 06:44:29,107 INFO L130 PetriNetUnfolder]: 21/82 cut-off events. [2022-12-06 06:44:29,107 INFO L131 PetriNetUnfolder]: For 72/75 co-relation queries the response was YES. [2022-12-06 06:44:29,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 82 events. 21/82 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 347 event pairs, 1 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 200. Up to 22 conditions per place. [2022-12-06 06:44:29,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 136 flow [2022-12-06 06:44:29,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-06 06:44:29,143 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [665] $Ultimate##0-->L824: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd3~0_107 256) 0)) (.cse14 (= (mod v_~x$w_buff1_used~0_264 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_276 256) 0)) (.cse2 (= (mod v_~x$r_buff0_thd3~0_114 256) 0))) (let ((.cse5 (not .cse2)) (.cse15 (not .cse16)) (.cse11 (select |v_#memory_int_309| |v_~#x~0.base_167|)) (.cse8 (and .cse14 .cse2)) (.cse3 (and .cse10 .cse2)) (.cse13 (= (mod v_~weak$$choice2~0_110 256) 0))) (let ((.cse1 (= (mod v_~x$w_buff1_used~0_263 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_275 256) 0)) (.cse0 (not .cse13)) (.cse6 (or .cse8 .cse3 .cse16)) (.cse12 (select .cse11 |v_~#x~0.offset_167|)) (.cse7 (and .cse5 .cse15))) (and (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff1~0_142 v_~x$w_buff1~0_141) (= v_~weak$$choice2~0_110 |v_P2Thread1of1ForFork0_#t~nondet15_10|) (= |v_P2Thread1of1ForFork0_#t~nondet14_10| v_~weak$$choice0~0_48) (= (ite .cse0 v_~x$r_buff0_thd3~0_114 (ite (or (and .cse1 .cse2) .cse3 .cse4) v_~x$r_buff0_thd3~0_114 (ite (and (not .cse4) .cse5) 0 v_~x$r_buff0_thd3~0_114))) v_~x$r_buff0_thd3~0_113) (= |v_~#x~0.base_167| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_42) (= (ite .cse0 v_~x$w_buff0_used~0_276 (ite .cse6 v_~x$w_buff0_used~0_276 (ite .cse7 0 v_~x$w_buff0_used~0_276))) v_~x$w_buff0_used~0_275) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~x$flush_delayed~0_76 0) (= v_~x$w_buff1_used~0_263 (ite .cse0 v_~x$w_buff1_used~0_264 (ite (or .cse8 .cse3 .cse4) v_~x$w_buff1_used~0_264 0))) (= (ite .cse0 v_~x$r_buff1_thd3~0_107 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd3~0_113 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse1) .cse4)) v_~x$r_buff1_thd3~0_107 0)) v_~x$r_buff1_thd3~0_106) (= v_~x$w_buff0~0_134 v_~x$w_buff0~0_133) (= (store |v_#memory_int_309| |v_~#x~0.base_167| (store .cse11 |v_~#x~0.offset_167| |v_P2_#t~ite21_32|)) |v_#memory_int_308|) (= |v_~#x~0.offset_167| v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_42) (= v_~__unbuffered_p2_EAX$read_delayed~0_41 1) (= v_~x$mem_tmp~0_46 .cse12) (or (and (= |v_P2_#t~mem20_31| v_~__unbuffered_p2_EAX~0_61) .cse13 (= |v_P2_#t~ite21_32| |v_P2_#t~mem20_31|)) (and (= |v_P2_#t~ite21_32| v_~x$mem_tmp~0_46) (= |v_P2Thread1of1ForFork0_#t~mem20_10| |v_P2_#t~mem20_31|) .cse0)) (or (and .cse6 (= |v_P2_#t~mem17_45| v_~__unbuffered_p2_EAX~0_61) (= |v_P2_#t~mem17_45| .cse12)) (and (or (not .cse10) .cse5) (= |v_P2Thread1of1ForFork0_#t~mem17_10| |v_P2_#t~mem17_45|) (= (ite .cse7 v_~x$w_buff0~0_134 v_~x$w_buff1~0_142) v_~__unbuffered_p2_EAX~0_61) (or .cse5 (not .cse14)) .cse15)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_134, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_167|, ~x$w_buff1~0=v_~x$w_buff1~0_142, P2Thread1of1ForFork0_#t~mem17=|v_P2Thread1of1ForFork0_#t~mem17_10|, P2Thread1of1ForFork0_#t~nondet15=|v_P2Thread1of1ForFork0_#t~nondet15_10|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_107, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_264, P2Thread1of1ForFork0_#t~nondet14=|v_P2Thread1of1ForFork0_#t~nondet14_10|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_114, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_276, #memory_int=|v_#memory_int_309|, ~#x~0.base=|v_~#x~0.base_167|, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0_#t~mem20=|v_P2Thread1of1ForFork0_#t~mem20_10|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_133, P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_7|, P2Thread1of1ForFork0_#t~mem16=|v_P2Thread1of1ForFork0_#t~mem16_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_76, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_42, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_42, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_106, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~#x~0.offset=|v_~#x~0.offset_167|, ~x$w_buff1~0=v_~x$w_buff1~0_141, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_263, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_41, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_275, ~weak$$choice0~0=v_~weak$$choice0~0_48, #memory_int=|v_#memory_int_308|, ~#x~0.base=|v_~#x~0.base_167|, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_7|, ~weak$$choice2~0=v_~weak$$choice2~0_110, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} AuxVars[|v_P2_#t~ite21_32|, |v_P2_#t~mem17_45|, |v_P2_#t~mem20_31|] 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$mem_tmp~0, ~x$r_buff0_thd3~0, P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0_#t~ite21, ~__unbuffered_p2_EAX~0, ~x$w_buff1~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0_#t~nondet15, ~x$w_buff1_used~0, P2Thread1of1ForFork0_#t~nondet14, ~__unbuffered_p2_EAX$read_delayed~0, ~x$w_buff0_used~0, ~weak$$choice0~0, #memory_int, P2Thread1of1ForFork0_#t~ite18, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~mem20] and [615] $Ultimate##0-->L791: Formula: (and (= (store |v_#memory_int_231| |v_~#x~0.base_147| (store (select |v_#memory_int_231| |v_~#x~0.base_147|) |v_~#x~0.offset_147| 1)) |v_#memory_int_230|) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_147|, #memory_int=|v_#memory_int_231|, ~#x~0.base=|v_~#x~0.base_147|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_147|, #memory_int=|v_#memory_int_230|, ~#x~0.base=|v_~#x~0.base_147|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 06:44:29,731 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:29,732 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 638 [2022-12-06 06:44:29,732 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 140 flow [2022-12-06 06:44:29,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:29,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:29,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:29,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:44:29,733 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-06 06:44:29,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:29,733 INFO L85 PathProgramCache]: Analyzing trace with hash -775611873, now seen corresponding path program 2 times [2022-12-06 06:44:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:29,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577176290] [2022-12-06 06:44:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:29,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:31,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:31,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577176290] [2022-12-06 06:44:31,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577176290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:31,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:31,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:44:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045137405] [2022-12-06 06:44:31,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:31,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:44:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:31,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:44:31,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:44:31,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:44:31,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-06 06:44:31,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:31,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:44:31,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:32,060 INFO L130 PetriNetUnfolder]: 137/294 cut-off events. [2022-12-06 06:44:32,060 INFO L131 PetriNetUnfolder]: For 380/382 co-relation queries the response was YES. [2022-12-06 06:44:32,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 294 events. 137/294 cut-off events. For 380/382 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1276 event pairs, 69 based on Foata normal form. 3/292 useless extension candidates. Maximal degree in co-relation 973. Up to 162 conditions per place. [2022-12-06 06:44:32,061 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 25 selfloop transitions, 4 changer transitions 11/41 dead transitions. [2022-12-06 06:44:32,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 278 flow [2022-12-06 06:44:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:32,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:32,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 06:44:32,062 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3894736842105263 [2022-12-06 06:44:32,062 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 140 flow. Second operand 5 states and 37 transitions. [2022-12-06 06:44:32,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 278 flow [2022-12-06 06:44:32,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 264 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 06:44:32,066 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 132 flow [2022-12-06 06:44:32,066 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2022-12-06 06:44:32,067 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-06 06:44:32,067 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:32,067 INFO L89 Accepts]: Start accepts. Operand has 41 places, 23 transitions, 132 flow [2022-12-06 06:44:32,069 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:32,069 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:32,069 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 23 transitions, 132 flow [2022-12-06 06:44:32,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 132 flow [2022-12-06 06:44:32,082 INFO L130 PetriNetUnfolder]: 13/51 cut-off events. [2022-12-06 06:44:32,083 INFO L131 PetriNetUnfolder]: For 76/79 co-relation queries the response was YES. [2022-12-06 06:44:32,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 51 events. 13/51 cut-off events. For 76/79 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 158 event pairs, 3 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 137. Up to 13 conditions per place. [2022-12-06 06:44:32,083 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 23 transitions, 132 flow [2022-12-06 06:44:32,083 INFO L188 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-06 06:44:32,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [689] $Ultimate##0-->L780: Formula: (let ((.cse16 (= (mod v_~x$w_buff0_used~0_502 256) 0)) (.cse6 (= (mod v_~x$r_buff1_thd1~0_122 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_484 256) 0)) (.cse12 (= (mod v_~x$r_buff0_thd1~0_119 256) 0))) (let ((.cse15 (= 0 (mod v_~weak$$choice2~0_143 256))) (.cse0 (select |v_#memory_int_583| |v_~#x~0.base_271|)) (.cse13 (and .cse7 .cse12)) (.cse9 (and .cse6 .cse12)) (.cse5 (not .cse12)) (.cse4 (not .cse16))) (let ((.cse3 (and .cse5 .cse4)) (.cse2 (or .cse13 .cse9 .cse16)) (.cse8 (select .cse0 |v_~#x~0.offset_271|)) (.cse11 (= (mod v_~x$w_buff1_used~0_483 256) 0)) (.cse10 (= (mod v_~x$w_buff0_used~0_501 256) 0)) (.cse1 (not .cse15))) (and (= v_~y~0_33 1) (= (store |v_#memory_int_583| |v_~#x~0.base_271| (store .cse0 |v_~#x~0.offset_271| |v_P0_#t~ite10_55|)) |v_#memory_int_582|) (= (ite .cse1 v_~x$w_buff0_used~0_502 (ite .cse2 v_~x$w_buff0_used~0_502 (ite .cse3 0 v_~x$w_buff0_used~0_502))) v_~x$w_buff0_used~0_501) (= v_~x$w_buff0~0_255 v_~x$w_buff0~0_254) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~x$w_buff1~0_265 v_~x$w_buff1~0_264) (or (and .cse4 (= |v_P0Thread1of1ForFork1_#t~mem6_56| |v_P0_#t~mem6_74|) (or .cse5 (not .cse6)) (= (ite .cse3 v_~x$w_buff0~0_255 v_~x$w_buff1~0_265) v_~__unbuffered_p0_EAX~0_95) (or .cse5 (not .cse7))) (and (= v_~__unbuffered_p0_EAX~0_95 |v_P0_#t~mem6_74|) .cse2 (= .cse8 |v_P0_#t~mem6_74|))) (= v_~x$flush_delayed~0_115 0) (= .cse8 v_~x$mem_tmp~0_85) (= (ite .cse1 v_~x$r_buff0_thd1~0_119 (ite (or .cse9 .cse10 (and .cse11 .cse12)) v_~x$r_buff0_thd1~0_119 (ite (and .cse5 (not .cse10)) 0 v_~x$r_buff0_thd1~0_119))) v_~x$r_buff0_thd1~0_118) (= (ite .cse1 v_~x$w_buff1_used~0_484 (ite (or .cse13 .cse9 .cse10) v_~x$w_buff1_used~0_484 0)) v_~x$w_buff1_used~0_483) (= v_~x$r_buff1_thd1~0_121 (ite .cse1 v_~x$r_buff1_thd1~0_122 (ite (let ((.cse14 (= 0 (mod v_~x$r_buff0_thd1~0_118 256)))) (or (and .cse14 .cse11) .cse10 (and .cse6 .cse14))) v_~x$r_buff1_thd1~0_122 0))) (= |v_P0Thread1of1ForFork1_#t~nondet3_56| v_~weak$$choice0~0_81) (or (and .cse1 (= |v_P0Thread1of1ForFork1_#t~mem9_56| |v_P0_#t~mem9_54|) (= |v_P0_#t~ite10_55| v_~x$mem_tmp~0_85)) (and (= |v_P0_#t~ite10_55| |v_P0_#t~mem9_54|) .cse15 (= v_~__unbuffered_p0_EAX~0_95 |v_P0_#t~mem9_54|))) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= v_~weak$$choice2~0_143 |v_P0Thread1of1ForFork1_#t~nondet4_56|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_255, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_119, ~#x~0.offset=|v_~#x~0.offset_271|, ~x$w_buff1~0=v_~x$w_buff1~0_265, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_484, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_122, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_56|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_502, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_56|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, #memory_int=|v_#memory_int_583|, ~#x~0.base=|v_~#x~0.base_271|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_56|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_56|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_254, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_30|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ~x$flush_delayed~0=v_~x$flush_delayed~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_121, ~x$mem_tmp~0=v_~x$mem_tmp~0_85, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_30|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~y~0=v_~y~0_33, ~#x~0.offset=|v_~#x~0.offset_271|, ~x$w_buff1~0=v_~x$w_buff1~0_264, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_483, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_501, ~weak$$choice0~0=v_~weak$$choice0~0_81, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_30|, #memory_int=|v_#memory_int_582|, ~#x~0.base=|v_~#x~0.base_271|, ~weak$$choice2~0=v_~weak$$choice2~0_143} AuxVars[|v_P0_#t~mem9_54|, |v_P0_#t~mem6_74|, |v_P0_#t~ite10_55|] 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] and [615] $Ultimate##0-->L791: Formula: (and (= (store |v_#memory_int_231| |v_~#x~0.base_147| (store (select |v_#memory_int_231| |v_~#x~0.base_147|) |v_~#x~0.offset_147| 1)) |v_#memory_int_230|) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, ~#x~0.offset=|v_~#x~0.offset_147|, #memory_int=|v_#memory_int_231|, ~#x~0.base=|v_~#x~0.base_147|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~#x~0.offset=|v_~#x~0.offset_147|, #memory_int=|v_#memory_int_230|, ~#x~0.base=|v_~#x~0.base_147|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, #memory_int] [2022-12-06 06:44:32,547 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:32,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 482 [2022-12-06 06:44:32,549 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 128 flow [2022-12-06 06:44:32,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-06 06:44:32,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:32,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:32,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:44:32,550 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-06 06:44:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:32,550 INFO L85 PathProgramCache]: Analyzing trace with hash 904512187, now seen corresponding path program 1 times [2022-12-06 06:44:32,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:32,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991742547] [2022-12-06 06:44:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:32,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:33,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:33,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991742547] [2022-12-06 06:44:33,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991742547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:33,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:33,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:44:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087368158] [2022-12-06 06:44:33,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:33,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:44:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:33,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:44:33,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:44:33,134 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:44:33,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:33,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:33,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:44:33,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:33,283 INFO L130 PetriNetUnfolder]: 65/148 cut-off events. [2022-12-06 06:44:33,284 INFO L131 PetriNetUnfolder]: For 312/312 co-relation queries the response was YES. [2022-12-06 06:44:33,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 148 events. 65/148 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 504 event pairs, 24 based on Foata normal form. 3/149 useless extension candidates. Maximal degree in co-relation 522. Up to 94 conditions per place. [2022-12-06 06:44:33,285 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 22 selfloop transitions, 5 changer transitions 12/40 dead transitions. [2022-12-06 06:44:33,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 282 flow [2022-12-06 06:44:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:44:33,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:44:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-06 06:44:33,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-06 06:44:33,288 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 128 flow. Second operand 6 states and 40 transitions. [2022-12-06 06:44:33,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 282 flow [2022-12-06 06:44:33,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 235 flow, removed 12 selfloop flow, removed 10 redundant places. [2022-12-06 06:44:33,290 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 125 flow [2022-12-06 06:44:33,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2022-12-06 06:44:33,292 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2022-12-06 06:44:33,292 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:33,292 INFO L89 Accepts]: Start accepts. Operand has 37 places, 24 transitions, 125 flow [2022-12-06 06:44:33,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:33,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:33,295 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 24 transitions, 125 flow [2022-12-06 06:44:33,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 125 flow [2022-12-06 06:44:33,308 INFO L130 PetriNetUnfolder]: 17/59 cut-off events. [2022-12-06 06:44:33,309 INFO L131 PetriNetUnfolder]: For 49/51 co-relation queries the response was YES. [2022-12-06 06:44:33,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 59 events. 17/59 cut-off events. For 49/51 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 183 event pairs, 2 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 157. Up to 17 conditions per place. [2022-12-06 06:44:33,309 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 125 flow [2022-12-06 06:44:33,309 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 06:44:33,311 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:44:33,312 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 06:44:33,312 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 125 flow [2022-12-06 06:44:33,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:33,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:33,312 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:33,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:44:33,312 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:44:33,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:33,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1886422373, now seen corresponding path program 2 times [2022-12-06 06:44:33,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:33,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725223775] [2022-12-06 06:44:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:33,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:33,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725223775] [2022-12-06 06:44:33,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725223775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:33,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:33,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:44:33,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530468262] [2022-12-06 06:44:33,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:33,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:44:33,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:44:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:44:33,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:44:33,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:33,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:33,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:44:33,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:34,083 INFO L130 PetriNetUnfolder]: 60/142 cut-off events. [2022-12-06 06:44:34,083 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2022-12-06 06:44:34,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 142 events. 60/142 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 15 based on Foata normal form. 3/143 useless extension candidates. Maximal degree in co-relation 514. Up to 75 conditions per place. [2022-12-06 06:44:34,084 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 25 selfloop transitions, 8 changer transitions 12/46 dead transitions. [2022-12-06 06:44:34,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 321 flow [2022-12-06 06:44:34,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:44:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:44:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-12-06 06:44:34,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-06 06:44:34,085 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 125 flow. Second operand 6 states and 42 transitions. [2022-12-06 06:44:34,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 321 flow [2022-12-06 06:44:34,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 285 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-12-06 06:44:34,087 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 160 flow [2022-12-06 06:44:34,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-06 06:44:34,087 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2022-12-06 06:44:34,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:34,087 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 160 flow [2022-12-06 06:44:34,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:34,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:34,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 160 flow [2022-12-06 06:44:34,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 160 flow [2022-12-06 06:44:34,097 INFO L130 PetriNetUnfolder]: 19/65 cut-off events. [2022-12-06 06:44:34,097 INFO L131 PetriNetUnfolder]: For 69/74 co-relation queries the response was YES. [2022-12-06 06:44:34,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 65 events. 19/65 cut-off events. For 69/74 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 223 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 175. Up to 18 conditions per place. [2022-12-06 06:44:34,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 28 transitions, 160 flow [2022-12-06 06:44:34,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 60 [2022-12-06 06:44:34,574 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:44:34,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 489 [2022-12-06 06:44:34,576 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 162 flow [2022-12-06 06:44:34,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:34,578 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:34,578 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:34,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:44:34,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:44:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash 927727381, now seen corresponding path program 1 times [2022-12-06 06:44:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:34,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826274067] [2022-12-06 06:44:34,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:44:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:44:35,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:44:35,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826274067] [2022-12-06 06:44:35,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826274067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:44:35,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:44:35,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:44:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049598210] [2022-12-06 06:44:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:44:35,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:44:35,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:44:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:44:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:44:35,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:44:35,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:35,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:44:35,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:44:35,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:44:35,730 INFO L130 PetriNetUnfolder]: 56/134 cut-off events. [2022-12-06 06:44:35,730 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-12-06 06:44:35,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 134 events. 56/134 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 447 event pairs, 17 based on Foata normal form. 3/137 useless extension candidates. Maximal degree in co-relation 489. Up to 73 conditions per place. [2022-12-06 06:44:35,731 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 18 selfloop transitions, 8 changer transitions 11/38 dead transitions. [2022-12-06 06:44:35,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 284 flow [2022-12-06 06:44:35,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:44:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:44:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-06 06:44:35,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-06 06:44:35,732 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 162 flow. Second operand 5 states and 34 transitions. [2022-12-06 06:44:35,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 284 flow [2022-12-06 06:44:35,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 267 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 06:44:35,733 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 142 flow [2022-12-06 06:44:35,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-06 06:44:35,734 INFO L294 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2022-12-06 06:44:35,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:44:35,734 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 142 flow [2022-12-06 06:44:35,734 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:44:35,734 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:44:35,735 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 142 flow [2022-12-06 06:44:35,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 142 flow [2022-12-06 06:44:35,744 INFO L130 PetriNetUnfolder]: 14/49 cut-off events. [2022-12-06 06:44:35,744 INFO L131 PetriNetUnfolder]: For 46/47 co-relation queries the response was YES. [2022-12-06 06:44:35,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 49 events. 14/49 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 133 event pairs, 0 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 124. Up to 16 conditions per place. [2022-12-06 06:44:35,744 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 142 flow [2022-12-06 06:44:35,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-06 06:44:35,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [686] L834-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse13 (= (mod v_~x$r_buff0_thd0~0_120 256) 0))) (let ((.cse11 (= (mod v_~x$r_buff1_thd0~0_125 256) 0)) (.cse14 (not (= 0 (mod v_~x$w_buff0_used~0_489 256)))) (.cse8 (not .cse13)) (.cse10 (= (mod v_~x$w_buff1_used~0_472 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_490 256) 0))) (let ((.cse7 (not .cse12)) (.cse6 (select |v_#memory_int_571| |v_~#x~0.base_265|)) (.cse5 (not .cse10)) (.cse3 (and .cse14 .cse8)) (.cse4 (not .cse11))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_48| 0)) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem35#1_129| |v_ULTIMATE.start_main_#t~mem35#1_131|)) (.cse1 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_76 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite36#1_128| |v_ULTIMATE.start_main_#t~ite36#1_130|) (= v_~__unbuffered_p2_EAX~0_135 v_~__unbuffered_p2_EAX~0_134) .cse0 .cse1) (and (let ((.cse2 (= (mod v_~weak$$choice1~0_67 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite36#1_128| v_~__unbuffered_p2_EAX~0_135) .cse0 .cse2) (and (= |v_ULTIMATE.start_main_#t~mem35#1_129| (select (select |v_#memory_int_570| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_85) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_85)) (not .cse2) (= |v_ULTIMATE.start_main_#t~mem35#1_129| |v_ULTIMATE.start_main_#t~ite36#1_128|)))) (= |v_ULTIMATE.start_main_#t~ite36#1_128| v_~__unbuffered_p2_EAX~0_134) (not .cse1)))) (= |v_P2Thread1of1ForFork0_#res.base_19| 0) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_472) v_~x$w_buff1_used~0_471) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EAX~0_134 1) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~__unbuffered_p0_EAX~0_89 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= (mod v_~main$tmp_guard0~0_73 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_42|) (= |v_ULTIMATE.start_main_#t~nondet34#1_83| v_~weak$$choice1~0_67) (= (store |v_#memory_int_571| |v_~#x~0.base_265| (store .cse6 |v_~#x~0.offset_265| |v_ULTIMATE.start_main_#t~ite33#1_121|)) |v_#memory_int_570|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_129 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_73) (= v_~x$w_buff0_used~0_489 (ite (and .cse7 .cse8) 0 v_~x$w_buff0_used~0_490)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_48| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_42|) (= |v_P2Thread1of1ForFork0_#res.offset_19| 0) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem31#1_152| |v_ULTIMATE.start_main_#t~mem31#1_150|))) (or (and .cse7 .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite32#1_149| |v_ULTIMATE.start_main_#t~ite32#1_147|) (= |v_ULTIMATE.start_main_#t~ite33#1_121| v_~x$w_buff0~0_248)) (and (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_150| |v_ULTIMATE.start_main_#t~ite32#1_147|) (= |v_ULTIMATE.start_main_#t~mem31#1_150| (select .cse6 |v_~#x~0.offset_265|)) (or .cse10 .cse11)) (and (= v_~x$w_buff1~0_258 |v_ULTIMATE.start_main_#t~ite32#1_147|) .cse4 .cse5 .cse9)) (= |v_ULTIMATE.start_main_#t~ite33#1_121| |v_ULTIMATE.start_main_#t~ite32#1_147|) (or .cse12 .cse13)))) (= v_~x$r_buff0_thd0~0_119 (ite .cse3 0 v_~x$r_buff0_thd0~0_120)) (= v_~x$r_buff1_thd0~0_124 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_471 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_119 256) 0)))) 0 v_~x$r_buff1_thd0~0_125)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= v_~__unbuffered_cnt~0_129 (+ v_~__unbuffered_cnt~0_130 1)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_248, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_120, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_130|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ~#x~0.offset=|v_~#x~0.offset_265|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_85, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_85, ~x$w_buff1~0=v_~x$w_buff1~0_258, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_83|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_472, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_125, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_490, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_152|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_149|, #memory_int=|v_#memory_int_571|, ~#x~0.base=|v_~#x~0.base_265|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_131|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_135, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_248, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_85, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_85, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_76|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ~weak$$choice1~0=v_~weak$$choice1~0_67, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_134, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_119, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_61|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_19|, ~#x~0.offset=|v_~#x~0.offset_265|, ~x$w_buff1~0=v_~x$w_buff1~0_258, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_471, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_73, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_124, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_489, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_120|, #memory_int=|v_#memory_int_570|, ~#x~0.base=|v_~#x~0.base_265|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_42|} AuxVars[|v_ULTIMATE.start_main_#t~mem35#1_129|, |v_ULTIMATE.start_main_#t~ite36#1_128|, |v_ULTIMATE.start_main_#t~ite32#1_147|, |v_ULTIMATE.start_main_#t~mem31#1_150|, |v_ULTIMATE.start_main_#t~ite33#1_121|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#res.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre29#1, P2Thread1of1ForFork0_#res.base, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [691] $Ultimate##0-->L791: Formula: (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_166 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_554 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_579 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_163 256) 0))) (let ((.cse9 (= (mod v_~weak$$choice2~0_162 256) 0)) (.cse5 (not .cse3)) (.cse11 (not .cse16)) (.cse15 (and .cse3 .cse10)) (.cse4 (and .cse7 .cse3)) (.cse6 (select |v_#memory_int_675| |v_~#x~0.base_309|))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_553 256) 0)) (.cse14 (select .cse6 |v_~#x~0.offset_309|)) (.cse13 (or .cse15 .cse16 .cse4)) (.cse12 (and .cse5 .cse11)) (.cse0 (not .cse9)) (.cse1 (= (mod v_~x$w_buff0_used~0_578 256) 0))) (and (= v_~x$r_buff0_thd1~0_162 (ite .cse0 v_~x$r_buff0_thd1~0_163 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_163 (ite (and .cse5 (not .cse1)) 0 v_~x$r_buff0_thd1~0_163)))) (= |v_P0Thread1of1ForFork1_#in~arg.base_32| v_P0Thread1of1ForFork1_~arg.base_32) (= (store |v_#memory_int_675| |v_~#x~0.base_309| (store .cse6 |v_~#x~0.offset_309| 1)) |v_#memory_int_673|) (= (ite .cse0 v_~x$r_buff1_thd1~0_166 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_162 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse2 .cse8))) v_~x$r_buff1_thd1~0_166 0)) v_~x$r_buff1_thd1~0_165) (or (and (= |v_P0_#t~ite10_74| |v_P0_#t~mem9_73|) (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem9_73|) .cse9) (and (= |v_P0Thread1of1ForFork1_#t~mem9_90| |v_P0_#t~mem9_73|) .cse0 (= |v_P0_#t~ite10_74| v_~x$mem_tmp~0_104))) (= |v_P1Thread1of1ForFork2_#in~arg.base_44| v_P1Thread1of1ForFork2_~arg.base_44) (= v_~x$w_buff1~0_322 v_~x$w_buff1~0_321) (or (and (or (not .cse7) .cse5) (or .cse5 (not .cse10)) (= |v_P0Thread1of1ForFork1_#t~mem6_90| |v_P0_#t~mem6_93|) .cse11 (= v_~__unbuffered_p0_EAX~0_116 (ite .cse12 v_~x$w_buff0~0_305 v_~x$w_buff1~0_322))) (and .cse13 (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem6_93|) (= .cse14 |v_P0_#t~mem6_93|))) (= .cse14 v_~x$mem_tmp~0_104) (= (ite .cse0 v_~x$w_buff0_used~0_579 (ite .cse13 v_~x$w_buff0_used~0_579 (ite .cse12 0 v_~x$w_buff0_used~0_579))) v_~x$w_buff0_used~0_578) (= |v_P0Thread1of1ForFork1_#t~nondet3_90| v_~weak$$choice0~0_100) (= v_~x$w_buff0~0_305 v_~x$w_buff0~0_304) (= v_P0Thread1of1ForFork1_~arg.offset_32 |v_P0Thread1of1ForFork1_#in~arg.offset_32|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_44| v_P1Thread1of1ForFork2_~arg.offset_44) (= v_~y~0_50 1) (= v_~x$flush_delayed~0_134 0) (= (ite .cse0 v_~x$w_buff1_used~0_554 (ite (or .cse1 .cse15 .cse4) v_~x$w_buff1_used~0_554 0)) v_~x$w_buff1_used~0_553) (= v_~weak$$choice2~0_162 |v_P0Thread1of1ForFork1_#t~nondet4_90|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_163, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_322, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_166, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_90|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_90|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, #memory_int=|v_#memory_int_675|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_90|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_90|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_47|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_162, ~x$flush_delayed~0=v_~x$flush_delayed~0_134, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$mem_tmp~0=v_~x$mem_tmp~0_104, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_47|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_47|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_32, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_32, ~y~0=v_~y~0_50, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_44, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_321, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_44, ~weak$$choice0~0=v_~weak$$choice0~0_100, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_47|, #memory_int=|v_#memory_int_673|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, ~weak$$choice2~0=v_~weak$$choice2~0_162} AuxVars[|v_P0_#t~mem9_73|, |v_P0_#t~mem6_93|, |v_P0_#t~ite10_74|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork2_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2_~arg.offset, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 06:44:37,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [687] L799-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd0~0_124 256) 0))) (let ((.cse3 (not .cse6)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_493 256) 0))) (.cse7 (= (mod v_~x$w_buff0_used~0_494 256) 0)) (.cse9 (= 0 (mod v_~x$r_buff1_thd0~0_129 256))) (.cse10 (= (mod v_~x$w_buff1_used~0_476 256) 0))) (let ((.cse1 (not .cse10)) (.cse0 (not .cse9)) (.cse4 (not .cse7)) (.cse8 (select |v_#memory_int_575| |v_~#x~0.base_267|)) (.cse2 (and .cse3 .cse11))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_50| 0)) (= (mod v_~main$tmp_guard0~0_75 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_44|) (= (mod v_~main$tmp_guard1~0_56 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_138 1) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~__unbuffered_p0_EAX~0_91 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_56) (= v_~x$w_buff1_used~0_475 (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_476)) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~mem31#1_158| |v_ULTIMATE.start_main_#t~mem31#1_156|))) (or (and .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite32#1_153| |v_ULTIMATE.start_main_#t~ite32#1_155|) (= |v_ULTIMATE.start_main_#t~ite33#1_125| v_~x$w_buff0~0_250) .cse5) (and (or .cse6 .cse7) (= |v_ULTIMATE.start_main_#t~ite33#1_125| |v_ULTIMATE.start_main_#t~ite32#1_153|) (or (and (= v_~x$w_buff1~0_260 |v_ULTIMATE.start_main_#t~ite32#1_153|) .cse0 .cse5 .cse1) (and (= |v_ULTIMATE.start_main_#t~mem31#1_156| |v_ULTIMATE.start_main_#t~ite32#1_153|) (= (select .cse8 |v_~#x~0.offset_267|) |v_ULTIMATE.start_main_#t~mem31#1_156|) (or .cse9 .cse10)))))) (= v_~x$r_buff1_thd0~0_128 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_475 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd0~0_123 256) 0)) .cse11)) 0 v_~x$r_buff1_thd0~0_129)) (= v_~x$w_buff0_used~0_493 (ite (and .cse3 .cse4) 0 v_~x$w_buff0_used~0_494)) (= v_~main$tmp_guard0~0_75 (ite (= (ite (= v_~__unbuffered_cnt~0_133 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_50| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_44|) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (store |v_#memory_int_575| |v_~#x~0.base_267| (store .cse8 |v_~#x~0.offset_267| |v_ULTIMATE.start_main_#t~ite33#1_125|)) |v_#memory_int_574|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_23|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem35#1_137| |v_ULTIMATE.start_main_#t~mem35#1_135|)) (.cse12 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_78 256) 0))) (or (and (not .cse12) (= |v_ULTIMATE.start_main_#t~ite36#1_134| v_~__unbuffered_p2_EAX~0_138) (let ((.cse13 (= 0 (mod v_~weak$$choice1~0_69 256)))) (or (and .cse13 .cse14 (= |v_ULTIMATE.start_main_#t~ite36#1_134| v_~__unbuffered_p2_EAX~0_139)) (and (= (select (select |v_#memory_int_574| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_87) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_87) |v_ULTIMATE.start_main_#t~mem35#1_135|) (= |v_ULTIMATE.start_main_#t~mem35#1_135| |v_ULTIMATE.start_main_#t~ite36#1_134|) (not .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite36#1_136| |v_ULTIMATE.start_main_#t~ite36#1_134|) .cse14 .cse12 (= v_~__unbuffered_p2_EAX~0_139 v_~__unbuffered_p2_EAX~0_138)))) (= v_~x$r_buff0_thd0~0_123 (ite .cse2 0 v_~x$r_buff0_thd0~0_124)) (= |v_ULTIMATE.start_main_#t~nondet34#1_87| v_~weak$$choice1~0_69) (= |v_P1Thread1of1ForFork2_#res.base_23| 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_250, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_136|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ~#x~0.offset=|v_~#x~0.offset_267|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_87, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_87, ~x$w_buff1~0=v_~x$w_buff1~0_260, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_87|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_476, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_129, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_494, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_158|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_155|, #memory_int=|v_#memory_int_575|, ~#x~0.base=|v_~#x~0.base_267|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_137|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_139, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_250, 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_87, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_87, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_78|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~weak$$choice1~0=v_~weak$$choice1~0_69, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_50|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_138, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_63|, ~#x~0.offset=|v_~#x~0.offset_267|, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_260, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_475, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_75, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_128, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_493, 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_124|, #memory_int=|v_#memory_int_574|, ~#x~0.base=|v_~#x~0.base_267|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_44|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_23|} AuxVars[|v_ULTIMATE.start_main_#t~mem35#1_135|, |v_ULTIMATE.start_main_#t~ite33#1_125|, |v_ULTIMATE.start_main_#t~mem31#1_156|, |v_ULTIMATE.start_main_#t~ite36#1_134|, |v_ULTIMATE.start_main_#t~ite32#1_153|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre29#1, P1Thread1of1ForFork2_#res.offset, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, P1Thread1of1ForFork2_#res.base] and [691] $Ultimate##0-->L791: Formula: (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_166 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_554 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_579 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_163 256) 0))) (let ((.cse9 (= (mod v_~weak$$choice2~0_162 256) 0)) (.cse5 (not .cse3)) (.cse11 (not .cse16)) (.cse15 (and .cse3 .cse10)) (.cse4 (and .cse7 .cse3)) (.cse6 (select |v_#memory_int_675| |v_~#x~0.base_309|))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_553 256) 0)) (.cse14 (select .cse6 |v_~#x~0.offset_309|)) (.cse13 (or .cse15 .cse16 .cse4)) (.cse12 (and .cse5 .cse11)) (.cse0 (not .cse9)) (.cse1 (= (mod v_~x$w_buff0_used~0_578 256) 0))) (and (= v_~x$r_buff0_thd1~0_162 (ite .cse0 v_~x$r_buff0_thd1~0_163 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_163 (ite (and .cse5 (not .cse1)) 0 v_~x$r_buff0_thd1~0_163)))) (= |v_P0Thread1of1ForFork1_#in~arg.base_32| v_P0Thread1of1ForFork1_~arg.base_32) (= (store |v_#memory_int_675| |v_~#x~0.base_309| (store .cse6 |v_~#x~0.offset_309| 1)) |v_#memory_int_673|) (= (ite .cse0 v_~x$r_buff1_thd1~0_166 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_162 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse2 .cse8))) v_~x$r_buff1_thd1~0_166 0)) v_~x$r_buff1_thd1~0_165) (or (and (= |v_P0_#t~ite10_74| |v_P0_#t~mem9_73|) (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem9_73|) .cse9) (and (= |v_P0Thread1of1ForFork1_#t~mem9_90| |v_P0_#t~mem9_73|) .cse0 (= |v_P0_#t~ite10_74| v_~x$mem_tmp~0_104))) (= |v_P1Thread1of1ForFork2_#in~arg.base_44| v_P1Thread1of1ForFork2_~arg.base_44) (= v_~x$w_buff1~0_322 v_~x$w_buff1~0_321) (or (and (or (not .cse7) .cse5) (or .cse5 (not .cse10)) (= |v_P0Thread1of1ForFork1_#t~mem6_90| |v_P0_#t~mem6_93|) .cse11 (= v_~__unbuffered_p0_EAX~0_116 (ite .cse12 v_~x$w_buff0~0_305 v_~x$w_buff1~0_322))) (and .cse13 (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem6_93|) (= .cse14 |v_P0_#t~mem6_93|))) (= .cse14 v_~x$mem_tmp~0_104) (= (ite .cse0 v_~x$w_buff0_used~0_579 (ite .cse13 v_~x$w_buff0_used~0_579 (ite .cse12 0 v_~x$w_buff0_used~0_579))) v_~x$w_buff0_used~0_578) (= |v_P0Thread1of1ForFork1_#t~nondet3_90| v_~weak$$choice0~0_100) (= v_~x$w_buff0~0_305 v_~x$w_buff0~0_304) (= v_P0Thread1of1ForFork1_~arg.offset_32 |v_P0Thread1of1ForFork1_#in~arg.offset_32|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_44| v_P1Thread1of1ForFork2_~arg.offset_44) (= v_~y~0_50 1) (= v_~x$flush_delayed~0_134 0) (= (ite .cse0 v_~x$w_buff1_used~0_554 (ite (or .cse1 .cse15 .cse4) v_~x$w_buff1_used~0_554 0)) v_~x$w_buff1_used~0_553) (= v_~weak$$choice2~0_162 |v_P0Thread1of1ForFork1_#t~nondet4_90|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_163, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_322, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_166, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_90|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_90|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, #memory_int=|v_#memory_int_675|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_90|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_90|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_47|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_162, ~x$flush_delayed~0=v_~x$flush_delayed~0_134, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$mem_tmp~0=v_~x$mem_tmp~0_104, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_47|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_47|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_32, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_32, ~y~0=v_~y~0_50, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_44, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_321, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_44, ~weak$$choice0~0=v_~weak$$choice0~0_100, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_47|, #memory_int=|v_#memory_int_673|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, ~weak$$choice2~0=v_~weak$$choice2~0_162} AuxVars[|v_P0_#t~mem9_73|, |v_P0_#t~mem6_93|, |v_P0_#t~ite10_74|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork2_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2_~arg.offset, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 06:44:39,468 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] L780-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_128 256) 0))) (let ((.cse3 (= (mod v_~x$w_buff0_used~0_498 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_497 256) 0))) (.cse10 (not .cse2)) (.cse7 (= (mod v_~x$w_buff1_used~0_480 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd0~0_133 256) 0))) (let ((.cse6 (select |v_#memory_int_579| |v_~#x~0.base_269|)) (.cse1 (not .cse8)) (.cse5 (not .cse7)) (.cse14 (and .cse0 .cse10)) (.cse9 (not .cse3))) (and (= v_~__unbuffered_cnt~0_137 (+ v_~__unbuffered_cnt~0_138 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49| 0) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_479 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_133) v_~x$r_buff1_thd0~0_132) (let ((.cse4 (= |v_ULTIMATE.start_main_#t~mem31#1_164| |v_ULTIMATE.start_main_#t~mem31#1_162|))) (or (and (or .cse2 .cse3) (= |v_ULTIMATE.start_main_#t~ite33#1_129| |v_ULTIMATE.start_main_#t~ite32#1_159|) (or (and (= v_~x$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite32#1_159|) .cse4 .cse1 .cse5) (and (= |v_ULTIMATE.start_main_#t~mem31#1_162| (select .cse6 |v_~#x~0.offset_269|)) (= |v_ULTIMATE.start_main_#t~mem31#1_162| |v_ULTIMATE.start_main_#t~ite32#1_159|) (or .cse7 .cse8)))) (and .cse9 .cse10 (= |v_ULTIMATE.start_main_#t~ite33#1_129| v_~x$w_buff0~0_252) .cse4 (= |v_ULTIMATE.start_main_#t~ite32#1_159| |v_ULTIMATE.start_main_#t~ite32#1_161|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_52| 0)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_137 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_77) (= (store |v_#memory_int_579| |v_~#x~0.base_269| (store .cse6 |v_~#x~0.offset_269| |v_ULTIMATE.start_main_#t~ite33#1_129|)) |v_#memory_int_578|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_142 1) (= v_~__unbuffered_p0_EAX~0_93 0) (= v_~__unbuffered_p2_EBX~0_54 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem35#1_143| |v_ULTIMATE.start_main_#t~mem35#1_141|)) (.cse12 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_80 256) 0))) (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_142| |v_ULTIMATE.start_main_#t~ite36#1_140|) (= v_~__unbuffered_p2_EAX~0_143 v_~__unbuffered_p2_EAX~0_142) .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_140| v_~__unbuffered_p2_EAX~0_143) .cse13) (and (= |v_ULTIMATE.start_main_#t~mem35#1_141| (select (select |v_#memory_int_578| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_89) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_89)) (not .cse13) (= |v_ULTIMATE.start_main_#t~mem35#1_141| |v_ULTIMATE.start_main_#t~ite36#1_140|)))) (= |v_ULTIMATE.start_main_#t~ite36#1_140| v_~__unbuffered_p2_EAX~0_142) (not .cse12)))) (= (mod v_~main$tmp_guard0~0_77 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_46|) (= v_~x$w_buff1_used~0_479 (ite (or .cse14 (and .cse1 .cse5)) 0 v_~x$w_buff1_used~0_480)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|) (= |v_P0Thread1of1ForFork1_#res.offset_19| 0) (= |v_P0Thread1of1ForFork1_#res.base_19| 0) (= v_~x$r_buff0_thd0~0_127 (ite .cse14 0 v_~x$r_buff0_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_52| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_46|) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_498) v_~x$w_buff0_used~0_497) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_252, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_142|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ~#x~0.offset=|v_~#x~0.offset_269|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_89, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_89, ~x$w_buff1~0=v_~x$w_buff1~0_262, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_480, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_133, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_498, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_93, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_164|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_161|, #memory_int=|v_#memory_int_579|, ~#x~0.base=|v_~#x~0.base_269|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_143|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_252, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_19|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_89, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_89, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_19|, ~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_93, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_53|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_142, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_65|, ~#x~0.offset=|v_~#x~0.offset_269|, ~x$w_buff1~0=v_~x$w_buff1~0_262, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_479, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_77, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_497, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_128|, #memory_int=|v_#memory_int_578|, ~#x~0.base=|v_~#x~0.base_269|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_46|} AuxVars[|v_ULTIMATE.start_main_#t~ite33#1_129|, |v_ULTIMATE.start_main_#t~mem31#1_162|, |v_ULTIMATE.start_main_#t~ite32#1_159|, |v_ULTIMATE.start_main_#t~mem35#1_141|, |v_ULTIMATE.start_main_#t~ite36#1_140|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, P0Thread1of1ForFork1_#res.offset, ULTIMATE.start_main_#t~nondet34#1, P0Thread1of1ForFork1_#res.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre29#1, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [691] $Ultimate##0-->L791: Formula: (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_166 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_554 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_579 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_163 256) 0))) (let ((.cse9 (= (mod v_~weak$$choice2~0_162 256) 0)) (.cse5 (not .cse3)) (.cse11 (not .cse16)) (.cse15 (and .cse3 .cse10)) (.cse4 (and .cse7 .cse3)) (.cse6 (select |v_#memory_int_675| |v_~#x~0.base_309|))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_553 256) 0)) (.cse14 (select .cse6 |v_~#x~0.offset_309|)) (.cse13 (or .cse15 .cse16 .cse4)) (.cse12 (and .cse5 .cse11)) (.cse0 (not .cse9)) (.cse1 (= (mod v_~x$w_buff0_used~0_578 256) 0))) (and (= v_~x$r_buff0_thd1~0_162 (ite .cse0 v_~x$r_buff0_thd1~0_163 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_163 (ite (and .cse5 (not .cse1)) 0 v_~x$r_buff0_thd1~0_163)))) (= |v_P0Thread1of1ForFork1_#in~arg.base_32| v_P0Thread1of1ForFork1_~arg.base_32) (= (store |v_#memory_int_675| |v_~#x~0.base_309| (store .cse6 |v_~#x~0.offset_309| 1)) |v_#memory_int_673|) (= (ite .cse0 v_~x$r_buff1_thd1~0_166 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_162 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse2 .cse8))) v_~x$r_buff1_thd1~0_166 0)) v_~x$r_buff1_thd1~0_165) (or (and (= |v_P0_#t~ite10_74| |v_P0_#t~mem9_73|) (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem9_73|) .cse9) (and (= |v_P0Thread1of1ForFork1_#t~mem9_90| |v_P0_#t~mem9_73|) .cse0 (= |v_P0_#t~ite10_74| v_~x$mem_tmp~0_104))) (= |v_P1Thread1of1ForFork2_#in~arg.base_44| v_P1Thread1of1ForFork2_~arg.base_44) (= v_~x$w_buff1~0_322 v_~x$w_buff1~0_321) (or (and (or (not .cse7) .cse5) (or .cse5 (not .cse10)) (= |v_P0Thread1of1ForFork1_#t~mem6_90| |v_P0_#t~mem6_93|) .cse11 (= v_~__unbuffered_p0_EAX~0_116 (ite .cse12 v_~x$w_buff0~0_305 v_~x$w_buff1~0_322))) (and .cse13 (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem6_93|) (= .cse14 |v_P0_#t~mem6_93|))) (= .cse14 v_~x$mem_tmp~0_104) (= (ite .cse0 v_~x$w_buff0_used~0_579 (ite .cse13 v_~x$w_buff0_used~0_579 (ite .cse12 0 v_~x$w_buff0_used~0_579))) v_~x$w_buff0_used~0_578) (= |v_P0Thread1of1ForFork1_#t~nondet3_90| v_~weak$$choice0~0_100) (= v_~x$w_buff0~0_305 v_~x$w_buff0~0_304) (= v_P0Thread1of1ForFork1_~arg.offset_32 |v_P0Thread1of1ForFork1_#in~arg.offset_32|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_44| v_P1Thread1of1ForFork2_~arg.offset_44) (= v_~y~0_50 1) (= v_~x$flush_delayed~0_134 0) (= (ite .cse0 v_~x$w_buff1_used~0_554 (ite (or .cse1 .cse15 .cse4) v_~x$w_buff1_used~0_554 0)) v_~x$w_buff1_used~0_553) (= v_~weak$$choice2~0_162 |v_P0Thread1of1ForFork1_#t~nondet4_90|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_163, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_322, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_166, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_90|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_90|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, #memory_int=|v_#memory_int_675|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_90|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_90|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_47|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_162, ~x$flush_delayed~0=v_~x$flush_delayed~0_134, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$mem_tmp~0=v_~x$mem_tmp~0_104, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_47|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_47|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_32, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_32, ~y~0=v_~y~0_50, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_44, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_321, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_44, ~weak$$choice0~0=v_~weak$$choice0~0_100, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_47|, #memory_int=|v_#memory_int_673|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, ~weak$$choice2~0=v_~weak$$choice2~0_162} AuxVars[|v_P0_#t~mem9_73|, |v_P0_#t~mem6_93|, |v_P0_#t~ite10_74|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork2_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2_~arg.offset, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 06:44:41,419 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [686] L834-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse13 (= (mod v_~x$r_buff0_thd0~0_120 256) 0))) (let ((.cse11 (= (mod v_~x$r_buff1_thd0~0_125 256) 0)) (.cse14 (not (= 0 (mod v_~x$w_buff0_used~0_489 256)))) (.cse8 (not .cse13)) (.cse10 (= (mod v_~x$w_buff1_used~0_472 256) 0)) (.cse12 (= (mod v_~x$w_buff0_used~0_490 256) 0))) (let ((.cse7 (not .cse12)) (.cse6 (select |v_#memory_int_571| |v_~#x~0.base_265|)) (.cse5 (not .cse10)) (.cse3 (and .cse14 .cse8)) (.cse4 (not .cse11))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_48| 0)) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem35#1_129| |v_ULTIMATE.start_main_#t~mem35#1_131|)) (.cse1 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_76 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite36#1_128| |v_ULTIMATE.start_main_#t~ite36#1_130|) (= v_~__unbuffered_p2_EAX~0_135 v_~__unbuffered_p2_EAX~0_134) .cse0 .cse1) (and (let ((.cse2 (= (mod v_~weak$$choice1~0_67 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite36#1_128| v_~__unbuffered_p2_EAX~0_135) .cse0 .cse2) (and (= |v_ULTIMATE.start_main_#t~mem35#1_129| (select (select |v_#memory_int_570| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_85) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_85)) (not .cse2) (= |v_ULTIMATE.start_main_#t~mem35#1_129| |v_ULTIMATE.start_main_#t~ite36#1_128|)))) (= |v_ULTIMATE.start_main_#t~ite36#1_128| v_~__unbuffered_p2_EAX~0_134) (not .cse1)))) (= |v_P2Thread1of1ForFork0_#res.base_19| 0) (= (ite (or .cse3 (and .cse4 .cse5)) 0 v_~x$w_buff1_used~0_472) v_~x$w_buff1_used~0_471) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EAX~0_134 1) (= v_~__unbuffered_p2_EBX~0_50 0) (= v_~__unbuffered_p0_EAX~0_89 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_54) (= (mod v_~main$tmp_guard1~0_54 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|) (= (mod v_~main$tmp_guard0~0_73 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_42|) (= |v_ULTIMATE.start_main_#t~nondet34#1_83| v_~weak$$choice1~0_67) (= (store |v_#memory_int_571| |v_~#x~0.base_265| (store .cse6 |v_~#x~0.offset_265| |v_ULTIMATE.start_main_#t~ite33#1_121|)) |v_#memory_int_570|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_129 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_73) (= v_~x$w_buff0_used~0_489 (ite (and .cse7 .cse8) 0 v_~x$w_buff0_used~0_490)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_48| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_42|) (= |v_P2Thread1of1ForFork0_#res.offset_19| 0) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~mem31#1_152| |v_ULTIMATE.start_main_#t~mem31#1_150|))) (or (and .cse7 .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite32#1_149| |v_ULTIMATE.start_main_#t~ite32#1_147|) (= |v_ULTIMATE.start_main_#t~ite33#1_121| v_~x$w_buff0~0_248)) (and (or (and (= |v_ULTIMATE.start_main_#t~mem31#1_150| |v_ULTIMATE.start_main_#t~ite32#1_147|) (= |v_ULTIMATE.start_main_#t~mem31#1_150| (select .cse6 |v_~#x~0.offset_265|)) (or .cse10 .cse11)) (and (= v_~x$w_buff1~0_258 |v_ULTIMATE.start_main_#t~ite32#1_147|) .cse4 .cse5 .cse9)) (= |v_ULTIMATE.start_main_#t~ite33#1_121| |v_ULTIMATE.start_main_#t~ite32#1_147|) (or .cse12 .cse13)))) (= v_~x$r_buff0_thd0~0_119 (ite .cse3 0 v_~x$r_buff0_thd0~0_120)) (= v_~x$r_buff1_thd0~0_124 (ite (or (and .cse4 (not (= (mod v_~x$w_buff1_used~0_471 256) 0))) (and .cse14 (not (= (mod v_~x$r_buff0_thd0~0_119 256) 0)))) 0 v_~x$r_buff1_thd0~0_125)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_45| 0) (= v_~__unbuffered_cnt~0_129 (+ v_~__unbuffered_cnt~0_130 1)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_248, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_120, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_130|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ~#x~0.offset=|v_~#x~0.offset_265|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_85, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_85, ~x$w_buff1~0=v_~x$w_buff1~0_258, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_83|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_472, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_125, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_490, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_152|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_149|, #memory_int=|v_#memory_int_571|, ~#x~0.base=|v_~#x~0.base_265|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_131|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_135, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_248, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_45|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_85, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_85, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_54, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_76|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_89, ~weak$$choice1~0=v_~weak$$choice1~0_67, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_49|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_134, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_19|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_119, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_61|, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_19|, ~#x~0.offset=|v_~#x~0.offset_265|, ~x$w_buff1~0=v_~x$w_buff1~0_258, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_471, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_73, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_124, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_489, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_41|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_120|, #memory_int=|v_#memory_int_570|, ~#x~0.base=|v_~#x~0.base_265|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_42|} AuxVars[|v_ULTIMATE.start_main_#t~mem35#1_129|, |v_ULTIMATE.start_main_#t~ite36#1_128|, |v_ULTIMATE.start_main_#t~ite32#1_147|, |v_ULTIMATE.start_main_#t~mem31#1_150|, |v_ULTIMATE.start_main_#t~ite33#1_121|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork0_#res.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre29#1, P2Thread1of1ForFork0_#res.base, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [691] $Ultimate##0-->L791: Formula: (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_166 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_554 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_579 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_163 256) 0))) (let ((.cse9 (= (mod v_~weak$$choice2~0_162 256) 0)) (.cse5 (not .cse3)) (.cse11 (not .cse16)) (.cse15 (and .cse3 .cse10)) (.cse4 (and .cse7 .cse3)) (.cse6 (select |v_#memory_int_675| |v_~#x~0.base_309|))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_553 256) 0)) (.cse14 (select .cse6 |v_~#x~0.offset_309|)) (.cse13 (or .cse15 .cse16 .cse4)) (.cse12 (and .cse5 .cse11)) (.cse0 (not .cse9)) (.cse1 (= (mod v_~x$w_buff0_used~0_578 256) 0))) (and (= v_~x$r_buff0_thd1~0_162 (ite .cse0 v_~x$r_buff0_thd1~0_163 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_163 (ite (and .cse5 (not .cse1)) 0 v_~x$r_buff0_thd1~0_163)))) (= |v_P0Thread1of1ForFork1_#in~arg.base_32| v_P0Thread1of1ForFork1_~arg.base_32) (= (store |v_#memory_int_675| |v_~#x~0.base_309| (store .cse6 |v_~#x~0.offset_309| 1)) |v_#memory_int_673|) (= (ite .cse0 v_~x$r_buff1_thd1~0_166 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_162 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse2 .cse8))) v_~x$r_buff1_thd1~0_166 0)) v_~x$r_buff1_thd1~0_165) (or (and (= |v_P0_#t~ite10_74| |v_P0_#t~mem9_73|) (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem9_73|) .cse9) (and (= |v_P0Thread1of1ForFork1_#t~mem9_90| |v_P0_#t~mem9_73|) .cse0 (= |v_P0_#t~ite10_74| v_~x$mem_tmp~0_104))) (= |v_P1Thread1of1ForFork2_#in~arg.base_44| v_P1Thread1of1ForFork2_~arg.base_44) (= v_~x$w_buff1~0_322 v_~x$w_buff1~0_321) (or (and (or (not .cse7) .cse5) (or .cse5 (not .cse10)) (= |v_P0Thread1of1ForFork1_#t~mem6_90| |v_P0_#t~mem6_93|) .cse11 (= v_~__unbuffered_p0_EAX~0_116 (ite .cse12 v_~x$w_buff0~0_305 v_~x$w_buff1~0_322))) (and .cse13 (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem6_93|) (= .cse14 |v_P0_#t~mem6_93|))) (= .cse14 v_~x$mem_tmp~0_104) (= (ite .cse0 v_~x$w_buff0_used~0_579 (ite .cse13 v_~x$w_buff0_used~0_579 (ite .cse12 0 v_~x$w_buff0_used~0_579))) v_~x$w_buff0_used~0_578) (= |v_P0Thread1of1ForFork1_#t~nondet3_90| v_~weak$$choice0~0_100) (= v_~x$w_buff0~0_305 v_~x$w_buff0~0_304) (= v_P0Thread1of1ForFork1_~arg.offset_32 |v_P0Thread1of1ForFork1_#in~arg.offset_32|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_44| v_P1Thread1of1ForFork2_~arg.offset_44) (= v_~y~0_50 1) (= v_~x$flush_delayed~0_134 0) (= (ite .cse0 v_~x$w_buff1_used~0_554 (ite (or .cse1 .cse15 .cse4) v_~x$w_buff1_used~0_554 0)) v_~x$w_buff1_used~0_553) (= v_~weak$$choice2~0_162 |v_P0Thread1of1ForFork1_#t~nondet4_90|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_163, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_322, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_166, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_90|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_90|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, #memory_int=|v_#memory_int_675|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_90|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_90|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_47|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_162, ~x$flush_delayed~0=v_~x$flush_delayed~0_134, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$mem_tmp~0=v_~x$mem_tmp~0_104, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_47|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_47|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_32, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_32, ~y~0=v_~y~0_50, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_44, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_321, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_44, ~weak$$choice0~0=v_~weak$$choice0~0_100, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_47|, #memory_int=|v_#memory_int_673|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, ~weak$$choice2~0=v_~weak$$choice2~0_162} AuxVars[|v_P0_#t~mem9_73|, |v_P0_#t~mem6_93|, |v_P0_#t~ite10_74|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork2_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2_~arg.offset, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 06:44:43,269 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [687] L799-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse6 (= (mod v_~x$r_buff0_thd0~0_124 256) 0))) (let ((.cse3 (not .cse6)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_493 256) 0))) (.cse7 (= (mod v_~x$w_buff0_used~0_494 256) 0)) (.cse9 (= 0 (mod v_~x$r_buff1_thd0~0_129 256))) (.cse10 (= (mod v_~x$w_buff1_used~0_476 256) 0))) (let ((.cse1 (not .cse10)) (.cse0 (not .cse9)) (.cse4 (not .cse7)) (.cse8 (select |v_#memory_int_575| |v_~#x~0.base_267|)) (.cse2 (and .cse3 .cse11))) (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_50| 0)) (= (mod v_~main$tmp_guard0~0_75 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_44|) (= (mod v_~main$tmp_guard1~0_56 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_138 1) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~__unbuffered_p0_EAX~0_91 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_56) (= v_~x$w_buff1_used~0_475 (ite (or (and .cse0 .cse1) .cse2) 0 v_~x$w_buff1_used~0_476)) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~mem31#1_158| |v_ULTIMATE.start_main_#t~mem31#1_156|))) (or (and .cse3 .cse4 (= |v_ULTIMATE.start_main_#t~ite32#1_153| |v_ULTIMATE.start_main_#t~ite32#1_155|) (= |v_ULTIMATE.start_main_#t~ite33#1_125| v_~x$w_buff0~0_250) .cse5) (and (or .cse6 .cse7) (= |v_ULTIMATE.start_main_#t~ite33#1_125| |v_ULTIMATE.start_main_#t~ite32#1_153|) (or (and (= v_~x$w_buff1~0_260 |v_ULTIMATE.start_main_#t~ite32#1_153|) .cse0 .cse5 .cse1) (and (= |v_ULTIMATE.start_main_#t~mem31#1_156| |v_ULTIMATE.start_main_#t~ite32#1_153|) (= (select .cse8 |v_~#x~0.offset_267|) |v_ULTIMATE.start_main_#t~mem31#1_156|) (or .cse9 .cse10)))))) (= v_~x$r_buff1_thd0~0_128 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_475 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd0~0_123 256) 0)) .cse11)) 0 v_~x$r_buff1_thd0~0_129)) (= v_~x$w_buff0_used~0_493 (ite (and .cse3 .cse4) 0 v_~x$w_buff0_used~0_494)) (= v_~main$tmp_guard0~0_75 (ite (= (ite (= v_~__unbuffered_cnt~0_133 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_50| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_44|) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (store |v_#memory_int_575| |v_~#x~0.base_267| (store .cse8 |v_~#x~0.offset_267| |v_ULTIMATE.start_main_#t~ite33#1_125|)) |v_#memory_int_574|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_23|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~mem35#1_137| |v_ULTIMATE.start_main_#t~mem35#1_135|)) (.cse12 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_78 256) 0))) (or (and (not .cse12) (= |v_ULTIMATE.start_main_#t~ite36#1_134| v_~__unbuffered_p2_EAX~0_138) (let ((.cse13 (= 0 (mod v_~weak$$choice1~0_69 256)))) (or (and .cse13 .cse14 (= |v_ULTIMATE.start_main_#t~ite36#1_134| v_~__unbuffered_p2_EAX~0_139)) (and (= (select (select |v_#memory_int_574| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_87) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_87) |v_ULTIMATE.start_main_#t~mem35#1_135|) (= |v_ULTIMATE.start_main_#t~mem35#1_135| |v_ULTIMATE.start_main_#t~ite36#1_134|) (not .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite36#1_136| |v_ULTIMATE.start_main_#t~ite36#1_134|) .cse14 .cse12 (= v_~__unbuffered_p2_EAX~0_139 v_~__unbuffered_p2_EAX~0_138)))) (= v_~x$r_buff0_thd0~0_123 (ite .cse2 0 v_~x$r_buff0_thd0~0_124)) (= |v_ULTIMATE.start_main_#t~nondet34#1_87| v_~weak$$choice1~0_69) (= |v_P1Thread1of1ForFork2_#res.base_23| 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_250, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_136|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ~#x~0.offset=|v_~#x~0.offset_267|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_87, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_87, ~x$w_buff1~0=v_~x$w_buff1~0_260, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_87|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_476, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_129, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_494, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_158|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_155|, #memory_int=|v_#memory_int_575|, ~#x~0.base=|v_~#x~0.base_267|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_137|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_139, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_250, 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_87, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_87, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite37#1=|v_ULTIMATE.start_main_#t~ite37#1_78|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~weak$$choice1~0=v_~weak$$choice1~0_69, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_51|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_50|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_138, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_63|, ~#x~0.offset=|v_~#x~0.offset_267|, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_260, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_475, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_75, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_128, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_78, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_493, 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_124|, #memory_int=|v_#memory_int_574|, ~#x~0.base=|v_~#x~0.base_267|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_44|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_23|} AuxVars[|v_ULTIMATE.start_main_#t~mem35#1_135|, |v_ULTIMATE.start_main_#t~ite33#1_125|, |v_ULTIMATE.start_main_#t~mem31#1_156|, |v_ULTIMATE.start_main_#t~ite36#1_134|, |v_ULTIMATE.start_main_#t~ite32#1_153|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, ULTIMATE.start_main_#t~nondet34#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre29#1, P1Thread1of1ForFork2_#res.offset, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, P1Thread1of1ForFork2_#res.base] and [691] $Ultimate##0-->L791: Formula: (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_166 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_554 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_579 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_163 256) 0))) (let ((.cse9 (= (mod v_~weak$$choice2~0_162 256) 0)) (.cse5 (not .cse3)) (.cse11 (not .cse16)) (.cse15 (and .cse3 .cse10)) (.cse4 (and .cse7 .cse3)) (.cse6 (select |v_#memory_int_675| |v_~#x~0.base_309|))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_553 256) 0)) (.cse14 (select .cse6 |v_~#x~0.offset_309|)) (.cse13 (or .cse15 .cse16 .cse4)) (.cse12 (and .cse5 .cse11)) (.cse0 (not .cse9)) (.cse1 (= (mod v_~x$w_buff0_used~0_578 256) 0))) (and (= v_~x$r_buff0_thd1~0_162 (ite .cse0 v_~x$r_buff0_thd1~0_163 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_163 (ite (and .cse5 (not .cse1)) 0 v_~x$r_buff0_thd1~0_163)))) (= |v_P0Thread1of1ForFork1_#in~arg.base_32| v_P0Thread1of1ForFork1_~arg.base_32) (= (store |v_#memory_int_675| |v_~#x~0.base_309| (store .cse6 |v_~#x~0.offset_309| 1)) |v_#memory_int_673|) (= (ite .cse0 v_~x$r_buff1_thd1~0_166 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_162 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse2 .cse8))) v_~x$r_buff1_thd1~0_166 0)) v_~x$r_buff1_thd1~0_165) (or (and (= |v_P0_#t~ite10_74| |v_P0_#t~mem9_73|) (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem9_73|) .cse9) (and (= |v_P0Thread1of1ForFork1_#t~mem9_90| |v_P0_#t~mem9_73|) .cse0 (= |v_P0_#t~ite10_74| v_~x$mem_tmp~0_104))) (= |v_P1Thread1of1ForFork2_#in~arg.base_44| v_P1Thread1of1ForFork2_~arg.base_44) (= v_~x$w_buff1~0_322 v_~x$w_buff1~0_321) (or (and (or (not .cse7) .cse5) (or .cse5 (not .cse10)) (= |v_P0Thread1of1ForFork1_#t~mem6_90| |v_P0_#t~mem6_93|) .cse11 (= v_~__unbuffered_p0_EAX~0_116 (ite .cse12 v_~x$w_buff0~0_305 v_~x$w_buff1~0_322))) (and .cse13 (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem6_93|) (= .cse14 |v_P0_#t~mem6_93|))) (= .cse14 v_~x$mem_tmp~0_104) (= (ite .cse0 v_~x$w_buff0_used~0_579 (ite .cse13 v_~x$w_buff0_used~0_579 (ite .cse12 0 v_~x$w_buff0_used~0_579))) v_~x$w_buff0_used~0_578) (= |v_P0Thread1of1ForFork1_#t~nondet3_90| v_~weak$$choice0~0_100) (= v_~x$w_buff0~0_305 v_~x$w_buff0~0_304) (= v_P0Thread1of1ForFork1_~arg.offset_32 |v_P0Thread1of1ForFork1_#in~arg.offset_32|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_44| v_P1Thread1of1ForFork2_~arg.offset_44) (= v_~y~0_50 1) (= v_~x$flush_delayed~0_134 0) (= (ite .cse0 v_~x$w_buff1_used~0_554 (ite (or .cse1 .cse15 .cse4) v_~x$w_buff1_used~0_554 0)) v_~x$w_buff1_used~0_553) (= v_~weak$$choice2~0_162 |v_P0Thread1of1ForFork1_#t~nondet4_90|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_163, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_322, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_166, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_90|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_90|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, #memory_int=|v_#memory_int_675|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_90|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_90|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_47|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_162, ~x$flush_delayed~0=v_~x$flush_delayed~0_134, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$mem_tmp~0=v_~x$mem_tmp~0_104, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_47|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_47|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_32, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_32, ~y~0=v_~y~0_50, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_44, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_321, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_44, ~weak$$choice0~0=v_~weak$$choice0~0_100, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_47|, #memory_int=|v_#memory_int_673|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, ~weak$$choice2~0=v_~weak$$choice2~0_162} AuxVars[|v_P0_#t~mem9_73|, |v_P0_#t~mem6_93|, |v_P0_#t~ite10_74|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork2_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2_~arg.offset, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 06:44:45,234 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [688] L780-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse2 (= (mod v_~x$r_buff0_thd0~0_128 256) 0))) (let ((.cse3 (= (mod v_~x$w_buff0_used~0_498 256) 0)) (.cse0 (not (= (mod v_~x$w_buff0_used~0_497 256) 0))) (.cse10 (not .cse2)) (.cse7 (= (mod v_~x$w_buff1_used~0_480 256) 0)) (.cse8 (= (mod v_~x$r_buff1_thd0~0_133 256) 0))) (let ((.cse6 (select |v_#memory_int_579| |v_~#x~0.base_269|)) (.cse1 (not .cse8)) (.cse5 (not .cse7)) (.cse14 (and .cse0 .cse10)) (.cse9 (not .cse3))) (and (= v_~__unbuffered_cnt~0_137 (+ v_~__unbuffered_cnt~0_138 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49| 0) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0)) .cse0) (and (not (= (mod v_~x$w_buff1_used~0_479 256) 0)) .cse1)) 0 v_~x$r_buff1_thd0~0_133) v_~x$r_buff1_thd0~0_132) (let ((.cse4 (= |v_ULTIMATE.start_main_#t~mem31#1_164| |v_ULTIMATE.start_main_#t~mem31#1_162|))) (or (and (or .cse2 .cse3) (= |v_ULTIMATE.start_main_#t~ite33#1_129| |v_ULTIMATE.start_main_#t~ite32#1_159|) (or (and (= v_~x$w_buff1~0_262 |v_ULTIMATE.start_main_#t~ite32#1_159|) .cse4 .cse1 .cse5) (and (= |v_ULTIMATE.start_main_#t~mem31#1_162| (select .cse6 |v_~#x~0.offset_269|)) (= |v_ULTIMATE.start_main_#t~mem31#1_162| |v_ULTIMATE.start_main_#t~ite32#1_159|) (or .cse7 .cse8)))) (and .cse9 .cse10 (= |v_ULTIMATE.start_main_#t~ite33#1_129| v_~x$w_buff0~0_252) .cse4 (= |v_ULTIMATE.start_main_#t~ite32#1_159| |v_ULTIMATE.start_main_#t~ite32#1_161|)))) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_52| 0)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_137 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_77) (= (store |v_#memory_int_579| |v_~#x~0.base_269| (store .cse6 |v_~#x~0.offset_269| |v_ULTIMATE.start_main_#t~ite33#1_129|)) |v_#memory_int_578|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_142 1) (= v_~__unbuffered_p0_EAX~0_93 0) (= v_~__unbuffered_p2_EBX~0_54 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_58) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~mem35#1_143| |v_ULTIMATE.start_main_#t~mem35#1_141|)) (.cse12 (= (mod v_~__unbuffered_p2_EAX$read_delayed~0_80 256) 0))) (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_142| |v_ULTIMATE.start_main_#t~ite36#1_140|) (= v_~__unbuffered_p2_EAX~0_143 v_~__unbuffered_p2_EAX~0_142) .cse12) (and (let ((.cse13 (= (mod v_~weak$$choice1~0_71 256) 0))) (or (and .cse11 (= |v_ULTIMATE.start_main_#t~ite36#1_140| v_~__unbuffered_p2_EAX~0_143) .cse13) (and (= |v_ULTIMATE.start_main_#t~mem35#1_141| (select (select |v_#memory_int_578| v_~__unbuffered_p2_EAX$read_delayed_var~0.base_89) v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_89)) (not .cse13) (= |v_ULTIMATE.start_main_#t~mem35#1_141| |v_ULTIMATE.start_main_#t~ite36#1_140|)))) (= |v_ULTIMATE.start_main_#t~ite36#1_140| v_~__unbuffered_p2_EAX~0_142) (not .cse12)))) (= (mod v_~main$tmp_guard0~0_77 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_46|) (= v_~x$w_buff1_used~0_479 (ite (or .cse14 (and .cse1 .cse5)) 0 v_~x$w_buff1_used~0_480)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|) (= |v_P0Thread1of1ForFork1_#res.offset_19| 0) (= |v_P0Thread1of1ForFork1_#res.base_19| 0) (= v_~x$r_buff0_thd0~0_127 (ite .cse14 0 v_~x$r_buff0_thd0~0_128)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_52| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_46|) (= (mod v_~main$tmp_guard1~0_58 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|) (= (ite (and .cse9 .cse10) 0 v_~x$w_buff0_used~0_498) v_~x$w_buff0_used~0_497) (= |v_ULTIMATE.start_main_#t~nondet34#1_91| v_~weak$$choice1~0_71))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_252, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ULTIMATE.start_main_#t~ite36#1=|v_ULTIMATE.start_main_#t~ite36#1_142|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ~#x~0.offset=|v_~#x~0.offset_269|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_89, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_89, ~x$w_buff1~0=v_~x$w_buff1~0_262, ULTIMATE.start_main_#t~nondet34#1=|v_ULTIMATE.start_main_#t~nondet34#1_91|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_480, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_133, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_498, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_93, ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_164|, ULTIMATE.start_main_#t~ite32#1=|v_ULTIMATE.start_main_#t~ite32#1_161|, #memory_int=|v_#memory_int_579|, ~#x~0.base=|v_~#x~0.base_269|, ULTIMATE.start_main_#t~mem35#1=|v_ULTIMATE.start_main_#t~mem35#1_143|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_252, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_19|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_89, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_89, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_19|, ~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_93, ~weak$$choice1~0=v_~weak$$choice1~0_71, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_53|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_52|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_142, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_65|, ~#x~0.offset=|v_~#x~0.offset_269|, ~x$w_buff1~0=v_~x$w_buff1~0_262, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_479, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_77, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_80, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_497, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_45|, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_128|, #memory_int=|v_#memory_int_578|, ~#x~0.base=|v_~#x~0.base_269|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_46|} AuxVars[|v_ULTIMATE.start_main_#t~ite33#1_129|, |v_ULTIMATE.start_main_#t~mem31#1_162|, |v_ULTIMATE.start_main_#t~ite32#1_159|, |v_ULTIMATE.start_main_#t~mem35#1_141|, |v_ULTIMATE.start_main_#t~ite36#1_140|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite36#1, P0Thread1of1ForFork1_#res.offset, ULTIMATE.start_main_#t~nondet34#1, P0Thread1of1ForFork1_#res.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite37#1, ~weak$$choice1~0, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~mem31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~ite32#1, ULTIMATE.start_main_#t~mem35#1, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~pre29#1, ~x$w_buff1_used~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [691] $Ultimate##0-->L791: Formula: (let ((.cse7 (= (mod v_~x$r_buff1_thd1~0_166 256) 0)) (.cse10 (= (mod v_~x$w_buff1_used~0_554 256) 0)) (.cse16 (= (mod v_~x$w_buff0_used~0_579 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_163 256) 0))) (let ((.cse9 (= (mod v_~weak$$choice2~0_162 256) 0)) (.cse5 (not .cse3)) (.cse11 (not .cse16)) (.cse15 (and .cse3 .cse10)) (.cse4 (and .cse7 .cse3)) (.cse6 (select |v_#memory_int_675| |v_~#x~0.base_309|))) (let ((.cse2 (= (mod v_~x$w_buff1_used~0_553 256) 0)) (.cse14 (select .cse6 |v_~#x~0.offset_309|)) (.cse13 (or .cse15 .cse16 .cse4)) (.cse12 (and .cse5 .cse11)) (.cse0 (not .cse9)) (.cse1 (= (mod v_~x$w_buff0_used~0_578 256) 0))) (and (= v_~x$r_buff0_thd1~0_162 (ite .cse0 v_~x$r_buff0_thd1~0_163 (ite (or .cse1 (and .cse2 .cse3) .cse4) v_~x$r_buff0_thd1~0_163 (ite (and .cse5 (not .cse1)) 0 v_~x$r_buff0_thd1~0_163)))) (= |v_P0Thread1of1ForFork1_#in~arg.base_32| v_P0Thread1of1ForFork1_~arg.base_32) (= (store |v_#memory_int_675| |v_~#x~0.base_309| (store .cse6 |v_~#x~0.offset_309| 1)) |v_#memory_int_673|) (= (ite .cse0 v_~x$r_buff1_thd1~0_166 (ite (let ((.cse8 (= (mod v_~x$r_buff0_thd1~0_162 256) 0))) (or .cse1 (and .cse7 .cse8) (and .cse2 .cse8))) v_~x$r_buff1_thd1~0_166 0)) v_~x$r_buff1_thd1~0_165) (or (and (= |v_P0_#t~ite10_74| |v_P0_#t~mem9_73|) (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem9_73|) .cse9) (and (= |v_P0Thread1of1ForFork1_#t~mem9_90| |v_P0_#t~mem9_73|) .cse0 (= |v_P0_#t~ite10_74| v_~x$mem_tmp~0_104))) (= |v_P1Thread1of1ForFork2_#in~arg.base_44| v_P1Thread1of1ForFork2_~arg.base_44) (= v_~x$w_buff1~0_322 v_~x$w_buff1~0_321) (or (and (or (not .cse7) .cse5) (or .cse5 (not .cse10)) (= |v_P0Thread1of1ForFork1_#t~mem6_90| |v_P0_#t~mem6_93|) .cse11 (= v_~__unbuffered_p0_EAX~0_116 (ite .cse12 v_~x$w_buff0~0_305 v_~x$w_buff1~0_322))) (and .cse13 (= v_~__unbuffered_p0_EAX~0_116 |v_P0_#t~mem6_93|) (= .cse14 |v_P0_#t~mem6_93|))) (= .cse14 v_~x$mem_tmp~0_104) (= (ite .cse0 v_~x$w_buff0_used~0_579 (ite .cse13 v_~x$w_buff0_used~0_579 (ite .cse12 0 v_~x$w_buff0_used~0_579))) v_~x$w_buff0_used~0_578) (= |v_P0Thread1of1ForFork1_#t~nondet3_90| v_~weak$$choice0~0_100) (= v_~x$w_buff0~0_305 v_~x$w_buff0~0_304) (= v_P0Thread1of1ForFork1_~arg.offset_32 |v_P0Thread1of1ForFork1_#in~arg.offset_32|) (= |v_P1Thread1of1ForFork2_#in~arg.offset_44| v_P1Thread1of1ForFork2_~arg.offset_44) (= v_~y~0_50 1) (= v_~x$flush_delayed~0_134 0) (= (ite .cse0 v_~x$w_buff1_used~0_554 (ite (or .cse1 .cse15 .cse4) v_~x$w_buff1_used~0_554 0)) v_~x$w_buff1_used~0_553) (= v_~weak$$choice2~0_162 |v_P0Thread1of1ForFork1_#t~nondet4_90|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_305, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_163, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_322, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_166, P0Thread1of1ForFork1_#t~mem9=|v_P0Thread1of1ForFork1_#t~mem9_90|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_579, P0Thread1of1ForFork1_#t~mem6=|v_P0Thread1of1ForFork1_#t~mem6_90|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, #memory_int=|v_#memory_int_675|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_90|, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_90|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_47|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_162, ~x$flush_delayed~0=v_~x$flush_delayed~0_134, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$mem_tmp~0=v_~x$mem_tmp~0_104, P0Thread1of1ForFork1_#t~mem8=|v_P0Thread1of1ForFork1_#t~mem8_47|, P0Thread1of1ForFork1_#t~mem5=|v_P0Thread1of1ForFork1_#t~mem5_47|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_32, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_32|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_32, ~y~0=v_~y~0_50, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_44, ~#x~0.offset=|v_~#x~0.offset_309|, ~x$w_buff1~0=v_~x$w_buff1~0_321, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_553, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_32|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_578, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_44, ~weak$$choice0~0=v_~weak$$choice0~0_100, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_47|, #memory_int=|v_#memory_int_673|, ~#x~0.base=|v_~#x~0.base_309|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_44|, ~weak$$choice2~0=v_~weak$$choice2~0_162} AuxVars[|v_P0_#t~mem9_73|, |v_P0_#t~mem6_93|, |v_P0_#t~ite10_74|] AssignedVars[~x$w_buff0~0, P0Thread1of1ForFork1_#t~ite10, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~mem9, ~x$mem_tmp~0, P0Thread1of1ForFork1_#t~mem8, P0Thread1of1ForFork1_#t~mem5, P0Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork1_#t~mem6, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~y~0, P1Thread1of1ForFork2_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0, P1Thread1of1ForFork2_~arg.offset, ~weak$$choice0~0, P0Thread1of1ForFork1_#t~ite7, #memory_int, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 06:44:49,193 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:44:49,194 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13460 [2022-12-06 06:44:49,194 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 244 flow [2022-12-06 06:44:49,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:44:49,194 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:44:49,194 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:49,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:44:49,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 06:44:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:44:49,195 INFO L85 PathProgramCache]: Analyzing trace with hash -246530000, now seen corresponding path program 1 times [2022-12-06 06:44:49,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:44:49,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889206779] [2022-12-06 06:44:49,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:44:49,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:44:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:44:49,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:44:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:44:49,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:44:49,355 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:44:49,356 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 06:44:49,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 06:44:49,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 06:44:49,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 06:44:49,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:44:49,357 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:44:49,361 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:44:49,361 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:44:49,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:44:49 BasicIcfg [2022-12-06 06:44:49,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:44:49,440 INFO L158 Benchmark]: Toolchain (without parser) took 38593.75ms. Allocated memory was 209.7MB in the beginning and 728.8MB in the end (delta: 519.0MB). Free memory was 183.5MB in the beginning and 639.5MB in the end (delta: -456.0MB). Peak memory consumption was 64.3MB. Max. memory is 8.0GB. [2022-12-06 06:44:49,441 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory is still 186.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:44:49,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.71ms. Allocated memory is still 209.7MB. Free memory was 183.2MB in the beginning and 156.0MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 06:44:49,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.71ms. Allocated memory is still 209.7MB. Free memory was 156.0MB in the beginning and 153.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:44:49,441 INFO L158 Benchmark]: Boogie Preprocessor took 46.14ms. Allocated memory is still 209.7MB. Free memory was 153.5MB in the beginning and 151.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:44:49,441 INFO L158 Benchmark]: RCFGBuilder took 788.27ms. Allocated memory is still 209.7MB. Free memory was 151.1MB in the beginning and 130.9MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 06:44:49,441 INFO L158 Benchmark]: TraceAbstraction took 37246.29ms. Allocated memory was 209.7MB in the beginning and 728.8MB in the end (delta: 519.0MB). Free memory was 130.4MB in the beginning and 639.5MB in the end (delta: -509.1MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-12-06 06:44:49,442 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 209.7MB. Free memory is still 186.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.71ms. Allocated memory is still 209.7MB. Free memory was 183.2MB in the beginning and 156.0MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.71ms. Allocated memory is still 209.7MB. Free memory was 156.0MB in the beginning and 153.5MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.14ms. Allocated memory is still 209.7MB. Free memory was 153.5MB in the beginning and 151.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 788.27ms. Allocated memory is still 209.7MB. Free memory was 151.1MB in the beginning and 130.9MB in the end (delta: 20.2MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 37246.29ms. Allocated memory was 209.7MB in the beginning and 728.8MB in the end (delta: 519.0MB). Free memory was 130.4MB in the beginning and 639.5MB in the end (delta: -509.1MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 118 PlacesBefore, 29 PlacesAfterwards, 109 TransitionsBefore, 20 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 746, independent: 703, independent conditional: 703, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 746, independent: 703, independent conditional: 0, independent unconditional: 703, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 746, independent: 703, independent conditional: 0, independent unconditional: 703, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 746, independent: 703, independent conditional: 0, independent unconditional: 703, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 657, independent: 634, independent conditional: 0, independent unconditional: 634, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 657, independent: 624, independent conditional: 0, independent unconditional: 624, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 226, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 746, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 657, unknown conditional: 0, unknown unconditional: 657] , Statistics on independence cache: Total cache size (in pairs): 925, Positive cache size: 902, Positive conditional cache size: 0, Positive unconditional cache size: 902, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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, 26 PlacesBefore, 26 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 47, unknown conditional: 0, unknown unconditional: 47] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 31, Positive conditional cache size: 0, Positive unconditional cache size: 31, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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, 29 PlacesBefore, 29 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 32, independent conditional: 32, 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: 48, independent: 32, independent conditional: 3, independent unconditional: 29, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 48, independent: 32, independent conditional: 0, independent unconditional: 32, 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: 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: 48, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 31, Positive conditional cache size: 0, Positive unconditional cache size: 31, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 53, independent conditional: 12, independent unconditional: 41, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 53, independent conditional: 12, independent unconditional: 41, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 53, independent conditional: 12, independent unconditional: 41, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 4, independent unconditional: 9, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 98, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 82, dependent conditional: 13, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 40, independent conditional: 8, independent unconditional: 32, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 17, unknown conditional: 5, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 44, Positive conditional cache size: 4, Positive unconditional cache size: 40, Negative cache size: 20, Negative conditional cache size: 1, Negative unconditional cache size: 19, 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.1s, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, independent: 39, independent conditional: 39, 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: 55, independent: 39, independent conditional: 25, independent unconditional: 14, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 55, independent: 39, independent conditional: 12, independent unconditional: 27, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 55, independent: 39, independent conditional: 12, independent unconditional: 27, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 14, independent conditional: 3, independent unconditional: 11, 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: 19, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, independent: 25, independent conditional: 9, independent unconditional: 16, dependent: 11, dependent conditional: 1, dependent unconditional: 10, unknown: 19, unknown conditional: 3, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 58, Positive conditional cache size: 7, Positive unconditional cache size: 51, Negative cache size: 25, Negative conditional cache size: 1, Negative unconditional cache size: 24, 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.0s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 33, independent conditional: 33, 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: 52, independent: 33, independent conditional: 18, independent unconditional: 15, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 33, independent conditional: 16, independent unconditional: 17, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 33, independent conditional: 16, independent unconditional: 17, dependent: 21, dependent conditional: 1, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, 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: 6, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 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] ], Cache Queries: [ total: 54, independent: 28, independent conditional: 11, independent unconditional: 17, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 63, Positive conditional cache size: 12, Positive unconditional cache size: 51, Negative cache size: 26, Negative conditional cache size: 1, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 41 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 24 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 58, independent conditional: 58, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 58, independent conditional: 38, independent unconditional: 20, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, independent: 58, independent conditional: 38, independent unconditional: 20, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, independent: 58, independent conditional: 38, independent unconditional: 20, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 92, independent: 50, independent conditional: 30, independent unconditional: 20, dependent: 34, dependent conditional: 2, dependent unconditional: 32, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 73, Positive conditional cache size: 20, Positive unconditional cache size: 53, Negative cache size: 26, Negative conditional cache size: 1, Negative unconditional cache size: 25, 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.5s, 34 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 74, independent: 48, independent conditional: 41, independent unconditional: 7, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, independent: 48, independent conditional: 41, independent unconditional: 7, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, independent: 48, independent conditional: 41, independent unconditional: 7, dependent: 26, dependent conditional: 2, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 40, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 40, dependent conditional: 7, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, independent: 44, independent conditional: 37, independent unconditional: 7, dependent: 22, dependent conditional: 1, dependent unconditional: 21, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 81, Positive conditional cache size: 24, Positive unconditional cache size: 57, Negative cache size: 30, Negative conditional cache size: 2, 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.6s, 38 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 53, independent: 53, independent conditional: 53, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 94, Positive conditional cache size: 33, Positive unconditional cache size: 61, Negative cache size: 30, Negative conditional cache size: 2, 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.5s, 41 PlacesBefore, 39 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 15, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 101, Positive conditional cache size: 37, Positive unconditional cache size: 64, Negative cache size: 30, Negative conditional cache size: 2, 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.0s, 35 PlacesBefore, 35 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 101, Positive conditional cache size: 37, Positive unconditional cache size: 64, Negative cache size: 30, Negative conditional cache size: 2, 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 36 PlacesBefore, 36 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 2, 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: 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: 2, independent: 2, independent conditional: 2, independent unconditional: 0, 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): 141, Positive cache size: 111, Positive conditional cache size: 44, Positive unconditional cache size: 67, Negative cache size: 30, Negative conditional cache size: 2, 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: 13.4s, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 31 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 118, Positive conditional cache size: 45, Positive unconditional cache size: 73, Negative cache size: 30, Negative conditional cache size: 2, 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 - 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))=8, 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))=9, 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))=10, 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 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, 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] [L761] 1 y = 1 [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !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 1 \read(x) [L770] EXPR 1 !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] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 [L791] 1 x = 1 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, 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] [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 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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, 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 [L838] 3 return 0; [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [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}, \result={0: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=2, weak$$choice1=1, weak$$choice2=1, 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: 37.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 792 IncrementalHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 1 mSDtfsCounter, 792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=12, InterpolantAutomatonStates: 56, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 3124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:44:49,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...