./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 --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-08-31 23:08:03,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:08:03,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:08:03,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:08:03,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:08:03,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:08:03,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:08:03,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:08:03,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:08:03,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:08:03,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:08:03,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:08:03,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:08:03,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:08:03,130 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:08:03,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:08:03,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:08:03,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:08:03,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:08:03,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:08:03,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:08:03,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:08:03,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:08:03,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:08:03,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:08:03,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:08:03,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:08:03,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:08:03,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:08:03,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:08:03,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:08:03,171 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:08:03,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:08:03,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:08:03,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:08:03,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:08:03,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:08:03,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:08:03,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:08:03,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:08:03,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:08:03,179 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:08:03,210 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:08:03,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:08:03,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:08:03,212 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:08:03,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:08:03,213 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:08:03,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:08:03,214 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:08:03,214 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:08:03,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:08:03,215 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:08:03,215 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:08:03,215 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:08:03,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:08:03,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:08:03,216 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:08:03,216 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:08:03,216 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:08:03,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:08:03,217 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:08:03,217 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:08:03,217 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:08:03,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:08:03,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:08:03,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:08:03,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:08:03,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:08:03,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:08:03,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:08:03,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:08:03,219 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:08:03,219 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:08:03,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:08:03,219 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:08:03,220 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 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-08-31 23:08:03,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:08:03,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:08:03,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:08:03,543 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:08:03,543 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:08:03,544 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:08:04,665 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:08:04,936 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:08:04,941 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:08:04,964 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916c36d44/4d7ae217dbc84998a177e9a9099ad292/FLAG8be96b904 [2023-08-31 23:08:04,979 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916c36d44/4d7ae217dbc84998a177e9a9099ad292 [2023-08-31 23:08:04,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:08:04,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:08:04,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:08:04,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:08:04,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:08:04,988 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:08:04" (1/1) ... [2023-08-31 23:08:04,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7548c7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:04, skipping insertion in model container [2023-08-31 23:08:04,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:08:04" (1/1) ... [2023-08-31 23:08:04,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:08:05,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:08:05,209 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_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:08:05,440 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:08:05,451 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:08:05,462 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_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:08:05,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:08:05,625 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:08:05,625 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:08:05,631 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:08:05,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05 WrapperNode [2023-08-31 23:08:05,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:08:05,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:08:05,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:08:05,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:08:05,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,703 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2023-08-31 23:08:05,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:08:05,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:08:05,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:08:05,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:08:05,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,754 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:08:05,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:08:05,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:08:05,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:08:05,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (1/1) ... [2023-08-31 23:08:05,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:08:05,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:08:05,802 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-08-31 23:08:05,834 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-08-31 23:08:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:08:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:08:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:08:05,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:08:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:08:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:08:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:08:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:08:05,842 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:08:05,842 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:08:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:08:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:08:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:08:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:08:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:08:05,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:08:05,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:08:05,845 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:08:06,016 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:08:06,017 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:08:06,376 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:08:06,503 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:08:06,504 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:08:06,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:08:06 BoogieIcfgContainer [2023-08-31 23:08:06,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:08:06,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:08:06,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:08:06,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:08:06,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:08:04" (1/3) ... [2023-08-31 23:08:06,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4f54e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:08:06, skipping insertion in model container [2023-08-31 23:08:06,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:08:05" (2/3) ... [2023-08-31 23:08:06,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4f54e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:08:06, skipping insertion in model container [2023-08-31 23:08:06,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:08:06" (3/3) ... [2023-08-31 23:08:06,513 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:08:06,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:08:06,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:08:06,526 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:08:06,571 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:08:06,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:08:06,646 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:08:06,646 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:08:06,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:08:06,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-31 23:08:06,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-31 23:08:06,659 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:08:06,667 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:08:06,669 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-31 23:08:06,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-31 23:08:06,702 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-31 23:08:06,702 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:08:06,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:08:06,706 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-31 23:08:11,383 INFO L134 LiptonReduction]: Checked pairs total: 10753 [2023-08-31 23:08:11,383 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-31 23:08:11,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:08:11,400 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@2bf9c7eb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:08:11,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:08:11,402 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:08:11,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:08:11,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:11,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:08:11,403 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:11,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:11,407 INFO L85 PathProgramCache]: Analyzing trace with hash 618, now seen corresponding path program 1 times [2023-08-31 23:08:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:11,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346460582] [2023-08-31 23:08:11,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:11,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:11,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:11,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346460582] [2023-08-31 23:08:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346460582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:11,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:11,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:08:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777160124] [2023-08-31 23:08:11,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:11,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:08:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:11,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:08:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:08:11,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 286 [2023-08-31 23:08:11,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 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-08-31 23:08:11,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:11,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 286 [2023-08-31 23:08:11,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:12,896 INFO L130 PetriNetUnfolder]: 7479/10219 cut-off events. [2023-08-31 23:08:12,896 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-31 23:08:12,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20527 conditions, 10219 events. 7479/10219 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 54225 event pairs, 7479 based on Foata normal form. 0/8770 useless extension candidates. Maximal degree in co-relation 20515. Up to 10091 conditions per place. [2023-08-31 23:08:12,968 INFO L137 encePairwiseOnDemand]: 278/286 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-31 23:08:12,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-31 23:08:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:08:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:08:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-31 23:08:12,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5157342657342657 [2023-08-31 23:08:12,986 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-31 23:08:12,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-31 23:08:12,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:12,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-31 23:08:12,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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-08-31 23:08:13,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:08:13,001 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 286.0) internal successors, (858), 3 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:08:13,002 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 2 states and 295 transitions. [2023-08-31 23:08:13,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-31 23:08:13,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:08:13,009 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-31 23:08:13,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-31 23:08:13,015 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-31 23:08:13,015 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-31 23:08:13,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 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-08-31 23:08:13,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:13,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:08:13,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:08:13,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:13,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:13,022 INFO L85 PathProgramCache]: Analyzing trace with hash 607220, now seen corresponding path program 1 times [2023-08-31 23:08:13,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:13,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93401606] [2023-08-31 23:08:13,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:13,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:13,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:13,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93401606] [2023-08-31 23:08:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93401606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:13,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:13,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:08:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376236054] [2023-08-31 23:08:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:13,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:08:13,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:13,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:08:13,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:08:13,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 286 [2023-08-31 23:08:13,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-08-31 23:08:13,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:13,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 286 [2023-08-31 23:08:13,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:14,204 INFO L130 PetriNetUnfolder]: 5879/8056 cut-off events. [2023-08-31 23:08:14,204 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:08:14,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16197 conditions, 8056 events. 5879/8056 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 41052 event pairs, 3031 based on Foata normal form. 0/7389 useless extension candidates. Maximal degree in co-relation 16194. Up to 6367 conditions per place. [2023-08-31 23:08:14,242 INFO L137 encePairwiseOnDemand]: 283/286 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-31 23:08:14,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 212 flow [2023-08-31 23:08:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:08:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:08:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-31 23:08:14,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506993006993007 [2023-08-31 23:08:14,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-31 23:08:14,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-31 23:08:14,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:14,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-31 23:08:14,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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-08-31 23:08:14,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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-08-31 23:08:14,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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-08-31 23:08:14,250 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 435 transitions. [2023-08-31 23:08:14,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 212 flow [2023-08-31 23:08:14,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:08:14,252 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-31 23:08:14,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=43, PETRI_TRANSITIONS=30} [2023-08-31 23:08:14,253 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-31 23:08:14,253 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-31 23:08:14,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-08-31 23:08:14,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:14,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:08:14,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:08:14,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:14,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:14,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2087289494, now seen corresponding path program 1 times [2023-08-31 23:08:14,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009252733] [2023-08-31 23:08:14,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:14,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:14,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:14,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009252733] [2023-08-31 23:08:14,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009252733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:14,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:14,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:08:14,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30744798] [2023-08-31 23:08:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:14,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:08:14,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:08:14,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:08:14,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-31 23:08:14,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-08-31 23:08:14,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:14,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-31 23:08:14,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:17,316 INFO L130 PetriNetUnfolder]: 23007/31032 cut-off events. [2023-08-31 23:08:17,317 INFO L131 PetriNetUnfolder]: For 1143/1143 co-relation queries the response was YES. [2023-08-31 23:08:17,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63767 conditions, 31032 events. 23007/31032 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 167346 event pairs, 8535 based on Foata normal form. 0/30152 useless extension candidates. Maximal degree in co-relation 63763. Up to 20521 conditions per place. [2023-08-31 23:08:17,504 INFO L137 encePairwiseOnDemand]: 276/286 looper letters, 46 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2023-08-31 23:08:17,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 238 flow [2023-08-31 23:08:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:08:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:08:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-31 23:08:17,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47785547785547783 [2023-08-31 23:08:17,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-31 23:08:17,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-31 23:08:17,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:17,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-31 23:08:17,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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-08-31 23:08:17,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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-08-31 23:08:17,511 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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-08-31 23:08:17,511 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 410 transitions. [2023-08-31 23:08:17,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 238 flow [2023-08-31 23:08:17,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:08:17,513 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 138 flow [2023-08-31 23:08:17,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-08-31 23:08:17,514 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2023-08-31 23:08:17,515 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 138 flow [2023-08-31 23:08:17,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-08-31 23:08:17,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:17,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:08:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:08:17,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:17,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2087289503, now seen corresponding path program 1 times [2023-08-31 23:08:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:17,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571752504] [2023-08-31 23:08:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:18,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571752504] [2023-08-31 23:08:18,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571752504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:18,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:18,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:08:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904867263] [2023-08-31 23:08:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:18,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:08:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:18,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:08:18,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:08:18,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 286 [2023-08-31 23:08:18,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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-08-31 23:08:18,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:18,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 286 [2023-08-31 23:08:18,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:20,156 INFO L130 PetriNetUnfolder]: 15519/21907 cut-off events. [2023-08-31 23:08:20,156 INFO L131 PetriNetUnfolder]: For 7638/7879 co-relation queries the response was YES. [2023-08-31 23:08:20,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52114 conditions, 21907 events. 15519/21907 cut-off events. For 7638/7879 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 128920 event pairs, 3180 based on Foata normal form. 677/22020 useless extension candidates. Maximal degree in co-relation 52109. Up to 15223 conditions per place. [2023-08-31 23:08:20,283 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 55 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2023-08-31 23:08:20,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 338 flow [2023-08-31 23:08:20,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:08:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:08:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-08-31 23:08:20,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42832167832167833 [2023-08-31 23:08:20,291 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-08-31 23:08:20,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-08-31 23:08:20,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:20,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-08-31 23:08:20,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 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-08-31 23:08:20,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:20,298 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:20,298 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 138 flow. Second operand 6 states and 735 transitions. [2023-08-31 23:08:20,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 338 flow [2023-08-31 23:08:20,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:08:20,362 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 141 flow [2023-08-31 23:08:20,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-31 23:08:20,364 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-31 23:08:20,364 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 141 flow [2023-08-31 23:08:20,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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-08-31 23:08:20,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:20,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:08:20,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:08:20,365 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:20,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:20,366 INFO L85 PathProgramCache]: Analyzing trace with hash 88447660, now seen corresponding path program 1 times [2023-08-31 23:08:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725568924] [2023-08-31 23:08:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:20,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:20,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725568924] [2023-08-31 23:08:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725568924] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:20,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:20,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:08:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939664458] [2023-08-31 23:08:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:20,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:08:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:08:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:08:20,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 286 [2023-08-31 23:08:20,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-08-31 23:08:20,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:20,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 286 [2023-08-31 23:08:20,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:22,567 INFO L130 PetriNetUnfolder]: 15396/21842 cut-off events. [2023-08-31 23:08:22,567 INFO L131 PetriNetUnfolder]: For 6194/6510 co-relation queries the response was YES. [2023-08-31 23:08:22,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51503 conditions, 21842 events. 15396/21842 cut-off events. For 6194/6510 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 130138 event pairs, 7068 based on Foata normal form. 24/20726 useless extension candidates. Maximal degree in co-relation 51497. Up to 19567 conditions per place. [2023-08-31 23:08:22,670 INFO L137 encePairwiseOnDemand]: 282/286 looper letters, 47 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-31 23:08:22,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 318 flow [2023-08-31 23:08:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:08:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:08:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-31 23:08:22,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976689976689977 [2023-08-31 23:08:22,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-31 23:08:22,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-31 23:08:22,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:22,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-31 23:08:22,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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-08-31 23:08:22,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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-08-31 23:08:22,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 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-08-31 23:08:22,676 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 141 flow. Second operand 3 states and 427 transitions. [2023-08-31 23:08:22,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 318 flow [2023-08-31 23:08:22,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 300 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-31 23:08:22,679 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 170 flow [2023-08-31 23:08:22,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-31 23:08:22,682 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2023-08-31 23:08:22,683 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 170 flow [2023-08-31 23:08:22,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-08-31 23:08:22,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:22,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:08:22,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:08:22,684 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:22,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 86040829, now seen corresponding path program 1 times [2023-08-31 23:08:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372812017] [2023-08-31 23:08:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:23,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:23,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372812017] [2023-08-31 23:08:23,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372812017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:23,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:23,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:08:23,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211949875] [2023-08-31 23:08:23,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:23,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:08:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:23,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:08:23,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:08:23,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 286 [2023-08-31 23:08:23,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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-08-31 23:08:23,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:23,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 286 [2023-08-31 23:08:23,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:25,094 INFO L130 PetriNetUnfolder]: 13240/18887 cut-off events. [2023-08-31 23:08:25,095 INFO L131 PetriNetUnfolder]: For 10887/11538 co-relation queries the response was YES. [2023-08-31 23:08:25,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46140 conditions, 18887 events. 13240/18887 cut-off events. For 10887/11538 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 111389 event pairs, 2588 based on Foata normal form. 723/19090 useless extension candidates. Maximal degree in co-relation 46133. Up to 12766 conditions per place. [2023-08-31 23:08:25,179 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 62 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2023-08-31 23:08:25,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 433 flow [2023-08-31 23:08:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:08:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:08:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-08-31 23:08:25,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2023-08-31 23:08:25,183 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-08-31 23:08:25,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-08-31 23:08:25,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:25,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-08-31 23:08:25,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 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-08-31 23:08:25,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:25,188 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:25,188 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 170 flow. Second operand 6 states and 737 transitions. [2023-08-31 23:08:25,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 433 flow [2023-08-31 23:08:25,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:08:25,195 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 207 flow [2023-08-31 23:08:25,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-08-31 23:08:25,196 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-31 23:08:25,196 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 207 flow [2023-08-31 23:08:25,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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-08-31 23:08:25,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:25,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:08:25,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:08:25,197 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:25,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -733438198, now seen corresponding path program 1 times [2023-08-31 23:08:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:25,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730699514] [2023-08-31 23:08:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:25,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:25,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:25,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730699514] [2023-08-31 23:08:25,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730699514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:25,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:25,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:08:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141939032] [2023-08-31 23:08:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:25,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:08:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:25,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:08:25,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:08:25,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 286 [2023-08-31 23:08:25,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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-08-31 23:08:25,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:25,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 286 [2023-08-31 23:08:25,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:27,172 INFO L130 PetriNetUnfolder]: 11107/15755 cut-off events. [2023-08-31 23:08:27,172 INFO L131 PetriNetUnfolder]: For 12398/13556 co-relation queries the response was YES. [2023-08-31 23:08:27,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37686 conditions, 15755 events. 11107/15755 cut-off events. For 12398/13556 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 91941 event pairs, 4480 based on Foata normal form. 906/15812 useless extension candidates. Maximal degree in co-relation 37677. Up to 14085 conditions per place. [2023-08-31 23:08:27,237 INFO L137 encePairwiseOnDemand]: 281/286 looper letters, 46 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2023-08-31 23:08:27,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 355 flow [2023-08-31 23:08:27,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:08:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:08:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-31 23:08:27,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131701631701632 [2023-08-31 23:08:27,240 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-31 23:08:27,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-31 23:08:27,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:27,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-31 23:08:27,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 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-08-31 23:08:27,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:27,245 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:27,245 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 207 flow. Second operand 6 states and 709 transitions. [2023-08-31 23:08:27,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 355 flow [2023-08-31 23:08:27,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 346 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:08:27,249 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 186 flow [2023-08-31 23:08:27,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-31 23:08:27,249 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-31 23:08:27,250 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 186 flow [2023-08-31 23:08:27,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 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-08-31 23:08:27,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:27,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:08:27,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:08:27,251 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:27,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:27,251 INFO L85 PathProgramCache]: Analyzing trace with hash 489247188, now seen corresponding path program 1 times [2023-08-31 23:08:27,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:27,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115816116] [2023-08-31 23:08:27,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:27,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:27,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:27,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:27,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115816116] [2023-08-31 23:08:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115816116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:27,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:08:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911833816] [2023-08-31 23:08:27,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:27,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:08:27,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:27,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:08:27,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:08:27,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-31 23:08:27,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:08:27,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:27,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-31 23:08:27,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:28,700 INFO L130 PetriNetUnfolder]: 9688/14376 cut-off events. [2023-08-31 23:08:28,700 INFO L131 PetriNetUnfolder]: For 7165/7671 co-relation queries the response was YES. [2023-08-31 23:08:28,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34214 conditions, 14376 events. 9688/14376 cut-off events. For 7165/7671 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 92363 event pairs, 2024 based on Foata normal form. 1244/14920 useless extension candidates. Maximal degree in co-relation 34205. Up to 5727 conditions per place. [2023-08-31 23:08:28,779 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 63 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2023-08-31 23:08:28,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 460 flow [2023-08-31 23:08:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:08:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:08:28,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-31 23:08:28,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48164335664335667 [2023-08-31 23:08:28,782 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-31 23:08:28,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-31 23:08:28,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:28,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-31 23:08:28,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 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-08-31 23:08:28,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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-08-31 23:08:28,786 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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-08-31 23:08:28,786 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 186 flow. Second operand 4 states and 551 transitions. [2023-08-31 23:08:28,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 460 flow [2023-08-31 23:08:28,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 82 transitions, 446 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:08:28,791 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 224 flow [2023-08-31 23:08:28,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-31 23:08:28,792 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-31 23:08:28,792 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 224 flow [2023-08-31 23:08:28,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:08:28,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:28,793 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-08-31 23:08:28,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:08:28,794 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:28,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 581488152, now seen corresponding path program 1 times [2023-08-31 23:08:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:28,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57938040] [2023-08-31 23:08:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:29,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:29,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57938040] [2023-08-31 23:08:29,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57938040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:29,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:29,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:08:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800200596] [2023-08-31 23:08:29,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:29,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:08:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:29,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:08:29,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:08:29,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 286 [2023-08-31 23:08:29,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 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-08-31 23:08:29,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:29,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 286 [2023-08-31 23:08:29,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:32,169 INFO L130 PetriNetUnfolder]: 27047/38486 cut-off events. [2023-08-31 23:08:32,169 INFO L131 PetriNetUnfolder]: For 36301/36301 co-relation queries the response was YES. [2023-08-31 23:08:32,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118815 conditions, 38486 events. 27047/38486 cut-off events. For 36301/36301 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 242551 event pairs, 1413 based on Foata normal form. 323/38809 useless extension candidates. Maximal degree in co-relation 118804. Up to 11183 conditions per place. [2023-08-31 23:08:32,385 INFO L137 encePairwiseOnDemand]: 270/286 looper letters, 214 selfloop transitions, 90 changer transitions 12/316 dead transitions. [2023-08-31 23:08:32,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 316 transitions, 2072 flow [2023-08-31 23:08:32,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 23:08:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 23:08:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1707 transitions. [2023-08-31 23:08:32,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591178052716514 [2023-08-31 23:08:32,392 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1707 transitions. [2023-08-31 23:08:32,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1707 transitions. [2023-08-31 23:08:32,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:32,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1707 transitions. [2023-08-31 23:08:32,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 131.30769230769232) internal successors, (1707), 13 states have internal predecessors, (1707), 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-08-31 23:08:32,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 286.0) internal successors, (4004), 14 states have internal predecessors, (4004), 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-08-31 23:08:32,402 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 286.0) internal successors, (4004), 14 states have internal predecessors, (4004), 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-08-31 23:08:32,402 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 224 flow. Second operand 13 states and 1707 transitions. [2023-08-31 23:08:32,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 316 transitions, 2072 flow [2023-08-31 23:08:32,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 316 transitions, 2059 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:08:32,416 INFO L231 Difference]: Finished difference. Result has 75 places, 129 transitions, 1010 flow [2023-08-31 23:08:32,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1010, PETRI_PLACES=75, PETRI_TRANSITIONS=129} [2023-08-31 23:08:32,417 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2023-08-31 23:08:32,417 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 129 transitions, 1010 flow [2023-08-31 23:08:32,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 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-08-31 23:08:32,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:32,419 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-08-31 23:08:32,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:08:32,419 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:32,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1940715829, now seen corresponding path program 1 times [2023-08-31 23:08:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:32,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767393115] [2023-08-31 23:08:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:32,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:32,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767393115] [2023-08-31 23:08:32,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767393115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:32,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:08:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802722892] [2023-08-31 23:08:32,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:32,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:08:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:08:32,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:08:32,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 286 [2023-08-31 23:08:32,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 129 transitions, 1010 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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-08-31 23:08:32,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:32,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 286 [2023-08-31 23:08:32,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:36,000 INFO L130 PetriNetUnfolder]: 25709/36972 cut-off events. [2023-08-31 23:08:36,001 INFO L131 PetriNetUnfolder]: For 151346/151346 co-relation queries the response was YES. [2023-08-31 23:08:36,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171908 conditions, 36972 events. 25709/36972 cut-off events. For 151346/151346 co-relation queries the response was YES. Maximal size of possible extension queue 1276. Compared 232866 event pairs, 9881 based on Foata normal form. 306/37278 useless extension candidates. Maximal degree in co-relation 171887. Up to 20699 conditions per place. [2023-08-31 23:08:36,277 INFO L137 encePairwiseOnDemand]: 280/286 looper letters, 157 selfloop transitions, 34 changer transitions 13/204 dead transitions. [2023-08-31 23:08:36,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 204 transitions, 1932 flow [2023-08-31 23:08:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:08:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:08:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-31 23:08:36,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46940559440559443 [2023-08-31 23:08:36,279 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-31 23:08:36,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-31 23:08:36,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:36,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-31 23:08:36,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 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-08-31 23:08:36,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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-08-31 23:08:36,283 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 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-08-31 23:08:36,283 INFO L175 Difference]: Start difference. First operand has 75 places, 129 transitions, 1010 flow. Second operand 4 states and 537 transitions. [2023-08-31 23:08:36,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 204 transitions, 1932 flow [2023-08-31 23:08:36,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 204 transitions, 1902 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-31 23:08:36,490 INFO L231 Difference]: Finished difference. Result has 79 places, 128 transitions, 1118 flow [2023-08-31 23:08:36,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1118, PETRI_PLACES=79, PETRI_TRANSITIONS=128} [2023-08-31 23:08:36,491 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2023-08-31 23:08:36,491 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 128 transitions, 1118 flow [2023-08-31 23:08:36,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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-08-31 23:08:36,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:36,492 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-08-31 23:08:36,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:08:36,492 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:36,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:36,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1886741358, now seen corresponding path program 1 times [2023-08-31 23:08:36,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:36,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256239871] [2023-08-31 23:08:36,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:36,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:36,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:36,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256239871] [2023-08-31 23:08:36,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256239871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:36,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:36,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:08:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313706695] [2023-08-31 23:08:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:36,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:08:36,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:36,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:08:36,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:08:36,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 286 [2023-08-31 23:08:36,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 128 transitions, 1118 flow. Second operand has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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-08-31 23:08:36,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:36,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 286 [2023-08-31 23:08:36,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:42,303 INFO L130 PetriNetUnfolder]: 35640/51685 cut-off events. [2023-08-31 23:08:42,303 INFO L131 PetriNetUnfolder]: For 208710/208710 co-relation queries the response was YES. [2023-08-31 23:08:42,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236727 conditions, 51685 events. 35640/51685 cut-off events. For 208710/208710 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 356561 event pairs, 6733 based on Foata normal form. 281/51966 useless extension candidates. Maximal degree in co-relation 236704. Up to 22677 conditions per place. [2023-08-31 23:08:42,563 INFO L137 encePairwiseOnDemand]: 276/286 looper letters, 183 selfloop transitions, 71 changer transitions 46/300 dead transitions. [2023-08-31 23:08:42,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 300 transitions, 3004 flow [2023-08-31 23:08:42,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:08:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:08:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2023-08-31 23:08:42,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2023-08-31 23:08:42,566 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2023-08-31 23:08:42,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2023-08-31 23:08:42,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:42,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2023-08-31 23:08:42,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 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-08-31 23:08:42,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:42,571 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:42,571 INFO L175 Difference]: Start difference. First operand has 79 places, 128 transitions, 1118 flow. Second operand 6 states and 803 transitions. [2023-08-31 23:08:42,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 300 transitions, 3004 flow [2023-08-31 23:08:42,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 300 transitions, 2961 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-31 23:08:42,811 INFO L231 Difference]: Finished difference. Result has 88 places, 155 transitions, 1686 flow [2023-08-31 23:08:42,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1686, PETRI_PLACES=88, PETRI_TRANSITIONS=155} [2023-08-31 23:08:42,812 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2023-08-31 23:08:42,812 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 155 transitions, 1686 flow [2023-08-31 23:08:42,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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-08-31 23:08:42,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:42,813 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-08-31 23:08:42,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:08:42,813 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:42,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash 493988248, now seen corresponding path program 2 times [2023-08-31 23:08:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:42,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044603839] [2023-08-31 23:08:42,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:42,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:43,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:43,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044603839] [2023-08-31 23:08:43,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044603839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:43,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:08:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546752349] [2023-08-31 23:08:43,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:43,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:08:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:43,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:08:43,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:08:43,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-31 23:08:43,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 155 transitions, 1686 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 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-08-31 23:08:43,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:43,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-31 23:08:43,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:44,456 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][126], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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)))), 275#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 87#L878-3true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 204#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 36#L808true, 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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 (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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))), 64#L775true]) [2023-08-31 23:08:44,457 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:08:44,457 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:08:44,457 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:08:44,457 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:08:44,977 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][223], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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)))), 87#L878-3true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 204#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 36#L808true, 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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 (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:44,978 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:08:44,978 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:08:44,978 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:08:44,978 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:08:44,980 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][126], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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)))), 275#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), 36#L808true, Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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))), 64#L775true]) [2023-08-31 23:08:44,980 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:08:44,980 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:08:44,981 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:08:44,981 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:08:45,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][223], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 254#(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))), 243#true, Black: 252#(= ~y~0 1), 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 256#(and (= ~y~0 1) (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)))), 87#L878-3true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 204#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 14#L788true, 77#L847true, 70#P2EXITtrue, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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: 231#(and (not (= ~z~0 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)))), 159#true, Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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 (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 245#(= ~x~0 1), Black: 246#(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)))]) [2023-08-31 23:08:45,092 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,092 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,092 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,092 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,244 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][182], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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)))), 87#L878-3true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), P1Thread1of1ForFork0InUse, 204#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 132#L831true, 37#P1EXITtrue, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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)))), 34#L818true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:45,245 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,245 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,245 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,245 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,245 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][254], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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)))), 118#L811true, 87#L878-3true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 245#(= ~x~0 1), P1Thread1of1ForFork0InUse, 204#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 159#true, 252#(= ~y~0 1), Black: 231#(and (not (= ~z~0 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: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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 (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:45,245 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,246 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,246 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,246 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,412 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][223], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 36#L808true, 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:45,412 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,412 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,412 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,412 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][243], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 36#L808true, 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), 267#true, Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:45,414 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,414 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,414 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,414 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:45,515 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][243], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 254#(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))), 243#true, Black: 252#(= ~y~0 1), Black: 256#(and (= ~y~0 1) (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)))), 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 77#L847true, 14#L788true, 70#P2EXITtrue, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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)))), 267#true, Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 245#(= ~x~0 1), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:45,516 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,516 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,516 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,516 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,520 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][223], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 254#(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))), 243#true, Black: 252#(= ~y~0 1), 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 256#(and (= ~y~0 1) (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: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 14#L788true, 77#L847true, 70#P2EXITtrue, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 245#(= ~x~0 1), Black: 246#(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)))]) [2023-08-31 23:08:45,520 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,520 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,520 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,521 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,652 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][182], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), P1Thread1of1ForFork0InUse, 132#L831true, 37#P1EXITtrue, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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)))), 34#L818true, 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:45,652 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,652 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,652 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,652 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][254], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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)))), 118#L811true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 245#(= ~x~0 1), P1Thread1of1ForFork0InUse, 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 159#true, 252#(= ~y~0 1), Black: 231#(and (not (= ~z~0 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: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:45,653 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,653 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,653 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,653 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][242], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), P1Thread1of1ForFork0InUse, 132#L831true, 37#P1EXITtrue, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), 267#true, Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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)))), 34#L818true, 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:45,653 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,653 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,654 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,654 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,654 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][269], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 254#(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: 256#(and (= ~y~0 1) (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)))), 118#L811true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 245#(= ~x~0 1), P1Thread1of1ForFork0InUse, 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 159#true, 252#(= ~y~0 1), Black: 231#(and (not (= ~z~0 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: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), 267#true, Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:45,654 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,654 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,654 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:45,654 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:47,063 INFO L130 PetriNetUnfolder]: 21643/34105 cut-off events. [2023-08-31 23:08:47,063 INFO L131 PetriNetUnfolder]: For 183928/188935 co-relation queries the response was YES. [2023-08-31 23:08:47,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151182 conditions, 34105 events. 21643/34105 cut-off events. For 183928/188935 co-relation queries the response was YES. Maximal size of possible extension queue 1984. Compared 272094 event pairs, 1404 based on Foata normal form. 4912/37871 useless extension candidates. Maximal degree in co-relation 151155. Up to 12984 conditions per place. [2023-08-31 23:08:47,215 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 245 selfloop transitions, 10 changer transitions 16/329 dead transitions. [2023-08-31 23:08:47,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 329 transitions, 3695 flow [2023-08-31 23:08:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:08:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:08:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-31 23:08:47,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48321678321678324 [2023-08-31 23:08:47,217 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-31 23:08:47,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-31 23:08:47,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:47,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-31 23:08:47,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 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-08-31 23:08:47,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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-08-31 23:08:47,221 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 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-08-31 23:08:47,221 INFO L175 Difference]: Start difference. First operand has 88 places, 155 transitions, 1686 flow. Second operand 5 states and 691 transitions. [2023-08-31 23:08:47,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 329 transitions, 3695 flow [2023-08-31 23:08:47,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 329 transitions, 3695 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:08:47,322 INFO L231 Difference]: Finished difference. Result has 94 places, 153 transitions, 1689 flow [2023-08-31 23:08:47,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1679, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1689, PETRI_PLACES=94, PETRI_TRANSITIONS=153} [2023-08-31 23:08:47,323 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2023-08-31 23:08:47,323 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 153 transitions, 1689 flow [2023-08-31 23:08:47,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 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-08-31 23:08:47,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:47,324 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-08-31 23:08:47,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:08:47,324 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:47,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1372910087, now seen corresponding path program 1 times [2023-08-31 23:08:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715633610] [2023-08-31 23:08:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715633610] [2023-08-31 23:08:47,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715633610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:47,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:47,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:08:47,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932512382] [2023-08-31 23:08:47,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:47,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:08:47,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:47,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:08:47,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:08:47,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 286 [2023-08-31 23:08:47,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 153 transitions, 1689 flow. Second operand has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 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-08-31 23:08:47,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:47,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 286 [2023-08-31 23:08:47,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:53,538 INFO L130 PetriNetUnfolder]: 34292/52528 cut-off events. [2023-08-31 23:08:53,538 INFO L131 PetriNetUnfolder]: For 305924/305924 co-relation queries the response was YES. [2023-08-31 23:08:53,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277288 conditions, 52528 events. 34292/52528 cut-off events. For 305924/305924 co-relation queries the response was YES. Maximal size of possible extension queue 2383. Compared 402443 event pairs, 5746 based on Foata normal form. 115/52643 useless extension candidates. Maximal degree in co-relation 277258. Up to 25184 conditions per place. [2023-08-31 23:08:53,828 INFO L137 encePairwiseOnDemand]: 276/286 looper letters, 128 selfloop transitions, 70 changer transitions 67/265 dead transitions. [2023-08-31 23:08:53,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 265 transitions, 3242 flow [2023-08-31 23:08:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:08:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:08:53,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 793 transitions. [2023-08-31 23:08:53,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2023-08-31 23:08:53,831 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 793 transitions. [2023-08-31 23:08:53,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 793 transitions. [2023-08-31 23:08:53,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:53,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 793 transitions. [2023-08-31 23:08:53,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 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-08-31 23:08:53,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:53,837 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:53,837 INFO L175 Difference]: Start difference. First operand has 94 places, 153 transitions, 1689 flow. Second operand 6 states and 793 transitions. [2023-08-31 23:08:53,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 265 transitions, 3242 flow [2023-08-31 23:08:54,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 265 transitions, 3014 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-08-31 23:08:54,285 INFO L231 Difference]: Finished difference. Result has 95 places, 137 transitions, 1515 flow [2023-08-31 23:08:54,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1515, PETRI_PLACES=95, PETRI_TRANSITIONS=137} [2023-08-31 23:08:54,285 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2023-08-31 23:08:54,286 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 137 transitions, 1515 flow [2023-08-31 23:08:54,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 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-08-31 23:08:54,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:54,286 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] [2023-08-31 23:08:54,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:08:54,287 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:54,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:54,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1731914855, now seen corresponding path program 1 times [2023-08-31 23:08:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:54,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073792447] [2023-08-31 23:08:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:54,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073792447] [2023-08-31 23:08:54,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073792447] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:54,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:54,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:08:54,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480793023] [2023-08-31 23:08:54,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:54,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:08:54,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:54,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:08:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:08:54,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-31 23:08:54,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 137 transitions, 1515 flow. Second operand has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 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-08-31 23:08:54,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:54,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-31 23:08:54,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:08:55,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][121], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 275#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 87#L878-3true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 204#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 281#(= ~z~0 1), Black: 288#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 36#L808true, 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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 (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 301#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 182#(= ~x~0 0), Black: 246#(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))), 64#L775true]) [2023-08-31 23:08:55,844 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:08:55,844 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:08:55,844 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:08:55,844 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:08:56,106 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][193], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 87#L878-3true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 275#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 204#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 281#(= ~z~0 1), Black: 288#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 36#L808true, 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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 (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), 85#P0EXITtrue, 303#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:56,106 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:08:56,106 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:08:56,106 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:08:56,106 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:08:56,277 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][167], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 288#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 87#L878-3true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 275#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 245#(= ~x~0 1), P1Thread1of1ForFork0InUse, 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 204#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 132#L831true, 37#P1EXITtrue, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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)))), 34#L818true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 303#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:56,277 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,277 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,277 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,277 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,278 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][210], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 288#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 118#L811true, 87#L878-3true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 275#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 245#(= ~x~0 1), P1Thread1of1ForFork0InUse, 204#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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 (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 303#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 85#P0EXITtrue, 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:56,278 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,278 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,278 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,278 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,389 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][193], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 275#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, 245#(= ~x~0 1), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 281#(= ~z~0 1), Black: 288#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 36#L808true, 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 85#P0EXITtrue, 303#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:56,389 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,389 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,389 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,389 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:08:56,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([428] L811-->L818: Formula: (let ((.cse0 (not (= 0 (mod v_~a$r_buff1_thd3~0_16 256)))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_85 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_20 256) 0)))) (let ((.cse2 (and (not (= (mod v_~a$w_buff0_used~0_86 256) 0)) .cse5)) (.cse4 (and .cse1 .cse5)) (.cse3 (and (not (= (mod v_~a$w_buff1_used~0_73 256) 0)) .cse0))) (and (= (ite (or (and .cse0 (not (= (mod v_~a$w_buff1_used~0_72 256) 0))) (and .cse1 (not (= (mod v_~a$r_buff0_thd3~0_19 256) 0)))) 0 v_~a$r_buff1_thd3~0_16) v_~a$r_buff1_thd3~0_15) (= v_~a~0_38 (ite .cse2 v_~a$w_buff0~0_26 (ite .cse3 v_~a$w_buff1~0_31 v_~a~0_39))) (= v_~a$w_buff0_used~0_85 (ite .cse2 0 v_~a$w_buff0_used~0_86)) (= v_~a$r_buff0_thd3~0_19 (ite .cse4 0 v_~a$r_buff0_thd3~0_20)) (= (ite (or .cse4 .cse3) 0 v_~a$w_buff1_used~0_73) v_~a$w_buff1_used~0_72)))) InVars {~a~0=v_~a~0_39, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_16, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_86, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73} OutVars{~a~0=v_~a~0_38, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_15, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_85, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_19, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_72} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][167], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 288#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 275#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 245#(= ~x~0 1), P1Thread1of1ForFork0InUse, 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 132#L831true, 37#P1EXITtrue, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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)))), 116#L881true, 34#L818true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 85#P0EXITtrue, 303#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:56,723 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:08:56,723 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:56,723 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:56,723 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:56,724 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([435] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][210], [Black: 189#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), Black: 190#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 288#(and (= ~z~0 1) (= ~__unbuffered_p2_EBX~0 1)), Black: 250#true, Black: 259#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 118#L811true, Black: 206#(and (= ~__unbuffered_cnt~0 0) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 271#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), Black: 275#(and (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 245#(= ~x~0 1), P1Thread1of1ForFork0InUse, 37#P1EXITtrue, 77#L847true, Black: 225#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 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))) (= ~a$r_buff0_thd1~0 1)), Black: 220#(and (= ~a$w_buff0_used~0 1) (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))) (= ~a$r_buff0_thd1~0 1)), Black: 168#(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))), 159#true, Black: 231#(and (not (= ~z~0 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)))), 252#(= ~y~0 1), Black: 229#(and (= ~a$w_buff0_used~0 1) (not (= ~z~0 0)) (= ~a$r_buff0_thd1~0 1)), Black: 215#(not (= ~z~0 0)), Black: 218#(and (= ~a$w_buff0_used~0 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: 223#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 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)))), 116#L881true, Black: 212#(and (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 177#(and (not (= ~__unbuffered_p3_EAX~0 1)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), 227#(and (= ~a$w_buff0_used~0 0) (not (= ~z~0 0))), 85#P0EXITtrue, 303#(and (<= ~__unbuffered_cnt~0 2) (= (+ (* (div (+ (* (- 256) (div ~main$tmp_guard0~0 256)) ~main$tmp_guard0~0) 4294967296) 4294967296) (* (div ~main$tmp_guard0~0 256) 256)) ~main$tmp_guard0~0) (<= 0 ~main$tmp_guard0~0)), 199#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), Black: 182#(= ~x~0 0), Black: 246#(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)))]) [2023-08-31 23:08:56,724 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:08:56,724 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:56,724 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:56,724 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:08:57,612 INFO L130 PetriNetUnfolder]: 14640/24397 cut-off events. [2023-08-31 23:08:57,612 INFO L131 PetriNetUnfolder]: For 139815/142376 co-relation queries the response was YES. [2023-08-31 23:08:57,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118280 conditions, 24397 events. 14640/24397 cut-off events. For 139815/142376 co-relation queries the response was YES. Maximal size of possible extension queue 1405. Compared 200639 event pairs, 1328 based on Foata normal form. 2285/26080 useless extension candidates. Maximal degree in co-relation 118251. Up to 9220 conditions per place. [2023-08-31 23:08:57,735 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 185 selfloop transitions, 14 changer transitions 50/284 dead transitions. [2023-08-31 23:08:57,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 284 transitions, 3206 flow [2023-08-31 23:08:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:08:57,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:08:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2023-08-31 23:08:57,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831002331002331 [2023-08-31 23:08:57,738 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2023-08-31 23:08:57,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2023-08-31 23:08:57,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:08:57,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2023-08-31 23:08:57,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 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-08-31 23:08:57,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:57,743 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 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-08-31 23:08:57,743 INFO L175 Difference]: Start difference. First operand has 95 places, 137 transitions, 1515 flow. Second operand 6 states and 829 transitions. [2023-08-31 23:08:57,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 284 transitions, 3206 flow [2023-08-31 23:08:58,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 284 transitions, 3090 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-31 23:08:58,971 INFO L231 Difference]: Finished difference. Result has 97 places, 116 transitions, 1164 flow [2023-08-31 23:08:58,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1164, PETRI_PLACES=97, PETRI_TRANSITIONS=116} [2023-08-31 23:08:58,972 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2023-08-31 23:08:58,972 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 116 transitions, 1164 flow [2023-08-31 23:08:58,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 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-08-31 23:08:58,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:08:58,973 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] [2023-08-31 23:08:58,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:08:58,973 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:08:58,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:08:58,974 INFO L85 PathProgramCache]: Analyzing trace with hash 379032511, now seen corresponding path program 1 times [2023-08-31 23:08:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:08:58,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815595765] [2023-08-31 23:08:58,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:08:58,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:08:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:08:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:08:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:08:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815595765] [2023-08-31 23:08:59,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815595765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:08:59,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:08:59,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:08:59,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008375367] [2023-08-31 23:08:59,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:08:59,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:08:59,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:08:59,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:08:59,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:08:59,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 286 [2023-08-31 23:08:59,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 116 transitions, 1164 flow. Second operand has 7 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-08-31 23:08:59,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:08:59,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 286 [2023-08-31 23:08:59,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:01,124 INFO L130 PetriNetUnfolder]: 9530/16106 cut-off events. [2023-08-31 23:09:01,124 INFO L131 PetriNetUnfolder]: For 81095/82443 co-relation queries the response was YES. [2023-08-31 23:09:01,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81738 conditions, 16106 events. 9530/16106 cut-off events. For 81095/82443 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 126961 event pairs, 1000 based on Foata normal form. 455/16167 useless extension candidates. Maximal degree in co-relation 81709. Up to 5572 conditions per place. [2023-08-31 23:09:01,185 INFO L137 encePairwiseOnDemand]: 279/286 looper letters, 73 selfloop transitions, 18 changer transitions 131/228 dead transitions. [2023-08-31 23:09:01,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 228 transitions, 2455 flow [2023-08-31 23:09:01,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:09:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:09:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2023-08-31 23:09:01,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4695304695304695 [2023-08-31 23:09:01,187 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2023-08-31 23:09:01,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2023-08-31 23:09:01,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:01,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2023-08-31 23:09:01,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 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-08-31 23:09:01,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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-08-31 23:09:01,195 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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-08-31 23:09:01,195 INFO L175 Difference]: Start difference. First operand has 97 places, 116 transitions, 1164 flow. Second operand 7 states and 940 transitions. [2023-08-31 23:09:01,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 228 transitions, 2455 flow [2023-08-31 23:09:01,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 228 transitions, 2305 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-08-31 23:09:01,736 INFO L231 Difference]: Finished difference. Result has 98 places, 56 transitions, 443 flow [2023-08-31 23:09:01,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=443, PETRI_PLACES=98, PETRI_TRANSITIONS=56} [2023-08-31 23:09:01,736 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 45 predicate places. [2023-08-31 23:09:01,736 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 56 transitions, 443 flow [2023-08-31 23:09:01,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 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-08-31 23:09:01,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:01,737 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] [2023-08-31 23:09:01,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:09:01,737 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:01,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1174412713, now seen corresponding path program 1 times [2023-08-31 23:09:01,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:01,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527080060] [2023-08-31 23:09:01,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:02,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:02,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527080060] [2023-08-31 23:09:02,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527080060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:02,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:02,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:09:02,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467425194] [2023-08-31 23:09:02,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:02,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:09:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:09:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:09:02,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 286 [2023-08-31 23:09:02,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 56 transitions, 443 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 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-08-31 23:09:02,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:02,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 286 [2023-08-31 23:09:02,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:03,417 INFO L130 PetriNetUnfolder]: 1649/2869 cut-off events. [2023-08-31 23:09:03,417 INFO L131 PetriNetUnfolder]: For 11669/11735 co-relation queries the response was YES. [2023-08-31 23:09:03,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13830 conditions, 2869 events. 1649/2869 cut-off events. For 11669/11735 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 16429 event pairs, 334 based on Foata normal form. 3/2795 useless extension candidates. Maximal degree in co-relation 13801. Up to 1468 conditions per place. [2023-08-31 23:09:03,430 INFO L137 encePairwiseOnDemand]: 280/286 looper letters, 57 selfloop transitions, 4 changer transitions 41/108 dead transitions. [2023-08-31 23:09:03,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 108 transitions, 1043 flow [2023-08-31 23:09:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:09:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:09:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 933 transitions. [2023-08-31 23:09:03,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466033966033966 [2023-08-31 23:09:03,433 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 933 transitions. [2023-08-31 23:09:03,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 933 transitions. [2023-08-31 23:09:03,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:03,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 933 transitions. [2023-08-31 23:09:03,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 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-08-31 23:09:03,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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-08-31 23:09:03,438 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 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-08-31 23:09:03,439 INFO L175 Difference]: Start difference. First operand has 98 places, 56 transitions, 443 flow. Second operand 7 states and 933 transitions. [2023-08-31 23:09:03,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 108 transitions, 1043 flow [2023-08-31 23:09:03,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 108 transitions, 849 flow, removed 38 selfloop flow, removed 18 redundant places. [2023-08-31 23:09:03,479 INFO L231 Difference]: Finished difference. Result has 80 places, 49 transitions, 312 flow [2023-08-31 23:09:03,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=80, PETRI_TRANSITIONS=49} [2023-08-31 23:09:03,480 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2023-08-31 23:09:03,480 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 49 transitions, 312 flow [2023-08-31 23:09:03,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 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-08-31 23:09:03,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:03,482 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] [2023-08-31 23:09:03,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:09:03,482 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:03,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash 644850267, now seen corresponding path program 2 times [2023-08-31 23:09:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142431977] [2023-08-31 23:09:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:09:03,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:09:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:09:03,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:09:03,677 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:09:03,678 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:09:03,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:09:03,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:09:03,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:09:03,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:09:03,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:09:03,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:09:03,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:09:03,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:09:03,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:09:03,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:09:03,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:09:03,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:09:03,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:09:03,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:09:03,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:09:03,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:09:03,682 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:03,687 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:09:03,688 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:09:03,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:09:03 BasicIcfg [2023-08-31 23:09:03,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:09:03,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:09:03,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:09:03,787 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:09:03,788 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:08:06" (3/4) ... [2023-08-31 23:09:03,798 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:09:03,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:09:03,798 INFO L158 Benchmark]: Toolchain (without parser) took 58816.00ms. Allocated memory was 75.5MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 52.0MB in the beginning and 8.5GB in the end (delta: -8.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-08-31 23:09:03,799 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:09:03,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.94ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 47.3MB in the end (delta: 4.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2023-08-31 23:09:03,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.76ms. Allocated memory is still 75.5MB. Free memory was 47.3MB in the beginning and 44.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:09:03,799 INFO L158 Benchmark]: Boogie Preprocessor took 54.14ms. Allocated memory is still 75.5MB. Free memory was 44.9MB in the beginning and 42.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:09:03,799 INFO L158 Benchmark]: RCFGBuilder took 746.16ms. Allocated memory is still 75.5MB. Free memory was 42.8MB in the beginning and 47.7MB in the end (delta: -4.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-08-31 23:09:03,799 INFO L158 Benchmark]: TraceAbstraction took 57279.32ms. Allocated memory was 75.5MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 47.3MB in the beginning and 8.5GB in the end (delta: -8.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-08-31 23:09:03,800 INFO L158 Benchmark]: Witness Printer took 10.79ms. Allocated memory is still 10.8GB. Free memory is still 8.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:09:03,800 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.17ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 1.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.94ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 47.3MB in the end (delta: 4.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.76ms. Allocated memory is still 75.5MB. Free memory was 47.3MB in the beginning and 44.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.14ms. Allocated memory is still 75.5MB. Free memory was 44.9MB in the beginning and 42.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 746.16ms. Allocated memory is still 75.5MB. Free memory was 42.8MB in the beginning and 47.7MB in the end (delta: -4.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 57279.32ms. Allocated memory was 75.5MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 47.3MB in the beginning and 8.5GB in the end (delta: -8.5GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 10.79ms. Allocated memory is still 10.8GB. Free memory is still 8.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 152 PlacesBefore, 53 PlacesAfterwards, 141 TransitionsBefore, 40 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 55 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 141 TotalNumberOfCompositions, 10753 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4569, independent: 4315, independent conditional: 0, independent unconditional: 4315, dependent: 254, dependent conditional: 0, dependent unconditional: 254, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1938, independent: 1875, independent conditional: 0, independent unconditional: 1875, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4569, independent: 2440, independent conditional: 0, independent unconditional: 2440, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 1938, unknown conditional: 0, unknown unconditional: 1938] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 202, Positive conditional cache size: 0, Positive unconditional cache size: 202, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible 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 a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t121, ((void *)0), P0, ((void *)0))=-3, t121={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t122, ((void *)0), P1, ((void *)0))=-2, t121={5:0}, t122={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t123; [L876] FCALL, FORK 0 pthread_create(&t123, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t123, ((void *)0), P2, ((void *)0))=-1, t121={5:0}, t122={6:0}, t123={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t124; [L878] FCALL, FORK 0 pthread_create(&t124, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t124, ((void *)0), P3, ((void *)0))=0, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=0, y=0, z=0] [L767] 1 x = 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=1, y=0, z=0] [L784] 2 x = 2 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=0, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=1, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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$$choice2=1, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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, t121={5:0}, t122={6:0}, t123={7:0}, t124={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L891] 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) [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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=1, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 878]: 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: 876]: 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: 874]: 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, 183 locations, 16 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: 57.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 46.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1390 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1116 mSDsluCounter, 467 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 325 mSDsCounter, 160 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3357 IncrementalHoareTripleChecker+Invalid, 3517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 160 mSolverCounterUnsat, 142 mSDtfsCounter, 3357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1689occurred in iteration=12, InterpolantAutomatonStates: 87, 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, 4.8s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 2767 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 could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:09:03,819 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 --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-08-31 23:09:06,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:09:06,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:09:06,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:09:06,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:09:06,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:09:06,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:09:06,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:09:06,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:09:06,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:09:06,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:09:06,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:09:06,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:09:06,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:09:06,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:09:06,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:09:06,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:09:06,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:09:06,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:09:06,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:09:06,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:09:06,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:09:06,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:09:06,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:09:06,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:09:06,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:09:06,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:09:06,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:09:06,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:09:06,121 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:09:06,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:09:06,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:09:06,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:09:06,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:09:06,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:09:06,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:09:06,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:09:06,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:09:06,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:09:06,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:09:06,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:09:06,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:09:06,179 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:09:06,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:09:06,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:09:06,180 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:09:06,181 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:09:06,181 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:09:06,182 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:09:06,182 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:09:06,182 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:09:06,182 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:09:06,183 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:09:06,183 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:09:06,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:09:06,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:09:06,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:09:06,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:09:06,184 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:09:06,184 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:09:06,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:09:06,185 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:09:06,185 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:09:06,185 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:09:06,185 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:09:06,185 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:09:06,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:09:06,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:09:06,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:09:06,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:09:06,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:09:06,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:09:06,187 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:09:06,187 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:09:06,187 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:09:06,187 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:09:06,188 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:09:06,188 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:09:06,188 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:09:06,188 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 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-08-31 23:09:06,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:09:06,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:09:06,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:09:06,502 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:09:06,503 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:09:06,504 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:09:07,708 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:09:07,987 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:09:07,988 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:09:07,998 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f346afdc/c7955fbeaed849afb8b5fe45c30f7120/FLAG69fc88434 [2023-08-31 23:09:08,011 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f346afdc/c7955fbeaed849afb8b5fe45c30f7120 [2023-08-31 23:09:08,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:09:08,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:09:08,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:09:08,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:09:08,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:09:08,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f19452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08, skipping insertion in model container [2023-08-31 23:09:08,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:09:08,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:09:08,186 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_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:09:08,391 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:09:08,408 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:09:08,420 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_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:09:08,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:09:08,521 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:09:08,522 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:09:08,527 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:09:08,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08 WrapperNode [2023-08-31 23:09:08,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:09:08,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:09:08,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:09:08,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:09:08,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,590 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-31 23:09:08,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:09:08,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:09:08,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:09:08,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:09:08,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,652 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:09:08,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:09:08,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:09:08,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:09:08,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (1/1) ... [2023-08-31 23:09:08,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:09:08,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:09:08,692 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-08-31 23:09:08,720 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-08-31 23:09:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:09:08,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:09:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:09:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:09:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:09:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:09:08,742 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:09:08,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:09:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:09:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:09:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:09:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:09:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:09:08,743 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:09:08,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:09:08,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:09:08,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:09:08,745 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:09:08,946 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:09:08,951 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:09:09,334 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:09:09,467 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:09:09,467 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:09:09,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:09:09 BoogieIcfgContainer [2023-08-31 23:09:09,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:09:09,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:09:09,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:09:09,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:09:09,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:09:08" (1/3) ... [2023-08-31 23:09:09,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad073f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:09:09, skipping insertion in model container [2023-08-31 23:09:09,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:08" (2/3) ... [2023-08-31 23:09:09,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ad073f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:09:09, skipping insertion in model container [2023-08-31 23:09:09,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:09:09" (3/3) ... [2023-08-31 23:09:09,477 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:09:09,492 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:09:09,493 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:09:09,494 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:09:09,566 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:09:09,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-31 23:09:09,673 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-31 23:09:09,673 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:09,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:09:09,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-31 23:09:09,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-31 23:09:09,689 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:09:09,701 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-31 23:09:09,704 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-31 23:09:09,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-31 23:09:09,748 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-31 23:09:09,749 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:09,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-31 23:09:09,753 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-08-31 23:09:16,799 INFO L134 LiptonReduction]: Checked pairs total: 10768 [2023-08-31 23:09:16,799 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-31 23:09:16,810 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:09:16,816 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@30e14ba7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:09:16,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:09:16,818 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:09:16,818 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:16,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:16,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:09:16,819 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:16,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash 616, now seen corresponding path program 1 times [2023-08-31 23:09:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799183318] [2023-08-31 23:09:16,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:16,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:16,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:16,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:16,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:09:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:16,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:09:16,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:16,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:16,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:16,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799183318] [2023-08-31 23:09:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799183318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:16,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:09:16,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993979246] [2023-08-31 23:09:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:16,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:09:16,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:16,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:09:16,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:09:16,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 282 [2023-08-31 23:09:16,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 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-08-31 23:09:16,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:16,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 282 [2023-08-31 23:09:16,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:18,325 INFO L130 PetriNetUnfolder]: 7479/10219 cut-off events. [2023-08-31 23:09:18,326 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-31 23:09:18,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20527 conditions, 10219 events. 7479/10219 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 54132 event pairs, 7479 based on Foata normal form. 0/8770 useless extension candidates. Maximal degree in co-relation 20515. Up to 10091 conditions per place. [2023-08-31 23:09:18,390 INFO L137 encePairwiseOnDemand]: 274/282 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-31 23:09:18,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-31 23:09:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:09:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:09:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions. [2023-08-31 23:09:18,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526595744680851 [2023-08-31 23:09:18,402 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 297 transitions. [2023-08-31 23:09:18,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions. [2023-08-31 23:09:18,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:18,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions. [2023-08-31 23:09:18,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 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-08-31 23:09:18,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-08-31 23:09:18,433 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-08-31 23:09:18,435 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 2 states and 297 transitions. [2023-08-31 23:09:18,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-31 23:09:18,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:09:18,444 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-31 23:09:18,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-31 23:09:18,449 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-31 23:09:18,449 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-31 23:09:18,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 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-08-31 23:09:18,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:18,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:09:18,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:18,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:18,668 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:18,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash 605362, now seen corresponding path program 1 times [2023-08-31 23:09:18,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:18,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279348959] [2023-08-31 23:09:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:18,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:18,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:18,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:18,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:09:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:18,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:09:18,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:18,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:18,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:18,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279348959] [2023-08-31 23:09:18,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279348959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:18,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:09:18,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340880050] [2023-08-31 23:09:18,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:18,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:09:18,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:18,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:09:18,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:09:18,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 282 [2023-08-31 23:09:18,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-08-31 23:09:18,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:18,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 282 [2023-08-31 23:09:18,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:19,697 INFO L130 PetriNetUnfolder]: 5879/8516 cut-off events. [2023-08-31 23:09:19,698 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:19,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16657 conditions, 8516 events. 5879/8516 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 52833 event pairs, 1079 based on Foata normal form. 0/7846 useless extension candidates. Maximal degree in co-relation 16654. Up to 6367 conditions per place. [2023-08-31 23:09:19,742 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-31 23:09:19,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 212 flow [2023-08-31 23:09:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:09:19,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:09:19,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-08-31 23:09:19,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2023-08-31 23:09:19,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-08-31 23:09:19,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-08-31 23:09:19,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:19,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-08-31 23:09:19,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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-08-31 23:09:19,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 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-08-31 23:09:19,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 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-08-31 23:09:19,752 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 438 transitions. [2023-08-31 23:09:19,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 212 flow [2023-08-31 23:09:19,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:09:19,753 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-31 23:09:19,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=43, PETRI_TRANSITIONS=30} [2023-08-31 23:09:19,754 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-31 23:09:19,754 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-31 23:09:19,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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-08-31 23:09:19,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:19,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:19,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:19,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:19,964 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:19,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:19,965 INFO L85 PathProgramCache]: Analyzing trace with hash 905946260, now seen corresponding path program 1 times [2023-08-31 23:09:19,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:19,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887093696] [2023-08-31 23:09:19,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:19,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:19,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:19,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:19,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:09:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:20,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:09:20,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:20,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:20,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:20,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887093696] [2023-08-31 23:09:20,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887093696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:20,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:20,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:20,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296624650] [2023-08-31 23:09:20,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:20,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:09:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:20,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:09:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:09:20,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-31 23:09:20,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 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-08-31 23:09:20,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:20,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-31 23:09:20,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:20,942 INFO L130 PetriNetUnfolder]: 3939/5667 cut-off events. [2023-08-31 23:09:20,942 INFO L131 PetriNetUnfolder]: For 377/377 co-relation queries the response was YES. [2023-08-31 23:09:20,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11816 conditions, 5667 events. 3939/5667 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 31581 event pairs, 655 based on Foata normal form. 320/5704 useless extension candidates. Maximal degree in co-relation 11812. Up to 3025 conditions per place. [2023-08-31 23:09:20,963 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 51 selfloop transitions, 6 changer transitions 1/63 dead transitions. [2023-08-31 23:09:20,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 264 flow [2023-08-31 23:09:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:09:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:09:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-31 23:09:20,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4929078014184397 [2023-08-31 23:09:20,966 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-31 23:09:20,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-31 23:09:20,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:20,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-31 23:09:20,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 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-08-31 23:09:20,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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-08-31 23:09:20,972 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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-08-31 23:09:20,972 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 4 states and 556 transitions. [2023-08-31 23:09:20,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 264 flow [2023-08-31 23:09:20,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:09:20,973 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 110 flow [2023-08-31 23:09:20,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=68, 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=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-31 23:09:20,974 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-08-31 23:09:20,975 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 110 flow [2023-08-31 23:09:20,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 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-08-31 23:09:20,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:20,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:20,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:21,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:21,188 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:21,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:21,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2136442944, now seen corresponding path program 1 times [2023-08-31 23:09:21,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:21,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297888575] [2023-08-31 23:09:21,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:21,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:21,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:21,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:21,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:09:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:21,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:09:21,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:21,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:21,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:21,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297888575] [2023-08-31 23:09:21,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297888575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:21,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:21,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:09:21,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724151111] [2023-08-31 23:09:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:21,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:21,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:21,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:21,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:21,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-31 23:09:21,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 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-08-31 23:09:21,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:21,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-31 23:09:21,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:21,775 INFO L130 PetriNetUnfolder]: 2022/3101 cut-off events. [2023-08-31 23:09:21,775 INFO L131 PetriNetUnfolder]: For 914/914 co-relation queries the response was YES. [2023-08-31 23:09:21,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7849 conditions, 3101 events. 2022/3101 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16803 event pairs, 328 based on Foata normal form. 212/3203 useless extension candidates. Maximal degree in co-relation 7843. Up to 1044 conditions per place. [2023-08-31 23:09:21,793 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 64 selfloop transitions, 10 changer transitions 1/80 dead transitions. [2023-08-31 23:09:21,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 381 flow [2023-08-31 23:09:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:09:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:09:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-31 23:09:21,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49432624113475176 [2023-08-31 23:09:21,796 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-31 23:09:21,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-31 23:09:21,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:21,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-31 23:09:21,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 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-08-31 23:09:21,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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-08-31 23:09:21,802 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 282.0) internal successors, (1692), 6 states have internal predecessors, (1692), 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-08-31 23:09:21,802 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 110 flow. Second operand 5 states and 697 transitions. [2023-08-31 23:09:21,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 381 flow [2023-08-31 23:09:21,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 370 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:09:21,810 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 162 flow [2023-08-31 23:09:21,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-31 23:09:21,811 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2023-08-31 23:09:21,811 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 162 flow [2023-08-31 23:09:21,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 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-08-31 23:09:21,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:21,812 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-08-31 23:09:21,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:22,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:22,025 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:22,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash -993834977, now seen corresponding path program 1 times [2023-08-31 23:09:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:22,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751086000] [2023-08-31 23:09:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:22,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:22,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:22,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:22,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:09:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:22,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:09:22,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:22,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:22,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:22,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751086000] [2023-08-31 23:09:22,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751086000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:22,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:22,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:09:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114829268] [2023-08-31 23:09:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:22,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:09:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:09:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:09:22,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-31 23:09:22,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 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-08-31 23:09:22,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:22,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-31 23:09:22,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:22,606 INFO L130 PetriNetUnfolder]: 1176/1868 cut-off events. [2023-08-31 23:09:22,606 INFO L131 PetriNetUnfolder]: For 1577/1577 co-relation queries the response was YES. [2023-08-31 23:09:22,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5364 conditions, 1868 events. 1176/1868 cut-off events. For 1577/1577 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9471 event pairs, 326 based on Foata normal form. 77/1898 useless extension candidates. Maximal degree in co-relation 5357. Up to 630 conditions per place. [2023-08-31 23:09:22,615 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 75 selfloop transitions, 14 changer transitions 1/95 dead transitions. [2023-08-31 23:09:22,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 504 flow [2023-08-31 23:09:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:09:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:09:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 836 transitions. [2023-08-31 23:09:22,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940898345153664 [2023-08-31 23:09:22,619 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 836 transitions. [2023-08-31 23:09:22,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 836 transitions. [2023-08-31 23:09:22,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:22,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 836 transitions. [2023-08-31 23:09:22,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.33333333333334) internal successors, (836), 6 states have internal predecessors, (836), 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-08-31 23:09:22,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 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-08-31 23:09:22,625 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 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-08-31 23:09:22,626 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 162 flow. Second operand 6 states and 836 transitions. [2023-08-31 23:09:22,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 504 flow [2023-08-31 23:09:22,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 474 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-31 23:09:22,639 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 212 flow [2023-08-31 23:09:22,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-31 23:09:22,639 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-31 23:09:22,640 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 212 flow [2023-08-31 23:09:22,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 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-08-31 23:09:22,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:22,640 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] [2023-08-31 23:09:22,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:22,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:22,856 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:22,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:22,856 INFO L85 PathProgramCache]: Analyzing trace with hash -297625320, now seen corresponding path program 1 times [2023-08-31 23:09:22,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:22,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863993444] [2023-08-31 23:09:22,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:22,857 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:22,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:22,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:22,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:09:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:22,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:09:22,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:23,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:23,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863993444] [2023-08-31 23:09:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863993444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:23,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:09:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449692895] [2023-08-31 23:09:23,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:23,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:09:23,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:23,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:09:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:09:23,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 282 [2023-08-31 23:09:23,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 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-08-31 23:09:23,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:23,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 282 [2023-08-31 23:09:23,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:23,464 INFO L130 PetriNetUnfolder]: 1011/1588 cut-off events. [2023-08-31 23:09:23,464 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2023-08-31 23:09:23,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 1588 events. 1011/1588 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7865 event pairs, 326 based on Foata normal form. 14/1568 useless extension candidates. Maximal degree in co-relation 4621. Up to 630 conditions per place. [2023-08-31 23:09:23,473 INFO L137 encePairwiseOnDemand]: 275/282 looper letters, 58 selfloop transitions, 18 changer transitions 1/82 dead transitions. [2023-08-31 23:09:23,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 462 flow [2023-08-31 23:09:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:09:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:09:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2023-08-31 23:09:23,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797365754812563 [2023-08-31 23:09:23,477 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2023-08-31 23:09:23,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2023-08-31 23:09:23,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:23,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2023-08-31 23:09:23,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 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-08-31 23:09:23,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 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-08-31 23:09:23,483 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 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-08-31 23:09:23,483 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 212 flow. Second operand 7 states and 947 transitions. [2023-08-31 23:09:23,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 462 flow [2023-08-31 23:09:23,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 416 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-31 23:09:23,497 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 222 flow [2023-08-31 23:09:23,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-31 23:09:23,498 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-31 23:09:23,498 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 222 flow [2023-08-31 23:09:23,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 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-08-31 23:09:23,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:23,499 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] [2023-08-31 23:09:23,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:23,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:23,709 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:23,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2142166973, now seen corresponding path program 1 times [2023-08-31 23:09:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:23,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918023651] [2023-08-31 23:09:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:23,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:23,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:23,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:23,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:09:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:23,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:09:23,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:24,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:24,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918023651] [2023-08-31 23:09:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918023651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:09:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017052703] [2023-08-31 23:09:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:24,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:09:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:24,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:09:24,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:09:24,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 282 [2023-08-31 23:09:24,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 222 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 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-08-31 23:09:24,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:24,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 282 [2023-08-31 23:09:24,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:24,760 INFO L130 PetriNetUnfolder]: 1159/1899 cut-off events. [2023-08-31 23:09:24,760 INFO L131 PetriNetUnfolder]: For 2145/2145 co-relation queries the response was YES. [2023-08-31 23:09:24,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 1899 events. 1159/1899 cut-off events. For 2145/2145 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10408 event pairs, 145 based on Foata normal form. 0/1883 useless extension candidates. Maximal degree in co-relation 5490. Up to 773 conditions per place. [2023-08-31 23:09:24,771 INFO L137 encePairwiseOnDemand]: 276/282 looper letters, 99 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2023-08-31 23:09:24,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 110 transitions, 814 flow [2023-08-31 23:09:24,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:09:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:09:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 945 transitions. [2023-08-31 23:09:24,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4787234042553192 [2023-08-31 23:09:24,775 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 945 transitions. [2023-08-31 23:09:24,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 945 transitions. [2023-08-31 23:09:24,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:24,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 945 transitions. [2023-08-31 23:09:24,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 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-08-31 23:09:24,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 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-08-31 23:09:24,781 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 282.0) internal successors, (2256), 8 states have internal predecessors, (2256), 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-08-31 23:09:24,782 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 222 flow. Second operand 7 states and 945 transitions. [2023-08-31 23:09:24,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 110 transitions, 814 flow [2023-08-31 23:09:24,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 110 transitions, 548 flow, removed 34 selfloop flow, removed 11 redundant places. [2023-08-31 23:09:24,793 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 148 flow [2023-08-31 23:09:24,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-31 23:09:24,794 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-31 23:09:24,794 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 148 flow [2023-08-31 23:09:24,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 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-08-31 23:09:24,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:24,795 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] [2023-08-31 23:09:24,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:25,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:25,005 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:25,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash 99907773, now seen corresponding path program 2 times [2023-08-31 23:09:25,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:25,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473573528] [2023-08-31 23:09:25,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:09:25,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:25,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:25,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:25,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:09:25,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:09:25,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:09:25,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:09:25,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:25,145 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:25,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473573528] [2023-08-31 23:09:25,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473573528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:25,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:25,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:09:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316201652] [2023-08-31 23:09:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:25,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:09:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:25,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:09:25,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:09:25,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 282 [2023-08-31 23:09:25,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-08-31 23:09:25,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:25,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 282 [2023-08-31 23:09:25,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:25,474 INFO L130 PetriNetUnfolder]: 2066/3255 cut-off events. [2023-08-31 23:09:25,474 INFO L131 PetriNetUnfolder]: For 1067/1067 co-relation queries the response was YES. [2023-08-31 23:09:25,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 3255 events. 2066/3255 cut-off events. For 1067/1067 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18795 event pairs, 858 based on Foata normal form. 1/3201 useless extension candidates. Maximal degree in co-relation 8085. Up to 1775 conditions per place. [2023-08-31 23:09:25,491 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 73 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-31 23:09:25,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 419 flow [2023-08-31 23:09:25,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:09:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:09:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-31 23:09:25,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-31 23:09:25,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-31 23:09:25,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-31 23:09:25,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:25,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-31 23:09:25,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-08-31 23:09:25,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 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-08-31 23:09:25,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 282.0) internal successors, (1128), 4 states have internal predecessors, (1128), 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-08-31 23:09:25,497 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 148 flow. Second operand 3 states and 432 transitions. [2023-08-31 23:09:25,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 419 flow [2023-08-31 23:09:25,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 411 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:09:25,506 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 154 flow [2023-08-31 23:09:25,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-08-31 23:09:25,507 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-31 23:09:25,508 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 154 flow [2023-08-31 23:09:25,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-08-31 23:09:25,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:25,508 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] [2023-08-31 23:09:25,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:25,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:25,718 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:25,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1874664728, now seen corresponding path program 1 times [2023-08-31 23:09:25,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:25,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031079292] [2023-08-31 23:09:25,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:25,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:25,721 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:25,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:09:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:25,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:09:25,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:26,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:26,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:26,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031079292] [2023-08-31 23:09:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031079292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:26,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:26,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:09:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971078442] [2023-08-31 23:09:26,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:26,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:09:26,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:26,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:09:26,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:09:26,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 282 [2023-08-31 23:09:26,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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-08-31 23:09:26,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:26,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 282 [2023-08-31 23:09:26,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:27,340 INFO L130 PetriNetUnfolder]: 1816/2880 cut-off events. [2023-08-31 23:09:27,341 INFO L131 PetriNetUnfolder]: For 964/964 co-relation queries the response was YES. [2023-08-31 23:09:27,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7391 conditions, 2880 events. 1816/2880 cut-off events. For 964/964 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16514 event pairs, 143 based on Foata normal form. 4/2866 useless extension candidates. Maximal degree in co-relation 7384. Up to 2389 conditions per place. [2023-08-31 23:09:27,351 INFO L137 encePairwiseOnDemand]: 277/282 looper letters, 46 selfloop transitions, 4 changer transitions 17/72 dead transitions. [2023-08-31 23:09:27,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 386 flow [2023-08-31 23:09:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:09:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:09:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-08-31 23:09:27,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4190307328605201 [2023-08-31 23:09:27,355 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-08-31 23:09:27,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-08-31 23:09:27,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:27,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-08-31 23:09:27,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 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-08-31 23:09:27,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 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-08-31 23:09:27,360 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 282.0) internal successors, (1974), 7 states have internal predecessors, (1974), 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-08-31 23:09:27,360 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 154 flow. Second operand 6 states and 709 transitions. [2023-08-31 23:09:27,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 386 flow [2023-08-31 23:09:27,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 382 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:09:27,363 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 144 flow [2023-08-31 23:09:27,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-31 23:09:27,364 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-31 23:09:27,364 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 144 flow [2023-08-31 23:09:27,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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-08-31 23:09:27,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:27,365 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] [2023-08-31 23:09:27,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-08-31 23:09:27,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:27,575 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:27,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash 537224451, now seen corresponding path program 3 times [2023-08-31 23:09:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424511962] [2023-08-31 23:09:27,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:09:27,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:27,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:27,577 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:27,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:09:27,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:09:27,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:09:27,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:09:27,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:27,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:27,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424511962] [2023-08-31 23:09:27,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424511962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:27,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:27,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606479198] [2023-08-31 23:09:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:27,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:09:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:27,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:09:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:09:27,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-31 23:09:27,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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-08-31 23:09:27,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:27,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-31 23:09:27,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:28,025 INFO L130 PetriNetUnfolder]: 1262/2184 cut-off events. [2023-08-31 23:09:28,025 INFO L131 PetriNetUnfolder]: For 720/721 co-relation queries the response was YES. [2023-08-31 23:09:28,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 2184 events. 1262/2184 cut-off events. For 720/721 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12318 event pairs, 172 based on Foata normal form. 1/2183 useless extension candidates. Maximal degree in co-relation 5353. Up to 1017 conditions per place. [2023-08-31 23:09:28,032 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 52 selfloop transitions, 1 changer transitions 29/86 dead transitions. [2023-08-31 23:09:28,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 466 flow [2023-08-31 23:09:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:09:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:09:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-08-31 23:09:28,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4973404255319149 [2023-08-31 23:09:28,036 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-08-31 23:09:28,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-08-31 23:09:28,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:28,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-08-31 23:09:28,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 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-08-31 23:09:28,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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-08-31 23:09:28,040 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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-08-31 23:09:28,040 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 144 flow. Second operand 4 states and 561 transitions. [2023-08-31 23:09:28,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 466 flow [2023-08-31 23:09:28,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 445 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-31 23:09:28,043 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 136 flow [2023-08-31 23:09:28,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-31 23:09:28,044 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-31 23:09:28,044 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 136 flow [2023-08-31 23:09:28,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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-08-31 23:09:28,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:28,045 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] [2023-08-31 23:09:28,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:28,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:28,254 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:28,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:28,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1876729905, now seen corresponding path program 4 times [2023-08-31 23:09:28,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:28,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859320453] [2023-08-31 23:09:28,255 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:09:28,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:28,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:28,256 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:28,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:09:28,385 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:09:28,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:09:28,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:09:28,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:28,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:28,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:28,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859320453] [2023-08-31 23:09:28,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859320453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:28,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:28,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:28,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013033590] [2023-08-31 23:09:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:28,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:09:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:28,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:09:28,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:09:28,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 282 [2023-08-31 23:09:28,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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-08-31 23:09:28,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:28,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 282 [2023-08-31 23:09:28,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:28,690 INFO L130 PetriNetUnfolder]: 1342/2221 cut-off events. [2023-08-31 23:09:28,690 INFO L131 PetriNetUnfolder]: For 1028/1031 co-relation queries the response was YES. [2023-08-31 23:09:28,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5385 conditions, 2221 events. 1342/2221 cut-off events. For 1028/1031 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11584 event pairs, 486 based on Foata normal form. 1/2185 useless extension candidates. Maximal degree in co-relation 5378. Up to 847 conditions per place. [2023-08-31 23:09:28,696 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 42 selfloop transitions, 1 changer transitions 35/82 dead transitions. [2023-08-31 23:09:28,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 82 transitions, 434 flow [2023-08-31 23:09:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:09:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:09:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-08-31 23:09:28,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49379432624113473 [2023-08-31 23:09:28,700 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-08-31 23:09:28,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-08-31 23:09:28,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:28,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-08-31 23:09:28,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 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-08-31 23:09:28,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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-08-31 23:09:28,704 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 282.0) internal successors, (1410), 5 states have internal predecessors, (1410), 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-08-31 23:09:28,704 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 136 flow. Second operand 4 states and 557 transitions. [2023-08-31 23:09:28,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 82 transitions, 434 flow [2023-08-31 23:09:28,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 430 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:09:28,707 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 140 flow [2023-08-31 23:09:28,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-31 23:09:28,708 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-31 23:09:28,708 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 140 flow [2023-08-31 23:09:28,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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-08-31 23:09:28,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:28,709 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] [2023-08-31 23:09:28,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:28,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:28,919 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:09:28,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash -932334271, now seen corresponding path program 5 times [2023-08-31 23:09:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654418218] [2023-08-31 23:09:28,921 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:09:28,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:28,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:28,922 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:09:28,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:09:29,057 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:09:29,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:09:29,057 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:09:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:09:29,221 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:09:29,222 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:09:29,223 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:09:29,224 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:09:29,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:09:29,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:09:29,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:09:29,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:09:29,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:09:29,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:09:29,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:09:29,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:09:29,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:09:29,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:09:29,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:09:29,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:09:29,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:09:29,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:09:29,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:09:29,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:29,441 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:29,445 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:09:29,445 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:09:29,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:09:29 BasicIcfg [2023-08-31 23:09:29,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:09:29,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:09:29,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:09:29,538 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:09:29,539 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:09:09" (3/4) ... [2023-08-31 23:09:29,541 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:09:29,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:09:29,541 INFO L158 Benchmark]: Toolchain (without parser) took 21528.25ms. Allocated memory was 100.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 77.6MB in the beginning and 736.1MB in the end (delta: -658.6MB). Peak memory consumption was 715.3MB. Max. memory is 16.1GB. [2023-08-31 23:09:29,542 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 69.2MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:09:29,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.24ms. Allocated memory is still 100.7MB. Free memory was 77.3MB in the beginning and 52.6MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-31 23:09:29,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.41ms. Allocated memory is still 100.7MB. Free memory was 52.6MB in the beginning and 49.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:09:29,543 INFO L158 Benchmark]: Boogie Preprocessor took 74.04ms. Allocated memory is still 100.7MB. Free memory was 49.9MB in the beginning and 79.0MB in the end (delta: -29.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2023-08-31 23:09:29,543 INFO L158 Benchmark]: RCFGBuilder took 804.40ms. Allocated memory is still 100.7MB. Free memory was 79.0MB in the beginning and 67.4MB in the end (delta: 11.6MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2023-08-31 23:09:29,543 INFO L158 Benchmark]: TraceAbstraction took 20066.21ms. Allocated memory was 100.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 66.8MB in the beginning and 736.1MB in the end (delta: -669.3MB). Peak memory consumption was 702.3MB. Max. memory is 16.1GB. [2023-08-31 23:09:29,544 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 1.5GB. Free memory is still 736.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:09:29,545 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.16ms. Allocated memory is still 69.2MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.24ms. Allocated memory is still 100.7MB. Free memory was 77.3MB in the beginning and 52.6MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.41ms. Allocated memory is still 100.7MB. Free memory was 52.6MB in the beginning and 49.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.04ms. Allocated memory is still 100.7MB. Free memory was 49.9MB in the beginning and 79.0MB in the end (delta: -29.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 804.40ms. Allocated memory is still 100.7MB. Free memory was 79.0MB in the beginning and 67.4MB in the end (delta: 11.6MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20066.21ms. Allocated memory was 100.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 66.8MB in the beginning and 736.1MB in the end (delta: -669.3MB). Peak memory consumption was 702.3MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 1.5GB. Free memory is still 736.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 153 PlacesBefore, 53 PlacesAfterwards, 142 TransitionsBefore, 40 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 10768 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4752, independent: 4494, independent conditional: 0, independent unconditional: 4494, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1964, independent: 1905, independent conditional: 0, independent unconditional: 1905, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4752, independent: 2589, independent conditional: 0, independent unconditional: 2589, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 1964, unknown conditional: 0, unknown unconditional: 1964] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 202, Positive conditional cache size: 0, Positive unconditional cache size: 202, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible 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 a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t121; [L872] FCALL, FORK 0 pthread_create(&t121, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t121, ((void *)0), P0, ((void *)0))=0, t121={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t122; [L874] FCALL, FORK 0 pthread_create(&t122, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t122, ((void *)0), P1, ((void *)0))=1, t121={3:0}, t122={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t123; [L784] 2 x = 2 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t123, ((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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t123, ((void *)0), P2, ((void *)0))=2, t121={3:0}, t122={7:0}, t123={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L877] 0 pthread_t t124; [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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=0] [L878] FCALL, FORK 0 pthread_create(&t124, ((void *)0), P3, ((void *)0)) 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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, pthread_create(&t124, ((void *)0), P3, ((void *)0))=3, t121={3:0}, t122={7:0}, t123={15:0}, t124={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=0] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L827] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=2, y=1, z=1] [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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$$choice2=0, x=2, y=1, z=1] [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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$$choice2=0, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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, t121={3:0}, t122={7:0}, t123={15:0}, t124={11:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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, t121={3:0}, t122={7:0}, t123={15:0}, t124={11:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 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) [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$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 872]: 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: 878]: 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: 876]: 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: 874]: 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, 184 locations, 16 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: 19.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 683 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 600 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1773 IncrementalHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 19 mSDtfsCounter, 1773 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=6, InterpolantAutomatonStates: 51, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 207 ConstructedInterpolants, 18 QuantifiedInterpolants, 2034 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1725 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:09:29,571 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 Result: UNKNOWN: Overapproximated counterexample