./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:40:50,112 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:40:50,113 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:40:50,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:40:50,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:40:50,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:40:50,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:40:50,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:40:50,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:40:50,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:40:50,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:40:50,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:40:50,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:40:50,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:40:50,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:40:50,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:40:50,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:40:50,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:40:50,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:40:50,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:40:50,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:40:50,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:40:50,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:40:50,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:40:50,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:40:50,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:40:50,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:40:50,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:40:50,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:40:50,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:40:50,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:40:50,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:40:50,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:40:50,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:40:50,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:40:50,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:40:50,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:40:50,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:40:50,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:40:50,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:40:50,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:40:50,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:40:50,235 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:40:50,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:40:50,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:40:50,237 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:40:50,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:40:50,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:40:50,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:40:50,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:40:50,238 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:40:50,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:40:50,239 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:40:50,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:40:50,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:40:50,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:40:50,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:40:50,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:40:50,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:40:50,240 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:40:50,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:40:50,240 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:40:50,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:40:50,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:40:50,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:40:50,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:40:50,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:40:50,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:40:50,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:40:50,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:40:50,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:40:50,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:40:50,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:40:50,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:40:50,242 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:40:50,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:40:50,243 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:40:50,243 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:40:50,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:40:50,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:40:50,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:40:50,497 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:40:50,498 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:40:50,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-09-01 09:40:51,398 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:40:51,644 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:40:51,644 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2023-09-01 09:40:51,665 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f51397012/de6ac45a23424262b36b152f1f69fbeb/FLAGd60428641 [2023-09-01 09:40:51,678 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f51397012/de6ac45a23424262b36b152f1f69fbeb [2023-09-01 09:40:51,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:40:51,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:40:51,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:40:51,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:40:51,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:40:51,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:40:51" (1/1) ... [2023-09-01 09:40:51,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ef0a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:51, skipping insertion in model container [2023-09-01 09:40:51,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:40:51" (1/1) ... [2023-09-01 09:40:51,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:40:51,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:40:51,870 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i[949,962] [2023-09-01 09:40:52,029 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:40:52,046 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:40:52,053 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i[949,962] [2023-09-01 09:40:52,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:40:52,124 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:40:52,124 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:40:52,129 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:40:52,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52 WrapperNode [2023-09-01 09:40:52,129 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:40:52,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:40:52,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:40:52,130 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:40:52,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,163 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-09-01 09:40:52,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:40:52,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:40:52,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:40:52,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:40:52,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,180 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:40:52,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:40:52,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:40:52,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:40:52,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (1/1) ... [2023-09-01 09:40:52,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:40:52,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:40:52,234 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) [2023-09-01 09:40:52,251 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 [2023-09-01 09:40:52,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:40:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:40:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:40:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:40:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:40:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:40:52,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:40:52,262 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:40:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:40:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:40:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:40:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:40:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:40:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:40:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:40:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:40:52,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:40:52,264 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:40:52,354 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:40:52,356 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:40:52,646 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:40:52,770 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:40:52,771 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:40:52,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:40:52 BoogieIcfgContainer [2023-09-01 09:40:52,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:40:52,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:40:52,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:40:52,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:40:52,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:40:51" (1/3) ... [2023-09-01 09:40:52,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628fc1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:40:52, skipping insertion in model container [2023-09-01 09:40:52,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:40:52" (2/3) ... [2023-09-01 09:40:52,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628fc1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:40:52, skipping insertion in model container [2023-09-01 09:40:52,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:40:52" (3/3) ... [2023-09-01 09:40:52,780 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-09-01 09:40:52,787 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:40:52,796 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:40:52,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:40:52,796 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:40:52,852 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:40:52,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-09-01 09:40:52,911 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-09-01 09:40:52,911 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:40:52,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-09-01 09:40:52,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-09-01 09:40:52,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-09-01 09:40:52,921 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:40:52,928 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-09-01 09:40:52,930 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-09-01 09:40:52,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-09-01 09:40:52,951 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-09-01 09:40:52,952 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:40:52,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-09-01 09:40:52,954 INFO L119 LiptonReduction]: Number of co-enabled transitions 3272 [2023-09-01 09:40:56,322 INFO L134 LiptonReduction]: Checked pairs total: 9891 [2023-09-01 09:40:56,323 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-09-01 09:40:56,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:40:56,335 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7357213d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:40:56,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:40:56,338 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-09-01 09:40:56,338 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:40:56,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:56,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 09:40:56,339 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:56,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:56,342 INFO L85 PathProgramCache]: Analyzing trace with hash 530157842, now seen corresponding path program 1 times [2023-09-01 09:40:56,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:56,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038863676] [2023-09-01 09:40:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:56,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:56,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:56,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038863676] [2023-09-01 09:40:56,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038863676] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:56,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:56,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:40:56,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802245662] [2023-09-01 09:40:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:56,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:40:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:56,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:40:56,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:40:56,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 239 [2023-09-01 09:40:56,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2023-09-01 09:40:56,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:56,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 239 [2023-09-01 09:40:56,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:57,319 INFO L130 PetriNetUnfolder]: 4695/6585 cut-off events. [2023-09-01 09:40:57,320 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-09-01 09:40:57,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13161 conditions, 6585 events. 4695/6585 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34013 event pairs, 1757 based on Foata normal form. 0/6268 useless extension candidates. Maximal degree in co-relation 13149. Up to 5107 conditions per place. [2023-09-01 09:40:57,346 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 39 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-09-01 09:40:57,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 202 flow [2023-09-01 09:40:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:40:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:40:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-09-01 09:40:57,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5536959553695955 [2023-09-01 09:40:57,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-09-01 09:40:57,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-09-01 09:40:57,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:57,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-09-01 09:40:57,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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) [2023-09-01 09:40:57,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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) [2023-09-01 09:40:57,369 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 239.0) internal successors, (956), 4 states have internal predecessors, (956), 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) [2023-09-01 09:40:57,371 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 397 transitions. [2023-09-01 09:40:57,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 202 flow [2023-09-01 09:40:57,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:40:57,376 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 72 flow [2023-09-01 09:40:57,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-09-01 09:40:57,380 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-09-01 09:40:57,381 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 72 flow [2023-09-01 09:40:57,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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) [2023-09-01 09:40:57,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:57,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:40:57,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:40:57,385 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:57,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2089934941, now seen corresponding path program 1 times [2023-09-01 09:40:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:57,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075921431] [2023-09-01 09:40:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:57,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:57,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075921431] [2023-09-01 09:40:57,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075921431] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:57,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:57,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:40:57,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146427998] [2023-09-01 09:40:57,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:57,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:40:57,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:57,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:40:57,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:40:57,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 239 [2023-09-01 09:40:57,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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) [2023-09-01 09:40:57,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:57,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 239 [2023-09-01 09:40:57,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:40:59,124 INFO L130 PetriNetUnfolder]: 11713/15843 cut-off events. [2023-09-01 09:40:59,124 INFO L131 PetriNetUnfolder]: For 821/821 co-relation queries the response was YES. [2023-09-01 09:40:59,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32803 conditions, 15843 events. 11713/15843 cut-off events. For 821/821 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 78955 event pairs, 3197 based on Foata normal form. 720/16562 useless extension candidates. Maximal degree in co-relation 32793. Up to 9801 conditions per place. [2023-09-01 09:40:59,180 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 41 selfloop transitions, 2 changer transitions 30/74 dead transitions. [2023-09-01 09:40:59,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 74 transitions, 312 flow [2023-09-01 09:40:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:40:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:40:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-09-01 09:40:59,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811715481171548 [2023-09-01 09:40:59,183 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-09-01 09:40:59,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-09-01 09:40:59,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:40:59,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-09-01 09:40:59,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 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) [2023-09-01 09:40:59,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:40:59,186 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:40:59,186 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 5 states and 575 transitions. [2023-09-01 09:40:59,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 74 transitions, 312 flow [2023-09-01 09:40:59,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:40:59,188 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 80 flow [2023-09-01 09:40:59,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-09-01 09:40:59,189 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-09-01 09:40:59,189 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 80 flow [2023-09-01 09:40:59,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 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) [2023-09-01 09:40:59,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:40:59,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:40:59,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:40:59,190 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:40:59,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:40:59,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1681534632, now seen corresponding path program 1 times [2023-09-01 09:40:59,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:40:59,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233881902] [2023-09-01 09:40:59,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:40:59,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:40:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:40:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:40:59,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:40:59,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233881902] [2023-09-01 09:40:59,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233881902] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:40:59,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:40:59,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:40:59,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605148208] [2023-09-01 09:40:59,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:40:59,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:40:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:40:59,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:40:59,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:40:59,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 239 [2023-09-01 09:40:59,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 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) [2023-09-01 09:40:59,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:40:59,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 239 [2023-09-01 09:40:59,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:00,687 INFO L130 PetriNetUnfolder]: 10005/13575 cut-off events. [2023-09-01 09:41:00,687 INFO L131 PetriNetUnfolder]: For 2160/2160 co-relation queries the response was YES. [2023-09-01 09:41:00,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29286 conditions, 13575 events. 10005/13575 cut-off events. For 2160/2160 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 67952 event pairs, 2549 based on Foata normal form. 480/14054 useless extension candidates. Maximal degree in co-relation 29273. Up to 8993 conditions per place. [2023-09-01 09:41:00,748 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 43 selfloop transitions, 2 changer transitions 26/72 dead transitions. [2023-09-01 09:41:00,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 313 flow [2023-09-01 09:41:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:41:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:41:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2023-09-01 09:41:00,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4794979079497908 [2023-09-01 09:41:00,751 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 573 transitions. [2023-09-01 09:41:00,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 573 transitions. [2023-09-01 09:41:00,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:00,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 573 transitions. [2023-09-01 09:41:00,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 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) [2023-09-01 09:41:00,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:41:00,755 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:41:00,755 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 80 flow. Second operand 5 states and 573 transitions. [2023-09-01 09:41:00,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 313 flow [2023-09-01 09:41:00,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 72 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:41:00,863 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 84 flow [2023-09-01 09:41:00,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-09-01 09:41:00,864 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-09-01 09:41:00,866 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 84 flow [2023-09-01 09:41:00,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 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) [2023-09-01 09:41:00,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:00,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:00,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:41:00,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:00,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1338019359, now seen corresponding path program 1 times [2023-09-01 09:41:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:00,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545827669] [2023-09-01 09:41:00,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:01,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:01,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545827669] [2023-09-01 09:41:01,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545827669] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:01,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:01,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:41:01,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401694076] [2023-09-01 09:41:01,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:01,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:41:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:01,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:41:01,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:41:01,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 239 [2023-09-01 09:41:01,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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) [2023-09-01 09:41:01,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:01,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 239 [2023-09-01 09:41:01,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:01,914 INFO L130 PetriNetUnfolder]: 4410/6257 cut-off events. [2023-09-01 09:41:01,915 INFO L131 PetriNetUnfolder]: For 1259/1264 co-relation queries the response was YES. [2023-09-01 09:41:01,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13326 conditions, 6257 events. 4410/6257 cut-off events. For 1259/1264 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 31833 event pairs, 2290 based on Foata normal form. 182/6402 useless extension candidates. Maximal degree in co-relation 13312. Up to 5515 conditions per place. [2023-09-01 09:41:01,941 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 35 selfloop transitions, 5 changer transitions 17/62 dead transitions. [2023-09-01 09:41:01,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 272 flow [2023-09-01 09:41:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:41:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:41:01,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-09-01 09:41:01,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179916317991632 [2023-09-01 09:41:01,945 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-09-01 09:41:01,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-09-01 09:41:01,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:01,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-09-01 09:41:01,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 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) [2023-09-01 09:41:01,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:41:01,949 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:41:01,949 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 84 flow. Second operand 5 states and 619 transitions. [2023-09-01 09:41:01,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 272 flow [2023-09-01 09:41:01,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 264 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:41:01,963 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 121 flow [2023-09-01 09:41:01,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2023-09-01 09:41:01,964 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-09-01 09:41:01,964 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 121 flow [2023-09-01 09:41:01,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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) [2023-09-01 09:41:01,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:01,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:01,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:41:01,966 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:01,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:01,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1490388582, now seen corresponding path program 1 times [2023-09-01 09:41:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351260202] [2023-09-01 09:41:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:01,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:02,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351260202] [2023-09-01 09:41:02,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351260202] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:02,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:41:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249580704] [2023-09-01 09:41:02,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:02,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:41:02,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:02,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:41:02,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:41:02,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 239 [2023-09-01 09:41:02,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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) [2023-09-01 09:41:02,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:02,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 239 [2023-09-01 09:41:02,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:03,019 INFO L130 PetriNetUnfolder]: 4580/6562 cut-off events. [2023-09-01 09:41:03,019 INFO L131 PetriNetUnfolder]: For 4277/4589 co-relation queries the response was YES. [2023-09-01 09:41:03,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17297 conditions, 6562 events. 4580/6562 cut-off events. For 4277/4589 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 34271 event pairs, 2162 based on Foata normal form. 226/6747 useless extension candidates. Maximal degree in co-relation 17282. Up to 5089 conditions per place. [2023-09-01 09:41:03,050 INFO L137 encePairwiseOnDemand]: 231/239 looper letters, 52 selfloop transitions, 9 changer transitions 27/93 dead transitions. [2023-09-01 09:41:03,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 93 transitions, 509 flow [2023-09-01 09:41:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:41:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:41:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2023-09-01 09:41:03,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5164375373580394 [2023-09-01 09:41:03,052 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2023-09-01 09:41:03,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2023-09-01 09:41:03,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:03,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2023-09-01 09:41:03,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 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) [2023-09-01 09:41:03,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:03,056 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:03,056 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 121 flow. Second operand 7 states and 864 transitions. [2023-09-01 09:41:03,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 93 transitions, 509 flow [2023-09-01 09:41:03,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 502 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:41:03,064 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 203 flow [2023-09-01 09:41:03,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-09-01 09:41:03,065 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-09-01 09:41:03,065 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 203 flow [2023-09-01 09:41:03,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 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) [2023-09-01 09:41:03,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:03,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:03,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:41:03,066 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:03,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:03,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1450366638, now seen corresponding path program 1 times [2023-09-01 09:41:03,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:03,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923746003] [2023-09-01 09:41:03,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:03,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:03,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:03,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923746003] [2023-09-01 09:41:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923746003] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:03,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:41:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892368719] [2023-09-01 09:41:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:03,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:41:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:41:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:41:03,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 239 [2023-09-01 09:41:03,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 203 flow. Second operand has 7 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:41:03,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:03,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 239 [2023-09-01 09:41:03,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:05,054 INFO L130 PetriNetUnfolder]: 13799/18652 cut-off events. [2023-09-01 09:41:05,054 INFO L131 PetriNetUnfolder]: For 27870/27870 co-relation queries the response was YES. [2023-09-01 09:41:05,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56926 conditions, 18652 events. 13799/18652 cut-off events. For 27870/27870 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 91380 event pairs, 3975 based on Foata normal form. 308/18960 useless extension candidates. Maximal degree in co-relation 56906. Up to 14818 conditions per place. [2023-09-01 09:41:05,126 INFO L137 encePairwiseOnDemand]: 228/239 looper letters, 67 selfloop transitions, 14 changer transitions 24/105 dead transitions. [2023-09-01 09:41:05,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 105 transitions, 679 flow [2023-09-01 09:41:05,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:41:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:41:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 782 transitions. [2023-09-01 09:41:05,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4674237895995218 [2023-09-01 09:41:05,128 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 782 transitions. [2023-09-01 09:41:05,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 782 transitions. [2023-09-01 09:41:05,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:05,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 782 transitions. [2023-09-01 09:41:05,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 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) [2023-09-01 09:41:05,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:05,132 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:05,132 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 203 flow. Second operand 7 states and 782 transitions. [2023-09-01 09:41:05,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 105 transitions, 679 flow [2023-09-01 09:41:05,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 647 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-09-01 09:41:05,274 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 305 flow [2023-09-01 09:41:05,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-09-01 09:41:05,275 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-09-01 09:41:05,275 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 305 flow [2023-09-01 09:41:05,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:41:05,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:05,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:05,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:41:05,276 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:05,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1627497542, now seen corresponding path program 1 times [2023-09-01 09:41:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:05,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918217314] [2023-09-01 09:41:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:05,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:05,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918217314] [2023-09-01 09:41:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918217314] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:05,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:05,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:41:05,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142244926] [2023-09-01 09:41:05,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:05,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:41:05,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:05,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:41:05,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:41:05,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 239 [2023-09-01 09:41:05,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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) [2023-09-01 09:41:05,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:05,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 239 [2023-09-01 09:41:05,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:07,700 INFO L130 PetriNetUnfolder]: 14870/20101 cut-off events. [2023-09-01 09:41:07,701 INFO L131 PetriNetUnfolder]: For 46820/46820 co-relation queries the response was YES. [2023-09-01 09:41:07,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70398 conditions, 20101 events. 14870/20101 cut-off events. For 46820/46820 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 99806 event pairs, 3483 based on Foata normal form. 214/20315 useless extension candidates. Maximal degree in co-relation 70374. Up to 15825 conditions per place. [2023-09-01 09:41:07,860 INFO L137 encePairwiseOnDemand]: 225/239 looper letters, 100 selfloop transitions, 29 changer transitions 36/165 dead transitions. [2023-09-01 09:41:07,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 165 transitions, 1231 flow [2023-09-01 09:41:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 09:41:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 09:41:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1125 transitions. [2023-09-01 09:41:07,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707112970711297 [2023-09-01 09:41:07,867 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1125 transitions. [2023-09-01 09:41:07,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1125 transitions. [2023-09-01 09:41:07,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:07,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1125 transitions. [2023-09-01 09:41:07,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.5) internal successors, (1125), 10 states have internal predecessors, (1125), 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) [2023-09-01 09:41:07,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 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) [2023-09-01 09:41:07,873 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 239.0) internal successors, (2629), 11 states have internal predecessors, (2629), 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) [2023-09-01 09:41:07,873 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 305 flow. Second operand 10 states and 1125 transitions. [2023-09-01 09:41:07,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 165 transitions, 1231 flow [2023-09-01 09:41:07,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 165 transitions, 1212 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-09-01 09:41:07,972 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 606 flow [2023-09-01 09:41:07,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=606, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2023-09-01 09:41:07,972 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-09-01 09:41:07,973 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 606 flow [2023-09-01 09:41:07,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 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) [2023-09-01 09:41:07,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:07,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:07,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:41:07,974 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:07,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:07,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1823243975, now seen corresponding path program 1 times [2023-09-01 09:41:07,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:07,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879474277] [2023-09-01 09:41:07,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:07,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:08,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:08,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879474277] [2023-09-01 09:41:08,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879474277] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:08,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:08,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:41:08,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927994616] [2023-09-01 09:41:08,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:08,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:41:08,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:08,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:41:08,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:41:08,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 239 [2023-09-01 09:41:08,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 606 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 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) [2023-09-01 09:41:08,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:08,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 239 [2023-09-01 09:41:08,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:08,983 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][69], [24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 21#L865-3true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:08,984 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:08,984 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:08,984 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:08,984 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:09,179 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][29], [Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-09-01 09:41:09,179 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,179 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,192 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,192 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,193 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][111], [104#L876true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-09-01 09:41:09,193 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,193 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,193 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,193 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,194 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][69], [24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:09,194 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,194 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,194 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,195 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,196 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][69], [24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 21#L865-3true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:09,197 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,197 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,197 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,197 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,197 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][120], [24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 21#L865-3true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:09,197 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,197 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,198 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,198 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:09,274 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][29], [Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-09-01 09:41:09,274 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,274 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,274 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,274 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,274 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,316 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][111], [Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-09-01 09:41:09,316 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,316 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,316 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,316 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,317 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,371 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][29], [Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-09-01 09:41:09,371 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,371 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][111], [104#L876true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-09-01 09:41:09,372 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,372 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][69], [24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:09,379 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,379 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,379 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,379 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][120], [24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:09,379 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,380 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,380 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,380 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,380 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][69], [24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:09,380 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,380 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,380 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,380 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:09,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][69], [24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), 104#L876true, Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:09,569 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:41:09,569 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:09,569 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:09,569 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:09,570 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][120], [24#L788true, 104#L876true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 234#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 228#(not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:09,570 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:41:09,570 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:09,570 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:09,570 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:10,036 INFO L130 PetriNetUnfolder]: 15985/22794 cut-off events. [2023-09-01 09:41:10,036 INFO L131 PetriNetUnfolder]: For 139852/142822 co-relation queries the response was YES. [2023-09-01 09:41:10,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104009 conditions, 22794 events. 15985/22794 cut-off events. For 139852/142822 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 139161 event pairs, 3158 based on Foata normal form. 728/22966 useless extension candidates. Maximal degree in co-relation 103979. Up to 10111 conditions per place. [2023-09-01 09:41:10,208 INFO L137 encePairwiseOnDemand]: 235/239 looper letters, 99 selfloop transitions, 2 changer transitions 19/140 dead transitions. [2023-09-01 09:41:10,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 140 transitions, 1390 flow [2023-09-01 09:41:10,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:41:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:41:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2023-09-01 09:41:10,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5146443514644351 [2023-09-01 09:41:10,211 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 615 transitions. [2023-09-01 09:41:10,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 615 transitions. [2023-09-01 09:41:10,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:10,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 615 transitions. [2023-09-01 09:41:10,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:41:10,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:41:10,374 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:41:10,374 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 606 flow. Second operand 5 states and 615 transitions. [2023-09-01 09:41:10,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 140 transitions, 1390 flow [2023-09-01 09:41:10,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 140 transitions, 1262 flow, removed 64 selfloop flow, removed 3 redundant places. [2023-09-01 09:41:10,900 INFO L231 Difference]: Finished difference. Result has 71 places, 72 transitions, 557 flow [2023-09-01 09:41:10,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=557, PETRI_PLACES=71, PETRI_TRANSITIONS=72} [2023-09-01 09:41:10,900 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places. [2023-09-01 09:41:10,901 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 72 transitions, 557 flow [2023-09-01 09:41:10,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 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) [2023-09-01 09:41:10,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:10,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:10,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:41:10,901 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:10,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash 240424201, now seen corresponding path program 2 times [2023-09-01 09:41:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:10,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310590784] [2023-09-01 09:41:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:10,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:11,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:11,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310590784] [2023-09-01 09:41:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310590784] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:11,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:41:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327794491] [2023-09-01 09:41:11,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:11,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:41:11,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:41:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:41:11,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 239 [2023-09-01 09:41:11,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 72 transitions, 557 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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) [2023-09-01 09:41:11,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:11,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 239 [2023-09-01 09:41:11,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:11,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-09-01 09:41:11,709 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,709 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,709 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,709 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][124], [Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-09-01 09:41:11,709 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,710 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,710 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,710 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,711 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,711 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,711 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,711 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,711 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,880 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][141], [Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-09-01 09:41:11,880 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,880 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,880 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,880 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,882 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,882 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,882 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,882 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,882 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][6], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, 262#(= ~__unbuffered_cnt~0 0), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 21#L865-3true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,882 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,882 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,882 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,882 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,887 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,888 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,888 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,888 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,888 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,888 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,888 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,888 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,889 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,889 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,889 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,889 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][124], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:11,889 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,889 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,889 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,889 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,890 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][141], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:11,890 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,890 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,890 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,890 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,897 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,898 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,898 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,898 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,898 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,898 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,898 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,898 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,899 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,899 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,899 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,899 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,899 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:11,899 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][124], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:11,899 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,899 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,900 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,900 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,900 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,900 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,900 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,900 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,901 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,901 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,901 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,901 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,901 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,901 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,901 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,901 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,902 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][141], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:11,902 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,902 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,902 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,902 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,902 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:11,969 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:11,969 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,969 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,969 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,969 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,969 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,970 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-09-01 09:41:11,971 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,971 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,971 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:11,971 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:12,047 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][42], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 260#true, P2Thread1of1ForFork0InUse, 21#L865-3true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:12,047 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:12,047 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:12,047 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:12,047 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:12,327 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][126], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:12,327 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,327 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,327 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,327 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,327 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,327 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,327 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][42], [Black: 248#(= ~y~0 1), Black: 255#(and (= ~__unbuffered_p1_EAX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~y~0 1)), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 260#true, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:12,328 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,328 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,328 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,328 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:12,632 INFO L130 PetriNetUnfolder]: 12365/18219 cut-off events. [2023-09-01 09:41:12,632 INFO L131 PetriNetUnfolder]: For 111421/115374 co-relation queries the response was YES. [2023-09-01 09:41:12,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80353 conditions, 18219 events. 12365/18219 cut-off events. For 111421/115374 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 118811 event pairs, 3616 based on Foata normal form. 2514/19941 useless extension candidates. Maximal degree in co-relation 80322. Up to 10524 conditions per place. [2023-09-01 09:41:12,922 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 138 selfloop transitions, 10 changer transitions 0/170 dead transitions. [2023-09-01 09:41:12,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 170 transitions, 1561 flow [2023-09-01 09:41:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:41:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:41:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2023-09-01 09:41:12,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263598326359833 [2023-09-01 09:41:12,924 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2023-09-01 09:41:12,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2023-09-01 09:41:12,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:12,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2023-09-01 09:41:12,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 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) [2023-09-01 09:41:12,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:41:12,927 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 239.0) internal successors, (1434), 6 states have internal predecessors, (1434), 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) [2023-09-01 09:41:12,927 INFO L175 Difference]: Start difference. First operand has 71 places, 72 transitions, 557 flow. Second operand 5 states and 629 transitions. [2023-09-01 09:41:12,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 170 transitions, 1561 flow [2023-09-01 09:41:12,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 170 transitions, 1539 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-09-01 09:41:12,979 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 604 flow [2023-09-01 09:41:12,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=604, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2023-09-01 09:41:12,980 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2023-09-01 09:41:12,980 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 604 flow [2023-09-01 09:41:12,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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) [2023-09-01 09:41:12,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:12,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:12,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:41:12,981 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:12,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:12,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1982851672, now seen corresponding path program 1 times [2023-09-01 09:41:12,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:12,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201465279] [2023-09-01 09:41:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:13,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:13,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201465279] [2023-09-01 09:41:13,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201465279] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:13,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:13,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:41:13,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130722488] [2023-09-01 09:41:13,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:13,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:41:13,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:13,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:41:13,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:41:13,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 239 [2023-09-01 09:41:13,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 604 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 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) [2023-09-01 09:41:13,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:13,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 239 [2023-09-01 09:41:13,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:13,701 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][126], [Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-09-01 09:41:13,701 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,701 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,701 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,701 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,701 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][56], [Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-09-01 09:41:13,701 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,701 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,701 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,701 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,703 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][56], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,703 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,703 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,703 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,703 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][146], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 13#L785true, 184#true]) [2023-09-01 09:41:13,825 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,825 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,825 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,825 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,826 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][56], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,826 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,826 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,826 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,826 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,826 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][6], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, 262#(= ~__unbuffered_cnt~0 0), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, 21#L865-3true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 272#(= ~__unbuffered_cnt~0 0), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,827 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,827 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,827 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,827 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,830 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][146], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:13,830 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,830 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,830 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,830 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][126], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 66#L758true, P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:13,831 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][128], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,831 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][56], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,831 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,831 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,832 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][126], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:13,837 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][56], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,837 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][56], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 276#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,837 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,837 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-09-01 09:41:13,838 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][146], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 66#L758true, P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:13,838 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,838 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,838 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,838 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,838 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,838 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][128], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), 95#L834true, 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,838 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,838 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,838 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,839 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,839 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:13,839 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][128], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork1InUse, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,839 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,839 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,839 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,839 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,879 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][128], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 26#L831true, 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,879 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,879 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,879 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,879 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,879 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][128], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 95#L834true, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 248#(= ~y~0 1), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 13#L785true, 184#true]) [2023-09-01 09:41:13,881 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,881 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,881 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,881 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][42], [Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 273#(<= ~__unbuffered_cnt~0 1), P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, 260#true, P2Thread1of1ForFork0InUse, 21#L865-3true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:13,943 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,943 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,943 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:13,943 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:41:14,153 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][128], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:14,153 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,153 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,153 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,153 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,153 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,153 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,155 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][128], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, 95#L834true, P3Thread1of1ForFork2InUse, 260#true, P2Thread1of1ForFork0InUse, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true]) [2023-09-01 09:41:14,155 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,155 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,155 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,155 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2023-09-01 09:41:14,343 INFO L130 PetriNetUnfolder]: 9270/14111 cut-off events. [2023-09-01 09:41:14,343 INFO L131 PetriNetUnfolder]: For 96148/100240 co-relation queries the response was YES. [2023-09-01 09:41:14,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69474 conditions, 14111 events. 9270/14111 cut-off events. For 96148/100240 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 94559 event pairs, 1296 based on Foata normal form. 1979/15489 useless extension candidates. Maximal degree in co-relation 69440. Up to 4831 conditions per place. [2023-09-01 09:41:14,428 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 177 selfloop transitions, 19 changer transitions 5/223 dead transitions. [2023-09-01 09:41:14,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 223 transitions, 2132 flow [2023-09-01 09:41:14,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:41:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:41:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-09-01 09:41:14,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5271966527196653 [2023-09-01 09:41:14,430 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-09-01 09:41:14,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-09-01 09:41:14,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:14,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-09-01 09:41:14,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 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) [2023-09-01 09:41:14,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:14,434 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:14,434 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 604 flow. Second operand 7 states and 882 transitions. [2023-09-01 09:41:14,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 223 transitions, 2132 flow [2023-09-01 09:41:14,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 223 transitions, 2127 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:41:14,531 INFO L231 Difference]: Finished difference. Result has 83 places, 87 transitions, 737 flow [2023-09-01 09:41:14,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=737, PETRI_PLACES=83, PETRI_TRANSITIONS=87} [2023-09-01 09:41:14,532 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2023-09-01 09:41:14,532 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 737 flow [2023-09-01 09:41:14,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 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) [2023-09-01 09:41:14,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:14,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:14,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:41:14,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:14,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash 194559498, now seen corresponding path program 1 times [2023-09-01 09:41:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:14,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665011996] [2023-09-01 09:41:14,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:14,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:14,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665011996] [2023-09-01 09:41:14,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665011996] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:14,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:14,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:41:14,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405525336] [2023-09-01 09:41:14,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:14,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:41:14,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:14,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:41:14,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:41:14,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 239 [2023-09-01 09:41:14,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 737 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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) [2023-09-01 09:41:14,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:14,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 239 [2023-09-01 09:41:14,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:17,090 INFO L130 PetriNetUnfolder]: 17635/25833 cut-off events. [2023-09-01 09:41:17,090 INFO L131 PetriNetUnfolder]: For 151921/153840 co-relation queries the response was YES. [2023-09-01 09:41:17,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138034 conditions, 25833 events. 17635/25833 cut-off events. For 151921/153840 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 167711 event pairs, 1190 based on Foata normal form. 1015/26819 useless extension candidates. Maximal degree in co-relation 137996. Up to 13656 conditions per place. [2023-09-01 09:41:17,233 INFO L137 encePairwiseOnDemand]: 230/239 looper letters, 140 selfloop transitions, 16 changer transitions 71/233 dead transitions. [2023-09-01 09:41:17,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 233 transitions, 2406 flow [2023-09-01 09:41:17,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:41:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:41:17,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2023-09-01 09:41:17,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4656306037059175 [2023-09-01 09:41:17,236 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 779 transitions. [2023-09-01 09:41:17,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 779 transitions. [2023-09-01 09:41:17,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:17,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 779 transitions. [2023-09-01 09:41:17,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 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) [2023-09-01 09:41:17,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:17,239 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:17,239 INFO L175 Difference]: Start difference. First operand has 83 places, 87 transitions, 737 flow. Second operand 7 states and 779 transitions. [2023-09-01 09:41:17,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 233 transitions, 2406 flow [2023-09-01 09:41:18,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 233 transitions, 2267 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-09-01 09:41:18,329 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 784 flow [2023-09-01 09:41:18,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=784, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-09-01 09:41:18,330 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2023-09-01 09:41:18,330 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 784 flow [2023-09-01 09:41:18,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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) [2023-09-01 09:41:18,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:18,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:18,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:41:18,331 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:18,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash -862570648, now seen corresponding path program 2 times [2023-09-01 09:41:18,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:18,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145232301] [2023-09-01 09:41:18,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:18,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:18,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:18,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145232301] [2023-09-01 09:41:18,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145232301] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:18,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:18,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:41:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862105144] [2023-09-01 09:41:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:18,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:41:18,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:18,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:41:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:41:18,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 239 [2023-09-01 09:41:18,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 784 flow. Second operand has 8 states, 8 states have (on average 114.5) internal successors, (916), 8 states have internal predecessors, (916), 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) [2023-09-01 09:41:18,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:18,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 239 [2023-09-01 09:41:18,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:20,180 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][108], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 304#true, Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), Black: 263#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork3InUse, P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 274#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 273#(<= ~__unbuffered_cnt~0 1), Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, 285#(= ~z~0 1), Black: 153#(= ~__unbuffered_p3_EAX~0 0), 59#L869true, 70#P2EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 290#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 296#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 287#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 31#L841true, 184#true]) [2023-09-01 09:41:20,181 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:41:20,181 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:20,181 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:20,181 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:20,806 INFO L130 PetriNetUnfolder]: 10447/16593 cut-off events. [2023-09-01 09:41:20,806 INFO L131 PetriNetUnfolder]: For 124567/127247 co-relation queries the response was YES. [2023-09-01 09:41:20,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90694 conditions, 16593 events. 10447/16593 cut-off events. For 124567/127247 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 116464 event pairs, 3252 based on Foata normal form. 253/16209 useless extension candidates. Maximal degree in co-relation 90651. Up to 12802 conditions per place. [2023-09-01 09:41:20,907 INFO L137 encePairwiseOnDemand]: 233/239 looper letters, 104 selfloop transitions, 16 changer transitions 16/157 dead transitions. [2023-09-01 09:41:20,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 157 transitions, 1603 flow [2023-09-01 09:41:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:41:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:41:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 863 transitions. [2023-09-01 09:41:20,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515839808726838 [2023-09-01 09:41:20,910 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 863 transitions. [2023-09-01 09:41:20,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 863 transitions. [2023-09-01 09:41:20,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:20,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 863 transitions. [2023-09-01 09:41:20,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 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) [2023-09-01 09:41:20,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:20,914 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:20,914 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 784 flow. Second operand 7 states and 863 transitions. [2023-09-01 09:41:20,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 157 transitions, 1603 flow [2023-09-01 09:41:21,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 157 transitions, 1573 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-09-01 09:41:21,516 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 848 flow [2023-09-01 09:41:21,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=848, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2023-09-01 09:41:21,516 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 50 predicate places. [2023-09-01 09:41:21,517 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 848 flow [2023-09-01 09:41:21,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.5) internal successors, (916), 8 states have internal predecessors, (916), 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) [2023-09-01 09:41:21,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:21,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:21,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:41:21,517 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:21,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash -326157241, now seen corresponding path program 1 times [2023-09-01 09:41:21,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:21,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199738832] [2023-09-01 09:41:21,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:21,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:21,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:21,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199738832] [2023-09-01 09:41:21,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199738832] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:21,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:21,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:41:21,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602899423] [2023-09-01 09:41:21,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:21,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:41:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:41:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:41:21,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 239 [2023-09-01 09:41:21,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 848 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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) [2023-09-01 09:41:21,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:21,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 239 [2023-09-01 09:41:21,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:24,964 INFO L130 PetriNetUnfolder]: 18017/27118 cut-off events. [2023-09-01 09:41:24,964 INFO L131 PetriNetUnfolder]: For 212717/214540 co-relation queries the response was YES. [2023-09-01 09:41:25,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154420 conditions, 27118 events. 18017/27118 cut-off events. For 212717/214540 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 184927 event pairs, 3525 based on Foata normal form. 943/28053 useless extension candidates. Maximal degree in co-relation 154374. Up to 15326 conditions per place. [2023-09-01 09:41:25,106 INFO L137 encePairwiseOnDemand]: 230/239 looper letters, 150 selfloop transitions, 20 changer transitions 49/225 dead transitions. [2023-09-01 09:41:25,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 225 transitions, 2443 flow [2023-09-01 09:41:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:41:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:41:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 792 transitions. [2023-09-01 09:41:25,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734010759115362 [2023-09-01 09:41:25,108 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 792 transitions. [2023-09-01 09:41:25,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 792 transitions. [2023-09-01 09:41:25,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:25,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 792 transitions. [2023-09-01 09:41:25,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.14285714285714) internal successors, (792), 7 states have internal predecessors, (792), 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) [2023-09-01 09:41:25,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:25,111 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 239.0) internal successors, (1912), 8 states have internal predecessors, (1912), 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) [2023-09-01 09:41:25,112 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 848 flow. Second operand 7 states and 792 transitions. [2023-09-01 09:41:25,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 225 transitions, 2443 flow [2023-09-01 09:41:25,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 225 transitions, 2369 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-09-01 09:41:25,998 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 936 flow [2023-09-01 09:41:25,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=936, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2023-09-01 09:41:25,999 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 52 predicate places. [2023-09-01 09:41:25,999 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 936 flow [2023-09-01 09:41:25,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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) [2023-09-01 09:41:25,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:25,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:25,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:41:25,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:26,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash -465539227, now seen corresponding path program 1 times [2023-09-01 09:41:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:26,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964708320] [2023-09-01 09:41:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:26,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964708320] [2023-09-01 09:41:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964708320] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:41:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106432101] [2023-09-01 09:41:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:26,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:41:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:26,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:41:26,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:41:26,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 239 [2023-09-01 09:41:26,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 936 flow. Second operand has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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) [2023-09-01 09:41:26,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:26,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 239 [2023-09-01 09:41:26,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:27,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][114], [Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), 273#(<= ~__unbuffered_cnt~0 1), P1Thread1of1ForFork3InUse, Black: 323#(= ~a~0 1), Black: 332#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 21#L865-3true, Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 330#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 222#true, 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 83#P3EXITtrue, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 290#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 285#(= ~z~0 1), Black: 287#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 340#(<= ~__unbuffered_cnt~0 1), 184#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 307#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0))]) [2023-09-01 09:41:27,650 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:41:27,650 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:27,651 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:27,651 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:41:27,831 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([404] L811-->L818: Formula: (let ((.cse1 (not (= (mod v_~x$w_buff0_used~0_81 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_82 256) 0)) .cse5)) (.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_71 256) 0)))) (.cse4 (and .cse1 .cse5))) (and (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_70 256) 0)) .cse0) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse1)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse2 0 v_~x$w_buff0_used~0_82) v_~x$w_buff0_used~0_81) (= v_~x~0_39 (ite .cse2 v_~x$w_buff0~0_22 (ite .cse3 v_~x$w_buff1~0_17 v_~x~0_40))) (= v_~x$w_buff1_used~0_70 (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_71)) (= v_~x$r_buff0_thd3~0_21 (ite .cse4 0 v_~x$r_buff0_thd3~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_71, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_17, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_70, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_81} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][152], [278#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 248#(= ~y~0 1), 24#L788true, 44#L818true, Black: 193#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 191#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 188#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 265#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork1InUse, Black: 262#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork3InUse, Black: 323#(= ~a~0 1), Black: 332#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), P3Thread1of1ForFork2InUse, P2Thread1of1ForFork0InUse, Black: 273#(<= ~__unbuffered_cnt~0 1), Black: 214#(and (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 210#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 330#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), 222#true, Black: 212#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 204#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 121#L765true, Black: 153#(= ~__unbuffered_p3_EAX~0 0), 83#P3EXITtrue, 59#L869true, Black: 164#(= ~__unbuffered_p2_EAX~0 0), Black: 290#(and (= ~z~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 252#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 285#(= ~z~0 1), Black: 287#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), Black: 227#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), Black: 236#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))), 346#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 232#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 179#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 184#true, 293#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 307#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0))]) [2023-09-01 09:41:27,831 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:41:27,831 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:27,831 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:27,831 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:41:28,160 INFO L130 PetriNetUnfolder]: 12141/18866 cut-off events. [2023-09-01 09:41:28,160 INFO L131 PetriNetUnfolder]: For 188915/194341 co-relation queries the response was YES. [2023-09-01 09:41:28,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107877 conditions, 18866 events. 12141/18866 cut-off events. For 188915/194341 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 140862 event pairs, 918 based on Foata normal form. 2630/20894 useless extension candidates. Maximal degree in co-relation 107830. Up to 7596 conditions per place. [2023-09-01 09:41:28,267 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 192 selfloop transitions, 19 changer transitions 49/285 dead transitions. [2023-09-01 09:41:28,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 285 transitions, 3207 flow [2023-09-01 09:41:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:41:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:41:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1125 transitions. [2023-09-01 09:41:28,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230125523012552 [2023-09-01 09:41:28,270 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1125 transitions. [2023-09-01 09:41:28,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1125 transitions. [2023-09-01 09:41:28,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:28,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1125 transitions. [2023-09-01 09:41:28,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.0) internal successors, (1125), 9 states have internal predecessors, (1125), 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) [2023-09-01 09:41:28,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 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) [2023-09-01 09:41:28,274 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 239.0) internal successors, (2390), 10 states have internal predecessors, (2390), 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) [2023-09-01 09:41:28,275 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 936 flow. Second operand 9 states and 1125 transitions. [2023-09-01 09:41:28,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 285 transitions, 3207 flow [2023-09-01 09:41:28,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 285 transitions, 3205 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 09:41:28,924 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 1034 flow [2023-09-01 09:41:28,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1034, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2023-09-01 09:41:28,925 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 61 predicate places. [2023-09-01 09:41:28,925 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 1034 flow [2023-09-01 09:41:28,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 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) [2023-09-01 09:41:28,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:28,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:28,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:41:28,925 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:28,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:28,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1987160477, now seen corresponding path program 1 times [2023-09-01 09:41:28,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:28,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962822287] [2023-09-01 09:41:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:29,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:29,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962822287] [2023-09-01 09:41:29,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962822287] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:29,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:29,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:41:29,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930081428] [2023-09-01 09:41:29,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:29,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:41:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:29,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:41:29,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:41:29,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 239 [2023-09-01 09:41:29,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 1034 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 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) [2023-09-01 09:41:29,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:29,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 239 [2023-09-01 09:41:29,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:31,446 INFO L130 PetriNetUnfolder]: 11753/18353 cut-off events. [2023-09-01 09:41:31,447 INFO L131 PetriNetUnfolder]: For 195718/201656 co-relation queries the response was YES. [2023-09-01 09:41:31,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111833 conditions, 18353 events. 11753/18353 cut-off events. For 195718/201656 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 137989 event pairs, 1004 based on Foata normal form. 2011/19777 useless extension candidates. Maximal degree in co-relation 111782. Up to 7438 conditions per place. [2023-09-01 09:41:31,526 INFO L137 encePairwiseOnDemand]: 232/239 looper letters, 59 selfloop transitions, 17 changer transitions 195/278 dead transitions. [2023-09-01 09:41:31,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 278 transitions, 3206 flow [2023-09-01 09:41:31,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 09:41:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 09:41:31,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1349 transitions. [2023-09-01 09:41:31,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131228604031951 [2023-09-01 09:41:31,529 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1349 transitions. [2023-09-01 09:41:31,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1349 transitions. [2023-09-01 09:41:31,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:31,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1349 transitions. [2023-09-01 09:41:31,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 122.63636363636364) internal successors, (1349), 11 states have internal predecessors, (1349), 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) [2023-09-01 09:41:31,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 239.0) internal successors, (2868), 12 states have internal predecessors, (2868), 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) [2023-09-01 09:41:31,535 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 239.0) internal successors, (2868), 12 states have internal predecessors, (2868), 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) [2023-09-01 09:41:31,535 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 1034 flow. Second operand 11 states and 1349 transitions. [2023-09-01 09:41:31,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 278 transitions, 3206 flow [2023-09-01 09:41:33,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 278 transitions, 3032 flow, removed 73 selfloop flow, removed 4 redundant places. [2023-09-01 09:41:33,015 INFO L231 Difference]: Finished difference. Result has 115 places, 50 transitions, 435 flow [2023-09-01 09:41:33,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=435, PETRI_PLACES=115, PETRI_TRANSITIONS=50} [2023-09-01 09:41:33,015 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places. [2023-09-01 09:41:33,015 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 50 transitions, 435 flow [2023-09-01 09:41:33,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 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) [2023-09-01 09:41:33,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:33,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:33,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 09:41:33,016 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:33,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:33,017 INFO L85 PathProgramCache]: Analyzing trace with hash 396200421, now seen corresponding path program 1 times [2023-09-01 09:41:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:33,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462038212] [2023-09-01 09:41:33,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:33,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:41:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:41:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:41:34,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462038212] [2023-09-01 09:41:34,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462038212] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:41:34,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:41:34,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-09-01 09:41:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491916857] [2023-09-01 09:41:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:41:34,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 09:41:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:41:34,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 09:41:34,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-09-01 09:41:34,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 239 [2023-09-01 09:41:34,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 50 transitions, 435 flow. Second operand has 11 states, 11 states have (on average 111.27272727272727) internal successors, (1224), 11 states have internal predecessors, (1224), 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) [2023-09-01 09:41:34,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:41:34,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 239 [2023-09-01 09:41:34,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:41:34,610 INFO L130 PetriNetUnfolder]: 1522/2481 cut-off events. [2023-09-01 09:41:34,610 INFO L131 PetriNetUnfolder]: For 17005/17360 co-relation queries the response was YES. [2023-09-01 09:41:34,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13143 conditions, 2481 events. 1522/2481 cut-off events. For 17005/17360 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13029 event pairs, 520 based on Foata normal form. 25/2389 useless extension candidates. Maximal degree in co-relation 13093. Up to 1114 conditions per place. [2023-09-01 09:41:34,620 INFO L137 encePairwiseOnDemand]: 233/239 looper letters, 56 selfloop transitions, 4 changer transitions 36/101 dead transitions. [2023-09-01 09:41:34,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 101 transitions, 1070 flow [2023-09-01 09:41:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:41:34,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:41:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 710 transitions. [2023-09-01 09:41:34,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49511854951185497 [2023-09-01 09:41:34,622 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 710 transitions. [2023-09-01 09:41:34,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 710 transitions. [2023-09-01 09:41:34,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:41:34,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 710 transitions. [2023-09-01 09:41:34,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.33333333333333) internal successors, (710), 6 states have internal predecessors, (710), 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) [2023-09-01 09:41:34,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 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) [2023-09-01 09:41:34,625 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 239.0) internal successors, (1673), 7 states have internal predecessors, (1673), 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) [2023-09-01 09:41:34,625 INFO L175 Difference]: Start difference. First operand has 115 places, 50 transitions, 435 flow. Second operand 6 states and 710 transitions. [2023-09-01 09:41:34,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 101 transitions, 1070 flow [2023-09-01 09:41:34,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 749 flow, removed 112 selfloop flow, removed 31 redundant places. [2023-09-01 09:41:34,663 INFO L231 Difference]: Finished difference. Result has 73 places, 49 transitions, 291 flow [2023-09-01 09:41:34,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=239, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2023-09-01 09:41:34,663 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2023-09-01 09:41:34,663 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 49 transitions, 291 flow [2023-09-01 09:41:34,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.27272727272727) internal successors, (1224), 11 states have internal predecessors, (1224), 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) [2023-09-01 09:41:34,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:41:34,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:34,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 09:41:34,664 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:41:34,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:41:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1466274999, now seen corresponding path program 2 times [2023-09-01 09:41:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:41:34,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117456224] [2023-09-01 09:41:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:41:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:41:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:41:34,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:41:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:41:34,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:41:34,802 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:41:34,803 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:41:34,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:41:34,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:41:34,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:41:34,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:41:34,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:41:34,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:41:34,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-09-01 09:41:34,807 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:41:34,811 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:41:34,811 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:41:34,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:41:34 BasicIcfg [2023-09-01 09:41:34,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:41:34,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:41:34,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:41:34,900 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:41:34,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:40:52" (3/4) ... [2023-09-01 09:41:34,902 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:41:34,963 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:41:34,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:41:34,964 INFO L158 Benchmark]: Toolchain (without parser) took 43280.75ms. Allocated memory was 75.5MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 51.5MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-09-01 09:41:34,964 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:41:34,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.49ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 45.9MB in the end (delta: 5.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2023-09-01 09:41:34,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.74ms. Allocated memory is still 75.5MB. Free memory was 45.9MB in the beginning and 43.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:41:34,965 INFO L158 Benchmark]: Boogie Preprocessor took 19.50ms. Allocated memory is still 75.5MB. Free memory was 43.2MB in the beginning and 41.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:41:34,965 INFO L158 Benchmark]: RCFGBuilder took 588.91ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 41.1MB in the beginning and 63.3MB in the end (delta: -22.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2023-09-01 09:41:34,965 INFO L158 Benchmark]: TraceAbstraction took 42124.46ms. Allocated memory was 92.3MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 62.2MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-09-01 09:41:34,966 INFO L158 Benchmark]: Witness Printer took 63.66ms. Allocated memory is still 6.1GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:41:34,967 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.14ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.49ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 45.9MB in the end (delta: 5.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.74ms. Allocated memory is still 75.5MB. Free memory was 45.9MB in the beginning and 43.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.50ms. Allocated memory is still 75.5MB. Free memory was 43.2MB in the beginning and 41.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 588.91ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 41.1MB in the beginning and 63.3MB in the end (delta: -22.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42124.46ms. Allocated memory was 92.3MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 62.2MB in the beginning and 5.1GB in the end (delta: -5.0GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 63.66ms. Allocated memory is still 6.1GB. Free memory was 5.1GB in the beginning and 5.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 140 PlacesBefore, 45 PlacesAfterwards, 129 TransitionsBefore, 33 TransitionsAfterwards, 3272 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 9891 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4611, independent: 4352, independent conditional: 0, independent unconditional: 4352, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1718, independent: 1683, independent conditional: 0, independent unconditional: 1683, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4611, independent: 2669, independent conditional: 0, independent unconditional: 2669, dependent: 224, dependent conditional: 0, dependent unconditional: 224, unknown: 1718, unknown conditional: 0, unknown unconditional: 1718] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 183, Positive conditional cache size: 0, Positive unconditional cache size: 183, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t145, ((void *)0), P0, ((void *)0))=0, t145={6:0}, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, x=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t146, ((void *)0), P1, ((void *)0))=1, t145={6:0}, t146={7:0}, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, x=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t147, ((void *)0), P2, ((void *)0))=2, t145={6:0}, t146={7:0}, t147={8:0}, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, x=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t148, ((void *)0), P3, ((void *)0))=3, t145={6:0}, t146={7:0}, t147={8:0}, t148={5:0}, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t145={6:0}, t146={7:0}, t147={8:0}, t148={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 861]: 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: 865]: 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: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1386 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1167 mSDsluCounter, 888 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 766 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3076 IncrementalHoareTripleChecker+Invalid, 3364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 122 mSDtfsCounter, 3076 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1034occurred in iteration=14, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 3190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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! [2023-09-01 09:41:34,987 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE