./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/mix018_tso.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 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:19:08,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:19:08,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:19:08,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:19:08,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:19:08,212 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:19:08,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:19:08,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:19:08,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:19:08,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:19:08,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:19:08,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:19:08,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:19:08,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:19:08,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:19:08,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:19:08,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:19:08,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:19:08,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:19:08,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:19:08,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:19:08,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:19:08,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:19:08,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:19:08,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:19:08,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:19:08,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:19:08,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:19:08,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:19:08,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:19:08,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:19:08,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:19:08,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:19:08,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:19:08,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:19:08,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:19:08,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:19:08,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:19:08,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:19:08,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:19:08,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:19:08,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:19:08,279 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:19:08,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:19:08,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:19:08,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:19:08,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:19:08,282 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:19:08,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:19:08,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:19:08,284 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:19:08,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:19:08,285 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:19:08,285 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:19:08,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:19:08,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:19:08,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:19:08,286 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:19:08,286 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:19:08,287 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:19:08,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:19:08,287 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:19:08,287 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:19:08,287 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:19:08,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:19:08,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:19:08,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:19:08,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:19:08,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:19:08,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:19:08,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:19:08,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:19:08,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:19:08,290 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:19:08,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:19:08,290 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:19:08,291 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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf 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 -> AFTER [2023-08-29 20:19:08,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:19:08,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:19:08,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:19:08,657 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:19:08,658 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:19:08,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-08-29 20:19:09,977 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:19:10,222 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:19:10,222 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-08-29 20:19:10,244 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e808ad078/823111d5d5e944da9ab57a5c8602f2cb/FLAG223ead1e9 [2023-08-29 20:19:10,269 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e808ad078/823111d5d5e944da9ab57a5c8602f2cb [2023-08-29 20:19:10,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:19:10,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:19:10,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:19:10,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:19:10,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:19:10,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120211f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10, skipping insertion in model container [2023-08-29 20:19:10,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:19:10,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:19:10,512 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/mix018_tso.oepc.i[949,962] [2023-08-29 20:19:10,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:19:10,708 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:19:10,721 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/mix018_tso.oepc.i[949,962] [2023-08-29 20:19:10,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:19:10,824 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:19:10,826 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:19:10,831 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:19:10,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10 WrapperNode [2023-08-29 20:19:10,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:19:10,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:19:10,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:19:10,833 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:19:10,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,886 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-08-29 20:19:10,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:19:10,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:19:10,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:19:10,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:19:10,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,909 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:19:10,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:19:10,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:19:10,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:19:10,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (1/1) ... [2023-08-29 20:19:10,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:19:10,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:19:10,966 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-29 20:19:10,975 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-29 20:19:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:19:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:19:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:19:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:19:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:19:11,008 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:19:11,008 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:19:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:19:11,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:19:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:19:11,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:19:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:19:11,009 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:19:11,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:19:11,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:19:11,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:19:11,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:19:11,011 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:19:11,172 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:19:11,190 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:19:11,598 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:19:11,726 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:19:11,726 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:19:11,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:11 BoogieIcfgContainer [2023-08-29 20:19:11,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:19:11,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:19:11,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:19:11,734 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:19:11,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:19:10" (1/3) ... [2023-08-29 20:19:11,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5feb5041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:19:11, skipping insertion in model container [2023-08-29 20:19:11,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:19:10" (2/3) ... [2023-08-29 20:19:11,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5feb5041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:19:11, skipping insertion in model container [2023-08-29 20:19:11,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:11" (3/3) ... [2023-08-29 20:19:11,736 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2023-08-29 20:19:11,751 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:19:11,751 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:19:11,752 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:19:11,820 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:19:11,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-29 20:19:11,940 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-29 20:19:11,941 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:11,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-29 20:19:11,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-29 20:19:11,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-29 20:19:11,955 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:19:11,965 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-29 20:19:11,967 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-29 20:19:11,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-29 20:19:11,991 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-29 20:19:11,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:11,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-29 20:19:11,995 INFO L119 LiptonReduction]: Number of co-enabled transitions 3506 [2023-08-29 20:19:16,844 INFO L134 LiptonReduction]: Checked pairs total: 11503 [2023-08-29 20:19:16,844 INFO L136 LiptonReduction]: Total number of compositions: 130 [2023-08-29 20:19:16,854 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:19:16,859 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;@2122f0da, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:19:16,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:19:16,861 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:19:16,861 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:16,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:16,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:19:16,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:16,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:16,866 INFO L85 PathProgramCache]: Analyzing trace with hash 603, now seen corresponding path program 1 times [2023-08-29 20:19:16,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:16,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751986557] [2023-08-29 20:19:16,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:16,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:16,973 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-29 20:19:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751986557] [2023-08-29 20:19:16,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751986557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:16,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:19:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281033869] [2023-08-29 20:19:16,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:16,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:19:16,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:17,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:19:17,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:19:17,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 273 [2023-08-29 20:19:17,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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-29 20:19:17,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:17,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 273 [2023-08-29 20:19:17,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:18,316 INFO L130 PetriNetUnfolder]: 7925/10838 cut-off events. [2023-08-29 20:19:18,317 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 20:19:18,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21748 conditions, 10838 events. 7925/10838 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 58006 event pairs, 7925 based on Foata normal form. 320/9386 useless extension candidates. Maximal degree in co-relation 21736. Up to 10695 conditions per place. [2023-08-29 20:19:18,389 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-29 20:19:18,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-29 20:19:18,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:19:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:19:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-29 20:19:18,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366300366300366 [2023-08-29 20:19:18,402 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-29 20:19:18,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-29 20:19:18,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:18,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-29 20:19:18,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 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-29 20:19:18,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 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-29 20:19:18,412 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 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-29 20:19:18,414 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 293 transitions. [2023-08-29 20:19:18,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-29 20:19:18,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:19:18,421 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-29 20:19:18,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-29 20:19:18,425 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-29 20:19:18,425 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-29 20:19:18,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 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-29 20:19:18,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:18,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:19:18,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:19:18,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:18,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash 569491207, now seen corresponding path program 1 times [2023-08-29 20:19:18,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667796330] [2023-08-29 20:19:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:18,749 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-29 20:19:18,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:18,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667796330] [2023-08-29 20:19:18,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667796330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:18,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:18,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:19:18,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193865472] [2023-08-29 20:19:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:18,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:19:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:18,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:19:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:19:18,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 273 [2023-08-29 20:19:18,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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-29 20:19:18,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:18,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 273 [2023-08-29 20:19:18,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:19,710 INFO L130 PetriNetUnfolder]: 6231/9030 cut-off events. [2023-08-29 20:19:19,710 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:19:19,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17651 conditions, 9030 events. 6231/9030 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 55281 event pairs, 1149 based on Foata normal form. 0/8181 useless extension candidates. Maximal degree in co-relation 17648. Up to 6739 conditions per place. [2023-08-29 20:19:19,747 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 41 selfloop transitions, 2 changer transitions 4/52 dead transitions. [2023-08-29 20:19:19,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 210 flow [2023-08-29 20:19:19,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:19:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:19:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-29 20:19:19,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-08-29 20:19:19,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-29 20:19:19,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-29 20:19:19,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:19,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-29 20:19:19,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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-29 20:19:19,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 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-29 20:19:19,756 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 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-29 20:19:19,756 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 429 transitions. [2023-08-29 20:19:19,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 210 flow [2023-08-29 20:19:19,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:19:19,757 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2023-08-29 20:19:19,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-29 20:19:19,758 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-29 20:19:19,758 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2023-08-29 20:19:19,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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-29 20:19:19,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:19,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:19,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:19:19,760 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:19,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 740399366, now seen corresponding path program 1 times [2023-08-29 20:19:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925067566] [2023-08-29 20:19:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:19,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:20,341 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-29 20:19:20,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925067566] [2023-08-29 20:19:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925067566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:20,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:20,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:20,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23106368] [2023-08-29 20:19:20,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:20,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:20,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:20,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 273 [2023-08-29 20:19:20,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 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-29 20:19:20,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:20,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 273 [2023-08-29 20:19:20,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:22,064 INFO L130 PetriNetUnfolder]: 11969/16020 cut-off events. [2023-08-29 20:19:22,065 INFO L131 PetriNetUnfolder]: For 805/805 co-relation queries the response was YES. [2023-08-29 20:19:22,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33101 conditions, 16020 events. 11969/16020 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 77964 event pairs, 2649 based on Foata normal form. 0/15619 useless extension candidates. Maximal degree in co-relation 33097. Up to 8101 conditions per place. [2023-08-29 20:19:22,176 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 67 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2023-08-29 20:19:22,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 308 flow [2023-08-29 20:19:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-29 20:19:22,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47545787545787543 [2023-08-29 20:19:22,180 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-29 20:19:22,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-29 20:19:22,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:22,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-29 20:19:22,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 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-29 20:19:22,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:22,187 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:22,187 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 5 states and 649 transitions. [2023-08-29 20:19:22,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 308 flow [2023-08-29 20:19:22,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:22,191 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 102 flow [2023-08-29 20:19:22,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-29 20:19:22,192 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-08-29 20:19:22,195 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 102 flow [2023-08-29 20:19:22,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 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-29 20:19:22,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:22,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:22,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:19:22,196 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:22,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 740399408, now seen corresponding path program 1 times [2023-08-29 20:19:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102181870] [2023-08-29 20:19:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:22,880 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-29 20:19:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102181870] [2023-08-29 20:19:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102181870] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:22,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:19:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796426901] [2023-08-29 20:19:22,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:22,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:19:22,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:22,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:19:22,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:19:23,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 273 [2023-08-29 20:19:23,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:23,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:23,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 273 [2023-08-29 20:19:23,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:23,825 INFO L130 PetriNetUnfolder]: 4855/6963 cut-off events. [2023-08-29 20:19:23,825 INFO L131 PetriNetUnfolder]: For 1696/1696 co-relation queries the response was YES. [2023-08-29 20:19:23,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15174 conditions, 6963 events. 4855/6963 cut-off events. For 1696/1696 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 37618 event pairs, 712 based on Foata normal form. 512/7475 useless extension candidates. Maximal degree in co-relation 15167. Up to 4384 conditions per place. [2023-08-29 20:19:23,864 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 49 selfloop transitions, 5 changer transitions 2/60 dead transitions. [2023-08-29 20:19:23,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 262 flow [2023-08-29 20:19:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 827 transitions. [2023-08-29 20:19:23,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43275771847200417 [2023-08-29 20:19:23,873 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 827 transitions. [2023-08-29 20:19:23,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 827 transitions. [2023-08-29 20:19:23,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:23,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 827 transitions. [2023-08-29 20:19:23,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 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-29 20:19:23,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:23,880 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:23,880 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 102 flow. Second operand 7 states and 827 transitions. [2023-08-29 20:19:23,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 262 flow [2023-08-29 20:19:23,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:23,903 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 86 flow [2023-08-29 20:19:23,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=86, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-08-29 20:19:23,905 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-08-29 20:19:23,905 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 86 flow [2023-08-29 20:19:23,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:19:23,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:23,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:23,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:19:23,906 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:23,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:23,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1243043692, now seen corresponding path program 1 times [2023-08-29 20:19:23,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:23,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733214680] [2023-08-29 20:19:23,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:23,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:24,450 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-29 20:19:24,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:24,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733214680] [2023-08-29 20:19:24,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733214680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:24,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:24,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:19:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222814955] [2023-08-29 20:19:24,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:24,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:24,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:24,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:24,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-08-29 20:19:24,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 29 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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-29 20:19:24,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:24,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-08-29 20:19:24,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:25,077 INFO L130 PetriNetUnfolder]: 4915/6914 cut-off events. [2023-08-29 20:19:25,077 INFO L131 PetriNetUnfolder]: For 1448/1448 co-relation queries the response was YES. [2023-08-29 20:19:25,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14758 conditions, 6914 events. 4915/6914 cut-off events. For 1448/1448 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 35169 event pairs, 2535 based on Foata normal form. 240/7129 useless extension candidates. Maximal degree in co-relation 14751. Up to 6001 conditions per place. [2023-08-29 20:19:25,110 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 35 selfloop transitions, 5 changer transitions 19/63 dead transitions. [2023-08-29 20:19:25,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 286 flow [2023-08-29 20:19:25,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-29 20:19:25,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062271062271062 [2023-08-29 20:19:25,113 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-29 20:19:25,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-29 20:19:25,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:25,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-29 20:19:25,115 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-29 20:19:25,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:25,118 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:25,118 INFO L175 Difference]: Start difference. First operand has 51 places, 29 transitions, 86 flow. Second operand 5 states and 691 transitions. [2023-08-29 20:19:25,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 286 flow [2023-08-29 20:19:25,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 265 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-08-29 20:19:25,145 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 116 flow [2023-08-29 20:19:25,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-29 20:19:25,148 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-08-29 20:19:25,148 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 116 flow [2023-08-29 20:19:25,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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-29 20:19:25,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:25,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:25,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:19:25,149 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:25,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash 618477214, now seen corresponding path program 1 times [2023-08-29 20:19:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139460309] [2023-08-29 20:19:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:25,714 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-29 20:19:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139460309] [2023-08-29 20:19:25,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139460309] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:25,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:25,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083305573] [2023-08-29 20:19:25,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:25,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:25,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:25,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:25,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:25,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:25,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 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-29 20:19:25,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:25,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:25,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:26,644 INFO L130 PetriNetUnfolder]: 5045/7160 cut-off events. [2023-08-29 20:19:26,644 INFO L131 PetriNetUnfolder]: For 4331/4566 co-relation queries the response was YES. [2023-08-29 20:19:26,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18761 conditions, 7160 events. 5045/7160 cut-off events. For 4331/4566 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 37039 event pairs, 2373 based on Foata normal form. 265/7393 useless extension candidates. Maximal degree in co-relation 18753. Up to 5519 conditions per place. [2023-08-29 20:19:26,684 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 52 selfloop transitions, 9 changer transitions 30/95 dead transitions. [2023-08-29 20:19:26,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 512 flow [2023-08-29 20:19:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 951 transitions. [2023-08-29 20:19:26,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976452119309262 [2023-08-29 20:19:26,688 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 951 transitions. [2023-08-29 20:19:26,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 951 transitions. [2023-08-29 20:19:26,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:26,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 951 transitions. [2023-08-29 20:19:26,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 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-29 20:19:26,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:26,694 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:26,694 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 116 flow. Second operand 7 states and 951 transitions. [2023-08-29 20:19:26,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 512 flow [2023-08-29 20:19:26,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 505 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:26,710 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 198 flow [2023-08-29 20:19:26,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-29 20:19:26,711 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-08-29 20:19:26,711 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 198 flow [2023-08-29 20:19:26,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 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-29 20:19:26,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:26,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:26,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:19:26,713 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:26,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash -592641707, now seen corresponding path program 1 times [2023-08-29 20:19:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387858318] [2023-08-29 20:19:26,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:27,198 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-29 20:19:27,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:27,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387858318] [2023-08-29 20:19:27,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387858318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:27,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:27,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:27,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940544610] [2023-08-29 20:19:27,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:27,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:27,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:27,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:27,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:27,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 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-29 20:19:27,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:27,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:27,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:27,919 INFO L130 PetriNetUnfolder]: 4917/7044 cut-off events. [2023-08-29 20:19:27,919 INFO L131 PetriNetUnfolder]: For 13491/14136 co-relation queries the response was YES. [2023-08-29 20:19:27,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23176 conditions, 7044 events. 4917/7044 cut-off events. For 13491/14136 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 36851 event pairs, 1419 based on Foata normal form. 177/7165 useless extension candidates. Maximal degree in co-relation 23164. Up to 5157 conditions per place. [2023-08-29 20:19:27,951 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 57 selfloop transitions, 11 changer transitions 18/90 dead transitions. [2023-08-29 20:19:27,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 590 flow [2023-08-29 20:19:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:19:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:19:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-29 20:19:27,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987789987789988 [2023-08-29 20:19:27,954 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-29 20:19:27,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-29 20:19:27,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:27,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-29 20:19:27,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 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-29 20:19:27,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 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-29 20:19:27,959 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 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-29 20:19:27,959 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 198 flow. Second operand 6 states and 817 transitions. [2023-08-29 20:19:27,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 590 flow [2023-08-29 20:19:28,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 90 transitions, 564 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:28,022 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 255 flow [2023-08-29 20:19:28,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-29 20:19:28,023 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-29 20:19:28,023 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 255 flow [2023-08-29 20:19:28,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 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-29 20:19:28,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:28,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:28,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:19:28,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:28,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1304703093, now seen corresponding path program 2 times [2023-08-29 20:19:28,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:28,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365074062] [2023-08-29 20:19:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:28,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:28,498 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-29 20:19:28,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:28,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365074062] [2023-08-29 20:19:28,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365074062] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:28,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:28,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203892754] [2023-08-29 20:19:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:28,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:28,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:28,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 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-29 20:19:28,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:28,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:28,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:29,345 INFO L130 PetriNetUnfolder]: 4952/7087 cut-off events. [2023-08-29 20:19:29,345 INFO L131 PetriNetUnfolder]: For 18236/18958 co-relation queries the response was YES. [2023-08-29 20:19:29,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25279 conditions, 7087 events. 4952/7087 cut-off events. For 18236/18958 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 37096 event pairs, 1421 based on Foata normal form. 199/7230 useless extension candidates. Maximal degree in co-relation 25265. Up to 5165 conditions per place. [2023-08-29 20:19:29,376 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 58 selfloop transitions, 14 changer transitions 25/101 dead transitions. [2023-08-29 20:19:29,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 101 transitions, 741 flow [2023-08-29 20:19:29,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:29,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 948 transitions. [2023-08-29 20:19:29,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49607535321821034 [2023-08-29 20:19:29,379 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 948 transitions. [2023-08-29 20:19:29,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 948 transitions. [2023-08-29 20:19:29,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:29,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 948 transitions. [2023-08-29 20:19:29,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.42857142857142) internal successors, (948), 7 states have internal predecessors, (948), 0 states have call successors, (0), 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-29 20:19:29,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:29,385 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:29,385 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 255 flow. Second operand 7 states and 948 transitions. [2023-08-29 20:19:29,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 101 transitions, 741 flow [2023-08-29 20:19:29,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 101 transitions, 703 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-29 20:19:29,444 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 319 flow [2023-08-29 20:19:29,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-08-29 20:19:29,445 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2023-08-29 20:19:29,445 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 319 flow [2023-08-29 20:19:29,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 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-29 20:19:29,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:29,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:29,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:19:29,447 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:29,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:29,447 INFO L85 PathProgramCache]: Analyzing trace with hash -145929031, now seen corresponding path program 1 times [2023-08-29 20:19:29,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:29,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254039528] [2023-08-29 20:19:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:29,994 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-29 20:19:29,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:29,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254039528] [2023-08-29 20:19:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254039528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:29,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:29,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:29,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877778595] [2023-08-29 20:19:29,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:29,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:29,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:29,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:30,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 273 [2023-08-29 20:19:30,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 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-29 20:19:30,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:30,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 273 [2023-08-29 20:19:30,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:30,866 INFO L130 PetriNetUnfolder]: 5697/8166 cut-off events. [2023-08-29 20:19:30,866 INFO L131 PetriNetUnfolder]: For 34426/35222 co-relation queries the response was YES. [2023-08-29 20:19:30,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32079 conditions, 8166 events. 5697/8166 cut-off events. For 34426/35222 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 44401 event pairs, 1285 based on Foata normal form. 251/8375 useless extension candidates. Maximal degree in co-relation 32063. Up to 5357 conditions per place. [2023-08-29 20:19:30,914 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 73 selfloop transitions, 19 changer transitions 33/129 dead transitions. [2023-08-29 20:19:30,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 129 transitions, 1056 flow [2023-08-29 20:19:30,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:19:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:19:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1237 transitions. [2023-08-29 20:19:30,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034595034595034 [2023-08-29 20:19:30,918 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1237 transitions. [2023-08-29 20:19:30,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1237 transitions. [2023-08-29 20:19:30,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:30,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1237 transitions. [2023-08-29 20:19:30,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.44444444444446) internal successors, (1237), 9 states have internal predecessors, (1237), 0 states have call successors, (0), 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-29 20:19:30,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 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-29 20:19:30,925 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 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-29 20:19:30,925 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 319 flow. Second operand 9 states and 1237 transitions. [2023-08-29 20:19:30,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 129 transitions, 1056 flow [2023-08-29 20:19:30,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 1017 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-29 20:19:30,987 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 467 flow [2023-08-29 20:19:30,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=467, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-29 20:19:30,987 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2023-08-29 20:19:30,988 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 467 flow [2023-08-29 20:19:30,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 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-29 20:19:30,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:30,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:30,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:19:30,989 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:30,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1189329743, now seen corresponding path program 1 times [2023-08-29 20:19:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553540718] [2023-08-29 20:19:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:31,456 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-29 20:19:31,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:31,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553540718] [2023-08-29 20:19:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553540718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:31,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:31,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:31,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274960015] [2023-08-29 20:19:31,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:31,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:31,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:31,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:31,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 273 [2023-08-29 20:19:31,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 467 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 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-29 20:19:31,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:31,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 273 [2023-08-29 20:19:31,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:34,020 INFO L130 PetriNetUnfolder]: 16889/22840 cut-off events. [2023-08-29 20:19:34,020 INFO L131 PetriNetUnfolder]: For 155220/155220 co-relation queries the response was YES. [2023-08-29 20:19:34,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99024 conditions, 22840 events. 16889/22840 cut-off events. For 155220/155220 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 117553 event pairs, 3179 based on Foata normal form. 412/23252 useless extension candidates. Maximal degree in co-relation 99004. Up to 15253 conditions per place. [2023-08-29 20:19:34,141 INFO L137 encePairwiseOnDemand]: 260/273 looper letters, 102 selfloop transitions, 30 changer transitions 43/175 dead transitions. [2023-08-29 20:19:34,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 175 transitions, 1766 flow [2023-08-29 20:19:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:19:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:19:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1248 transitions. [2023-08-29 20:19:34,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2023-08-29 20:19:34,146 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1248 transitions. [2023-08-29 20:19:34,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1248 transitions. [2023-08-29 20:19:34,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:34,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1248 transitions. [2023-08-29 20:19:34,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.8) internal successors, (1248), 10 states have internal predecessors, (1248), 0 states have call successors, (0), 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-29 20:19:34,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 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-29 20:19:34,154 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 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-29 20:19:34,154 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 467 flow. Second operand 10 states and 1248 transitions. [2023-08-29 20:19:34,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 175 transitions, 1766 flow [2023-08-29 20:19:34,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 175 transitions, 1589 flow, removed 81 selfloop flow, removed 4 redundant places. [2023-08-29 20:19:34,736 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 744 flow [2023-08-29 20:19:34,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=744, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2023-08-29 20:19:34,737 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2023-08-29 20:19:34,737 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 744 flow [2023-08-29 20:19:34,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 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-29 20:19:34,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:34,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:34,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:19:34,738 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:34,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1740010197, now seen corresponding path program 2 times [2023-08-29 20:19:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:34,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949844429] [2023-08-29 20:19:34,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:34,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:19:35,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:35,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949844429] [2023-08-29 20:19:35,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949844429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:35,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:35,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:35,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948062991] [2023-08-29 20:19:35,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:35,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:35,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:35,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:35,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:35,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:35,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 744 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 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-29 20:19:35,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:35,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:35,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:36,231 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 60#$Ultimate##0true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,231 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:19:36,231 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:19:36,231 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:19:36,231 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:19:36,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 60#$Ultimate##0true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,410 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-08-29 20:19:36,410 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-29 20:19:36,410 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-29 20:19:36,410 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-29 20:19:36,411 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [60#$Ultimate##0true, Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,411 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-08-29 20:19:36,411 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-29 20:19:36,411 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-29 20:19:36,412 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-29 20:19:36,433 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= v_~x$w_buff1_used~0_106 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff0_used~0_119 (ite .cse4 0 v_~x$w_buff0_used~0_120)) (= (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_54)) v_~x~0_53)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][73], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 107#L813true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,433 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,433 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,433 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,433 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,434 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,434 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,434 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,434 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,434 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,436 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,436 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,436 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,436 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,437 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,442 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 60#$Ultimate##0true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,442 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,443 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,443 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,443 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,443 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [60#$Ultimate##0true, Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,443 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,444 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,444 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,444 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,444 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [60#$Ultimate##0true, Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,445 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,445 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,445 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,445 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-29 20:19:36,615 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,615 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,615 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,616 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,616 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,618 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,618 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,618 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,619 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,619 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,620 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,620 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,620 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,621 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,621 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-29 20:19:36,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= v_~x$w_buff1_used~0_106 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff0_used~0_119 (ite .cse4 0 v_~x$w_buff0_used~0_120)) (= (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_54)) v_~x~0_53)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][73], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 107#L813true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,653 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,653 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,653 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,653 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,654 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,654 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,654 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,654 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,654 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,654 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,655 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,655 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,655 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,655 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,656 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,656 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,656 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,656 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,656 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,657 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,657 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,657 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,657 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,657 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,657 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,657 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,657 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,658 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,658 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,658 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= v_~x$w_buff1_used~0_106 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff0_used~0_119 (ite .cse4 0 v_~x$w_buff0_used~0_120)) (= (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_54)) v_~x~0_53)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][73], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 107#L813true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,658 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,658 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,658 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,659 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,659 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,659 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,659 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,659 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,659 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:36,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,825 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,825 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,825 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,825 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,828 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= v_~x$w_buff1_used~0_106 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff0_used~0_119 (ite .cse4 0 v_~x$w_buff0_used~0_120)) (= (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_54)) v_~x~0_53)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][73], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 107#L813true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,828 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,828 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,828 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,828 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,837 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-29 20:19:36,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-29 20:19:36,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-29 20:19:36,837 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-29 20:19:36,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,837 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,837 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,837 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,837 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,839 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,839 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-29 20:19:36,839 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-29 20:19:36,839 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-29 20:19:36,839 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-29 20:19:36,840 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:36,840 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,840 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,840 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:36,840 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:37,230 INFO L130 PetriNetUnfolder]: 14145/19966 cut-off events. [2023-08-29 20:19:37,230 INFO L131 PetriNetUnfolder]: For 240147/242262 co-relation queries the response was YES. [2023-08-29 20:19:37,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111098 conditions, 19966 events. 14145/19966 cut-off events. For 240147/242262 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 116031 event pairs, 3323 based on Foata normal form. 658/19980 useless extension candidates. Maximal degree in co-relation 111073. Up to 12260 conditions per place. [2023-08-29 20:19:37,406 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 82 selfloop transitions, 38 changer transitions 10/141 dead transitions. [2023-08-29 20:19:37,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 141 transitions, 1552 flow [2023-08-29 20:19:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:37,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2023-08-29 20:19:37,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4955520669806384 [2023-08-29 20:19:37,410 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2023-08-29 20:19:37,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2023-08-29 20:19:37,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:37,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2023-08-29 20:19:37,413 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-29 20:19:37,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:37,419 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:37,419 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 744 flow. Second operand 7 states and 947 transitions. [2023-08-29 20:19:37,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 141 transitions, 1552 flow [2023-08-29 20:19:38,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 141 transitions, 1419 flow, removed 66 selfloop flow, removed 6 redundant places. [2023-08-29 20:19:38,018 INFO L231 Difference]: Finished difference. Result has 78 places, 92 transitions, 1012 flow [2023-08-29 20:19:38,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1012, PETRI_PLACES=78, PETRI_TRANSITIONS=92} [2023-08-29 20:19:38,019 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-08-29 20:19:38,019 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 92 transitions, 1012 flow [2023-08-29 20:19:38,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 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-29 20:19:38,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:38,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:38,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:19:38,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:38,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 851047931, now seen corresponding path program 3 times [2023-08-29 20:19:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505612182] [2023-08-29 20:19:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:38,600 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-29 20:19:38,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:38,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505612182] [2023-08-29 20:19:38,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505612182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:38,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:38,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:19:38,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188947121] [2023-08-29 20:19:38,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:38,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:19:38,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:19:38,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:19:38,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 273 [2023-08-29 20:19:38,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 92 transitions, 1012 flow. Second operand has 8 states, 8 states have (on average 117.125) internal successors, (937), 8 states have internal predecessors, (937), 0 states have call successors, (0), 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-29 20:19:38,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:38,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 273 [2023-08-29 20:19:38,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:41,697 INFO L130 PetriNetUnfolder]: 18854/25537 cut-off events. [2023-08-29 20:19:41,697 INFO L131 PetriNetUnfolder]: For 190103/190103 co-relation queries the response was YES. [2023-08-29 20:19:41,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131896 conditions, 25537 events. 18854/25537 cut-off events. For 190103/190103 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 135726 event pairs, 3033 based on Foata normal form. 390/25927 useless extension candidates. Maximal degree in co-relation 131874. Up to 12542 conditions per place. [2023-08-29 20:19:41,844 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 86 selfloop transitions, 46 changer transitions 36/168 dead transitions. [2023-08-29 20:19:41,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 168 transitions, 1993 flow [2023-08-29 20:19:41,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:19:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:19:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1030 transitions. [2023-08-29 20:19:41,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716117216117216 [2023-08-29 20:19:41,847 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1030 transitions. [2023-08-29 20:19:41,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1030 transitions. [2023-08-29 20:19:41,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:41,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1030 transitions. [2023-08-29 20:19:41,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.75) internal successors, (1030), 8 states have internal predecessors, (1030), 0 states have call successors, (0), 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-29 20:19:41,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 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-29 20:19:41,854 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 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-29 20:19:41,854 INFO L175 Difference]: Start difference. First operand has 78 places, 92 transitions, 1012 flow. Second operand 8 states and 1030 transitions. [2023-08-29 20:19:41,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 168 transitions, 1993 flow [2023-08-29 20:19:42,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 168 transitions, 1909 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-08-29 20:19:42,232 INFO L231 Difference]: Finished difference. Result has 85 places, 96 transitions, 1184 flow [2023-08-29 20:19:42,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1184, PETRI_PLACES=85, PETRI_TRANSITIONS=96} [2023-08-29 20:19:42,232 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2023-08-29 20:19:42,233 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 96 transitions, 1184 flow [2023-08-29 20:19:42,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.125) internal successors, (937), 8 states have internal predecessors, (937), 0 states have call successors, (0), 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-29 20:19:42,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:42,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:42,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:19:42,233 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:42,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2023680085, now seen corresponding path program 1 times [2023-08-29 20:19:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125210826] [2023-08-29 20:19:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:42,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:42,438 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-29 20:19:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:42,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125210826] [2023-08-29 20:19:42,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125210826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:42,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:42,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:19:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818479957] [2023-08-29 20:19:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:42,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:19:42,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:42,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:19:42,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:19:42,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:42,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 96 transitions, 1184 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-29 20:19:42,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:42,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:42,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:43,331 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][128], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 308#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 317#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 319#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 114#L865true, 18#P2EXITtrue, Black: 315#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 313#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 326#true, 132#L836true, 80#L783true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 293#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 307#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:43,331 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:19:43,331 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:43,331 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:43,332 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:19:43,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][128], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 308#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 317#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 319#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 114#L865true, 18#P2EXITtrue, Black: 315#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 313#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 326#true, 132#L836true, 80#L783true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 293#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 127#P0EXITtrue, 307#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:43,574 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:19:43,574 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:43,574 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:43,574 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:43,575 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][128], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 308#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 317#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 319#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 18#P2EXITtrue, Black: 315#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 313#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 326#true, 132#L836true, 110#L871true, 80#L783true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 293#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 307#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:43,575 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:19:43,576 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:43,576 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:43,576 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:19:43,704 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][128], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 308#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 317#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 319#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 18#P2EXITtrue, Black: 315#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 313#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 326#true, 132#L836true, 110#L871true, 80#L783true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 293#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 127#P0EXITtrue, 307#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:19:43,705 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:19:43,705 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:19:43,705 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:19:43,705 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:19:43,911 INFO L130 PetriNetUnfolder]: 8383/12020 cut-off events. [2023-08-29 20:19:43,912 INFO L131 PetriNetUnfolder]: For 202573/208298 co-relation queries the response was YES. [2023-08-29 20:19:43,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77789 conditions, 12020 events. 8383/12020 cut-off events. For 202573/208298 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 68320 event pairs, 1928 based on Foata normal form. 1455/12785 useless extension candidates. Maximal degree in co-relation 77763. Up to 9098 conditions per place. [2023-08-29 20:19:44,015 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 133 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2023-08-29 20:19:44,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 155 transitions, 2232 flow [2023-08-29 20:19:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:19:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:19:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-29 20:19:44,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503052503052503 [2023-08-29 20:19:44,017 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-29 20:19:44,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-29 20:19:44,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:44,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-29 20:19:44,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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-29 20:19:44,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 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-29 20:19:44,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 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-29 20:19:44,020 INFO L175 Difference]: Start difference. First operand has 85 places, 96 transitions, 1184 flow. Second operand 3 states and 412 transitions. [2023-08-29 20:19:44,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 155 transitions, 2232 flow [2023-08-29 20:19:44,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 155 transitions, 2066 flow, removed 43 selfloop flow, removed 7 redundant places. [2023-08-29 20:19:44,241 INFO L231 Difference]: Finished difference. Result has 78 places, 100 transitions, 1117 flow [2023-08-29 20:19:44,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1117, PETRI_PLACES=78, PETRI_TRANSITIONS=100} [2023-08-29 20:19:44,241 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-08-29 20:19:44,241 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 100 transitions, 1117 flow [2023-08-29 20:19:44,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-29 20:19:44,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:44,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:44,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:19:44,242 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:44,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:44,243 INFO L85 PathProgramCache]: Analyzing trace with hash -716551583, now seen corresponding path program 1 times [2023-08-29 20:19:44,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:44,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329798651] [2023-08-29 20:19:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:44,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:44,471 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-29 20:19:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329798651] [2023-08-29 20:19:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329798651] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:19:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326603760] [2023-08-29 20:19:44,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:44,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:19:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:44,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:19:44,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:19:44,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:44,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 100 transitions, 1117 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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-29 20:19:44,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:44,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:44,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:45,304 INFO L130 PetriNetUnfolder]: 4334/6562 cut-off events. [2023-08-29 20:19:45,304 INFO L131 PetriNetUnfolder]: For 75737/78533 co-relation queries the response was YES. [2023-08-29 20:19:45,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38796 conditions, 6562 events. 4334/6562 cut-off events. For 75737/78533 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 36640 event pairs, 619 based on Foata normal form. 1131/7436 useless extension candidates. Maximal degree in co-relation 38773. Up to 2862 conditions per place. [2023-08-29 20:19:45,361 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 174 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2023-08-29 20:19:45,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 2750 flow [2023-08-29 20:19:45,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:19:45,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:19:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-29 20:19:45,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045787545787546 [2023-08-29 20:19:45,364 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-29 20:19:45,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-29 20:19:45,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:45,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-29 20:19:45,366 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-29 20:19:45,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 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-29 20:19:45,368 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 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-29 20:19:45,368 INFO L175 Difference]: Start difference. First operand has 78 places, 100 transitions, 1117 flow. Second operand 4 states and 551 transitions. [2023-08-29 20:19:45,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 2750 flow [2023-08-29 20:19:45,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 2745 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:19:45,475 INFO L231 Difference]: Finished difference. Result has 81 places, 101 transitions, 1128 flow [2023-08-29 20:19:45,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1128, PETRI_PLACES=81, PETRI_TRANSITIONS=101} [2023-08-29 20:19:45,475 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2023-08-29 20:19:45,475 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 101 transitions, 1128 flow [2023-08-29 20:19:45,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 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-29 20:19:45,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:45,476 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] [2023-08-29 20:19:45,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:19:45,476 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:45,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash -383741557, now seen corresponding path program 1 times [2023-08-29 20:19:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:45,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353198745] [2023-08-29 20:19:45,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:45,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:45,689 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-29 20:19:45,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:45,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353198745] [2023-08-29 20:19:45,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353198745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:45,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:45,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:45,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761575938] [2023-08-29 20:19:45,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:45,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:45,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:45,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:45,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:45,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:45,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 101 transitions, 1128 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 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-29 20:19:45,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:45,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:45,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:46,415 INFO L130 PetriNetUnfolder]: 3354/5031 cut-off events. [2023-08-29 20:19:46,416 INFO L131 PetriNetUnfolder]: For 62320/64561 co-relation queries the response was YES. [2023-08-29 20:19:46,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30736 conditions, 5031 events. 3354/5031 cut-off events. For 62320/64561 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 27419 event pairs, 466 based on Foata normal form. 816/5614 useless extension candidates. Maximal degree in co-relation 30712. Up to 2272 conditions per place. [2023-08-29 20:19:46,450 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 184 selfloop transitions, 13 changer transitions 0/214 dead transitions. [2023-08-29 20:19:46,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 214 transitions, 2953 flow [2023-08-29 20:19:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2023-08-29 20:19:46,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504029304029304 [2023-08-29 20:19:46,453 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2023-08-29 20:19:46,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2023-08-29 20:19:46,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:46,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2023-08-29 20:19:46,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 0 states have call successors, (0), 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-29 20:19:46,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:46,457 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:46,458 INFO L175 Difference]: Start difference. First operand has 81 places, 101 transitions, 1128 flow. Second operand 5 states and 688 transitions. [2023-08-29 20:19:46,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 214 transitions, 2953 flow [2023-08-29 20:19:46,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 214 transitions, 2836 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-08-29 20:19:46,626 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 1063 flow [2023-08-29 20:19:46,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1063, PETRI_PLACES=81, PETRI_TRANSITIONS=99} [2023-08-29 20:19:46,627 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2023-08-29 20:19:46,627 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 1063 flow [2023-08-29 20:19:46,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 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-29 20:19:46,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:46,628 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-29 20:19:46,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:19:46,628 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:46,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2091572267, now seen corresponding path program 1 times [2023-08-29 20:19:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374569821] [2023-08-29 20:19:46,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:46,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:46,894 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-29 20:19:46,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:46,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374569821] [2023-08-29 20:19:46,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374569821] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:46,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:46,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:46,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183112525] [2023-08-29 20:19:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:46,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:46,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:46,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:46,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:46,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 99 transitions, 1063 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 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-29 20:19:46,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:46,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:46,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:47,950 INFO L130 PetriNetUnfolder]: 4830/7419 cut-off events. [2023-08-29 20:19:47,950 INFO L131 PetriNetUnfolder]: For 67836/68861 co-relation queries the response was YES. [2023-08-29 20:19:47,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44261 conditions, 7419 events. 4830/7419 cut-off events. For 67836/68861 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 43313 event pairs, 716 based on Foata normal form. 432/7607 useless extension candidates. Maximal degree in co-relation 44237. Up to 3792 conditions per place. [2023-08-29 20:19:47,987 INFO L137 encePairwiseOnDemand]: 269/273 looper letters, 117 selfloop transitions, 2 changer transitions 80/213 dead transitions. [2023-08-29 20:19:47,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 213 transitions, 2701 flow [2023-08-29 20:19:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-29 20:19:47,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010989010989011 [2023-08-29 20:19:47,989 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-29 20:19:47,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-29 20:19:47,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:47,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-29 20:19:47,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 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-29 20:19:47,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:47,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:47,993 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 1063 flow. Second operand 5 states and 684 transitions. [2023-08-29 20:19:47,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 213 transitions, 2701 flow [2023-08-29 20:19:48,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 213 transitions, 2611 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-29 20:19:48,310 INFO L231 Difference]: Finished difference. Result has 85 places, 98 transitions, 1038 flow [2023-08-29 20:19:48,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1038, PETRI_PLACES=85, PETRI_TRANSITIONS=98} [2023-08-29 20:19:48,311 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2023-08-29 20:19:48,311 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 1038 flow [2023-08-29 20:19:48,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 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-29 20:19:48,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:48,311 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-29 20:19:48,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:19:48,312 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:48,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash 706754159, now seen corresponding path program 2 times [2023-08-29 20:19:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:48,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869189117] [2023-08-29 20:19:48,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:48,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:49,160 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-29 20:19:49,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:49,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869189117] [2023-08-29 20:19:49,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869189117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:49,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:49,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:19:49,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240351355] [2023-08-29 20:19:49,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:49,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:19:49,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:49,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:19:49,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:19:49,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:49,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 1038 flow. Second operand has 9 states, 9 states have (on average 125.44444444444444) internal successors, (1129), 9 states have internal predecessors, (1129), 0 states have call successors, (0), 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-29 20:19:49,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:49,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:49,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:50,330 INFO L130 PetriNetUnfolder]: 5462/8642 cut-off events. [2023-08-29 20:19:50,330 INFO L131 PetriNetUnfolder]: For 77370/78788 co-relation queries the response was YES. [2023-08-29 20:19:50,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49966 conditions, 8642 events. 5462/8642 cut-off events. For 77370/78788 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 53919 event pairs, 556 based on Foata normal form. 604/9022 useless extension candidates. Maximal degree in co-relation 49939. Up to 3816 conditions per place. [2023-08-29 20:19:50,381 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 121 selfloop transitions, 52 changer transitions 22/205 dead transitions. [2023-08-29 20:19:50,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 205 transitions, 2288 flow [2023-08-29 20:19:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:19:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:19:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1336 transitions. [2023-08-29 20:19:50,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48937728937728936 [2023-08-29 20:19:50,384 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1336 transitions. [2023-08-29 20:19:50,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1336 transitions. [2023-08-29 20:19:50,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:50,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1336 transitions. [2023-08-29 20:19:50,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 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-29 20:19:50,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 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-29 20:19:50,391 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 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-29 20:19:50,391 INFO L175 Difference]: Start difference. First operand has 85 places, 98 transitions, 1038 flow. Second operand 10 states and 1336 transitions. [2023-08-29 20:19:50,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 205 transitions, 2288 flow [2023-08-29 20:19:50,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 205 transitions, 2279 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-29 20:19:50,641 INFO L231 Difference]: Finished difference. Result has 97 places, 113 transitions, 1500 flow [2023-08-29 20:19:50,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1500, PETRI_PLACES=97, PETRI_TRANSITIONS=113} [2023-08-29 20:19:50,642 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2023-08-29 20:19:50,642 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 113 transitions, 1500 flow [2023-08-29 20:19:50,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 125.44444444444444) internal successors, (1129), 9 states have internal predecessors, (1129), 0 states have call successors, (0), 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-29 20:19:50,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:50,643 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-29 20:19:50,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:19:50,643 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:50,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1768836791, now seen corresponding path program 3 times [2023-08-29 20:19:50,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:50,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282004063] [2023-08-29 20:19:50,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:50,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:50,875 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-29 20:19:50,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282004063] [2023-08-29 20:19:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282004063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:50,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:50,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:19:50,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602958014] [2023-08-29 20:19:50,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:50,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:50,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:50,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:50,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 113 transitions, 1500 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 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-29 20:19:50,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:50,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:50,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:52,069 INFO L130 PetriNetUnfolder]: 4939/7516 cut-off events. [2023-08-29 20:19:52,069 INFO L131 PetriNetUnfolder]: For 115398/118561 co-relation queries the response was YES. [2023-08-29 20:19:52,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50547 conditions, 7516 events. 4939/7516 cut-off events. For 115398/118561 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 45977 event pairs, 568 based on Foata normal form. 1186/8451 useless extension candidates. Maximal degree in co-relation 50515. Up to 3300 conditions per place. [2023-08-29 20:19:52,099 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 206 selfloop transitions, 17 changer transitions 20/257 dead transitions. [2023-08-29 20:19:52,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 257 transitions, 4214 flow [2023-08-29 20:19:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:19:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:19:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2023-08-29 20:19:52,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49511599511599513 [2023-08-29 20:19:52,100 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 811 transitions. [2023-08-29 20:19:52,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 811 transitions. [2023-08-29 20:19:52,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:52,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 811 transitions. [2023-08-29 20:19:52,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 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-29 20:19:52,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 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-29 20:19:52,104 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 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-29 20:19:52,104 INFO L175 Difference]: Start difference. First operand has 97 places, 113 transitions, 1500 flow. Second operand 6 states and 811 transitions. [2023-08-29 20:19:52,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 257 transitions, 4214 flow [2023-08-29 20:19:52,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 257 transitions, 3726 flow, removed 207 selfloop flow, removed 7 redundant places. [2023-08-29 20:19:52,473 INFO L231 Difference]: Finished difference. Result has 93 places, 110 transitions, 1303 flow [2023-08-29 20:19:52,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1303, PETRI_PLACES=93, PETRI_TRANSITIONS=110} [2023-08-29 20:19:52,473 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2023-08-29 20:19:52,474 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 110 transitions, 1303 flow [2023-08-29 20:19:52,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 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-29 20:19:52,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:52,474 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-29 20:19:52,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:19:52,474 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:52,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1960583898, now seen corresponding path program 1 times [2023-08-29 20:19:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58332791] [2023-08-29 20:19:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:52,700 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-29 20:19:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:52,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58332791] [2023-08-29 20:19:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58332791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:52,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:52,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:19:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127064114] [2023-08-29 20:19:52,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:52,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:19:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:19:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:19:52,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-29 20:19:52,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 110 transitions, 1303 flow. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 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-29 20:19:52,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:52,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-29 20:19:52,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:53,437 INFO L130 PetriNetUnfolder]: 4802/7495 cut-off events. [2023-08-29 20:19:53,437 INFO L131 PetriNetUnfolder]: For 71782/72746 co-relation queries the response was YES. [2023-08-29 20:19:53,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46521 conditions, 7495 events. 4802/7495 cut-off events. For 71782/72746 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 46158 event pairs, 703 based on Foata normal form. 723/8076 useless extension candidates. Maximal degree in co-relation 46493. Up to 3315 conditions per place. [2023-08-29 20:19:53,475 INFO L137 encePairwiseOnDemand]: 269/273 looper letters, 114 selfloop transitions, 1 changer transitions 93/219 dead transitions. [2023-08-29 20:19:53,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 219 transitions, 3014 flow [2023-08-29 20:19:53,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:19:53,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:19:53,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2023-08-29 20:19:53,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48937728937728936 [2023-08-29 20:19:53,476 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2023-08-29 20:19:53,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2023-08-29 20:19:53,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:53,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2023-08-29 20:19:53,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 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-29 20:19:53,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:53,479 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 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-29 20:19:53,479 INFO L175 Difference]: Start difference. First operand has 93 places, 110 transitions, 1303 flow. Second operand 5 states and 668 transitions. [2023-08-29 20:19:53,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 219 transitions, 3014 flow [2023-08-29 20:19:53,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 219 transitions, 2621 flow, removed 138 selfloop flow, removed 9 redundant places. [2023-08-29 20:19:53,749 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 903 flow [2023-08-29 20:19:53,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=903, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2023-08-29 20:19:53,750 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2023-08-29 20:19:53,750 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 903 flow [2023-08-29 20:19:53,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 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-29 20:19:53,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:53,751 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-29 20:19:53,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:19:53,751 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:53,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash 161994844, now seen corresponding path program 2 times [2023-08-29 20:19:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:53,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269003663] [2023-08-29 20:19:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:53,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:54,158 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-29 20:19:54,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:54,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269003663] [2023-08-29 20:19:54,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269003663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:54,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:54,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:19:54,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727252440] [2023-08-29 20:19:54,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:54,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:19:54,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:19:54,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:19:54,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 273 [2023-08-29 20:19:54,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 903 flow. Second operand has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 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-29 20:19:54,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:54,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 273 [2023-08-29 20:19:54,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:54,879 INFO L130 PetriNetUnfolder]: 3211/5127 cut-off events. [2023-08-29 20:19:54,880 INFO L131 PetriNetUnfolder]: For 29047/29487 co-relation queries the response was YES. [2023-08-29 20:19:54,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27669 conditions, 5127 events. 3211/5127 cut-off events. For 29047/29487 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 29703 event pairs, 482 based on Foata normal form. 419/5520 useless extension candidates. Maximal degree in co-relation 27643. Up to 2245 conditions per place. [2023-08-29 20:19:54,899 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 57 selfloop transitions, 3 changer transitions 132/195 dead transitions. [2023-08-29 20:19:54,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 195 transitions, 2253 flow [2023-08-29 20:19:54,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:19:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:19:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-29 20:19:54,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4484563055991627 [2023-08-29 20:19:54,900 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-29 20:19:54,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-29 20:19:54,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:54,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-29 20:19:54,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 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-29 20:19:54,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:54,903 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 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-29 20:19:54,903 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 903 flow. Second operand 7 states and 857 transitions. [2023-08-29 20:19:54,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 195 transitions, 2253 flow [2023-08-29 20:19:54,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 195 transitions, 2204 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-29 20:19:54,992 INFO L231 Difference]: Finished difference. Result has 92 places, 55 transitions, 434 flow [2023-08-29 20:19:54,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=434, PETRI_PLACES=92, PETRI_TRANSITIONS=55} [2023-08-29 20:19:54,992 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2023-08-29 20:19:54,992 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 55 transitions, 434 flow [2023-08-29 20:19:54,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 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-29 20:19:54,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:54,993 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-29 20:19:54,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:19:54,993 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:54,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:54,993 INFO L85 PathProgramCache]: Analyzing trace with hash 11983556, now seen corresponding path program 3 times [2023-08-29 20:19:54,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:54,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117432915] [2023-08-29 20:19:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:19:56,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-29 20:19:56,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:19:56,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117432915] [2023-08-29 20:19:56,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117432915] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:19:56,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:19:56,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:19:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84533480] [2023-08-29 20:19:56,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:19:56,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:19:56,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:19:56,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:19:56,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:19:56,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 273 [2023-08-29 20:19:56,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 55 transitions, 434 flow. Second operand has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 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-29 20:19:56,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:19:56,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 273 [2023-08-29 20:19:56,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:19:57,467 INFO L130 PetriNetUnfolder]: 1972/3118 cut-off events. [2023-08-29 20:19:57,467 INFO L131 PetriNetUnfolder]: For 12966/12966 co-relation queries the response was YES. [2023-08-29 20:19:57,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15501 conditions, 3118 events. 1972/3118 cut-off events. For 12966/12966 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15628 event pairs, 245 based on Foata normal form. 1/3119 useless extension candidates. Maximal degree in co-relation 15475. Up to 1374 conditions per place. [2023-08-29 20:19:57,479 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 69 selfloop transitions, 10 changer transitions 59/138 dead transitions. [2023-08-29 20:19:57,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 138 transitions, 1246 flow [2023-08-29 20:19:57,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:19:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:19:57,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 959 transitions. [2023-08-29 20:19:57,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4391025641025641 [2023-08-29 20:19:57,481 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 959 transitions. [2023-08-29 20:19:57,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 959 transitions. [2023-08-29 20:19:57,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:19:57,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 959 transitions. [2023-08-29 20:19:57,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 0 states have call successors, (0), 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-29 20:19:57,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 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-29 20:19:57,485 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 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-29 20:19:57,485 INFO L175 Difference]: Start difference. First operand has 92 places, 55 transitions, 434 flow. Second operand 8 states and 959 transitions. [2023-08-29 20:19:57,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 138 transitions, 1246 flow [2023-08-29 20:19:57,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 138 transitions, 1111 flow, removed 40 selfloop flow, removed 16 redundant places. [2023-08-29 20:19:57,547 INFO L231 Difference]: Finished difference. Result has 78 places, 54 transitions, 388 flow [2023-08-29 20:19:57,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=388, PETRI_PLACES=78, PETRI_TRANSITIONS=54} [2023-08-29 20:19:57,547 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-08-29 20:19:57,547 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 54 transitions, 388 flow [2023-08-29 20:19:57,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 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-29 20:19:57,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:19:57,548 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-29 20:19:57,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:19:57,548 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:19:57,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:19:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash -387337818, now seen corresponding path program 4 times [2023-08-29 20:19:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:19:57,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018650290] [2023-08-29 20:19:57,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:19:57,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:19:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:19:57,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:19:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:19:57,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:19:57,672 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:19:57,673 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:19:57,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:19:57,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:19:57,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:19:57,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:19:57,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:19:57,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:19:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:19:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:19:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:19:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:19:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:19:57,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:19:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:19:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:19:57,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:19:57,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:19:57,678 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:19:57,683 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:19:57,683 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:19:57,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:19:57 BasicIcfg [2023-08-29 20:19:57,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:19:57,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:19:57,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:19:57,770 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:19:57,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:19:11" (3/4) ... [2023-08-29 20:19:57,773 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:19:57,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:19:57,774 INFO L158 Benchmark]: Toolchain (without parser) took 47500.78ms. Allocated memory was 75.5MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 45.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-08-29 20:19:57,774 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:19:57,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.93ms. Allocated memory is still 75.5MB. Free memory was 45.8MB in the beginning and 39.3MB in the end (delta: 6.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2023-08-29 20:19:57,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.73ms. Allocated memory is still 75.5MB. Free memory was 39.3MB in the beginning and 36.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:19:57,775 INFO L158 Benchmark]: Boogie Preprocessor took 26.68ms. Allocated memory is still 75.5MB. Free memory was 36.6MB in the beginning and 34.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:19:57,775 INFO L158 Benchmark]: RCFGBuilder took 814.36ms. Allocated memory is still 75.5MB. Free memory was 34.5MB in the beginning and 38.4MB in the end (delta: -3.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-08-29 20:19:57,775 INFO L158 Benchmark]: TraceAbstraction took 46038.92ms. Allocated memory was 75.5MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 37.9MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-08-29 20:19:57,776 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 5.3GB. Free memory is still 3.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:19:57,777 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.25ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.93ms. Allocated memory is still 75.5MB. Free memory was 45.8MB in the beginning and 39.3MB in the end (delta: 6.4MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.73ms. Allocated memory is still 75.5MB. Free memory was 39.3MB in the beginning and 36.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.68ms. Allocated memory is still 75.5MB. Free memory was 36.6MB in the beginning and 34.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 814.36ms. Allocated memory is still 75.5MB. Free memory was 34.5MB in the beginning and 38.4MB in the end (delta: -3.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 46038.92ms. Allocated memory was 75.5MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 37.9MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 5.3GB. Free memory is still 3.4GB. 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.9s, 150 PlacesBefore, 54 PlacesAfterwards, 139 TransitionsBefore, 42 TransitionsAfterwards, 3506 CoEnabledTransitionPairs, 8 FixpointIterations, 48 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 130 TotalNumberOfCompositions, 11503 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5603, independent: 5318, independent conditional: 0, independent unconditional: 5318, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1821, independent: 1779, independent conditional: 0, independent unconditional: 1779, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5603, independent: 3539, independent conditional: 0, independent unconditional: 3539, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 1821, unknown conditional: 0, unknown unconditional: 1821] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 208, Positive conditional cache size: 0, Positive unconditional cache size: 208, 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_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=-3, t489={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=-2, t489={5:0}, t490={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=-1, t489={5:0}, t490={6:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that 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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: 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, 180 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: 45.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1722 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1434 mSDsluCounter, 1217 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 947 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4239 IncrementalHoareTripleChecker+Invalid, 4578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 270 mSDtfsCounter, 4239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1500occurred in iteration=17, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 3671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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-29 20:19:57,799 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/mix018_tso.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 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:20:00,030 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:20:00,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:20:00,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:20:00,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:20:00,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:20:00,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:20:00,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:20:00,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:20:00,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:20:00,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:20:00,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:20:00,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:20:00,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:20:00,094 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:20:00,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:20:00,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:20:00,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:20:00,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:20:00,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:20:00,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:20:00,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:20:00,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:20:00,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:20:00,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:20:00,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:20:00,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:20:00,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:20:00,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:20:00,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:20:00,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:20:00,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:20:00,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:20:00,139 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:20:00,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:20:00,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:20:00,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:20:00,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:20:00,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:20:00,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:20:00,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:20:00,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:20:00,177 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:20:00,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:20:00,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:20:00,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:20:00,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:20:00,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:20:00,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:20:00,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:20:00,180 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:20:00,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:20:00,180 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:20:00,180 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:20:00,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:20:00,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:20:00,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:20:00,181 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:20:00,181 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:20:00,181 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:20:00,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:20:00,181 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:20:00,181 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:20:00,181 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:20:00,181 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:20:00,181 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:20:00,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:20:00,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:20:00,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:20:00,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:20:00,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:20:00,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:20:00,182 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:20:00,182 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:20:00,183 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:20:00,183 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:20:00,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:20:00,183 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:20:00,183 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:20:00,183 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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf 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 -> AFTER [2023-08-29 20:20:00,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:20:00,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:20:00,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:20:00,493 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:20:00,494 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:20:00,495 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-08-29 20:20:01,576 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:20:01,824 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:20:01,825 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-08-29 20:20:01,845 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a519c95a/a65f49af1c8f40969f9e17b708db2685/FLAG8fab93a92 [2023-08-29 20:20:01,866 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a519c95a/a65f49af1c8f40969f9e17b708db2685 [2023-08-29 20:20:01,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:20:01,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:20:01,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:20:01,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:20:01,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:20:01,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:20:01" (1/1) ... [2023-08-29 20:20:01,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634f21e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:01, skipping insertion in model container [2023-08-29 20:20:01,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:20:01" (1/1) ... [2023-08-29 20:20:01,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:20:01,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:20:02,117 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/mix018_tso.oepc.i[949,962] [2023-08-29 20:20:02,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:20:02,351 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:20:02,372 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/mix018_tso.oepc.i[949,962] [2023-08-29 20:20:02,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:20:02,489 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:20:02,489 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:20:02,495 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:20:02,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02 WrapperNode [2023-08-29 20:20:02,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:20:02,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:20:02,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:20:02,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:20:02,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,530 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,553 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-08-29 20:20:02,554 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:20:02,555 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:20:02,555 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:20:02,555 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:20:02,565 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,586 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:20:02,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:20:02,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:20:02,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:20:02,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (1/1) ... [2023-08-29 20:20:02,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:20:02,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:20:02,642 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-29 20:20:02,667 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-29 20:20:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:20:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:20:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:20:02,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:20:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:20:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:20:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:20:02,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:20:02,687 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:20:02,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:20:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:20:02,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:20:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:20:02,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:20:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:20:02,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:20:02,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:20:02,690 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:20:02,867 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:20:02,882 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:20:03,327 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:20:03,461 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:20:03,462 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:20:03,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:20:03 BoogieIcfgContainer [2023-08-29 20:20:03,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:20:03,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:20:03,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:20:03,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:20:03,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:20:01" (1/3) ... [2023-08-29 20:20:03,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5063ca51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:20:03, skipping insertion in model container [2023-08-29 20:20:03,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:02" (2/3) ... [2023-08-29 20:20:03,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5063ca51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:20:03, skipping insertion in model container [2023-08-29 20:20:03,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:20:03" (3/3) ... [2023-08-29 20:20:03,473 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2023-08-29 20:20:03,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:20:03,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:20:03,489 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:20:03,572 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:20:03,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-29 20:20:03,682 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-29 20:20:03,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:03,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-29 20:20:03,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-29 20:20:03,695 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-29 20:20:03,699 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:20:03,710 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-29 20:20:03,713 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-29 20:20:03,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-29 20:20:03,760 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-29 20:20:03,761 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:03,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-29 20:20:03,766 INFO L119 LiptonReduction]: Number of co-enabled transitions 3506 [2023-08-29 20:20:10,914 INFO L134 LiptonReduction]: Checked pairs total: 10529 [2023-08-29 20:20:10,915 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-29 20:20:10,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:20:10,931 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;@6893cc0e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:20:10,931 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:20:10,933 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:20:10,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:10,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:10,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:20:10,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:10,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash 609, now seen corresponding path program 1 times [2023-08-29 20:20:10,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:10,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574953015] [2023-08-29 20:20:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:10,955 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-29 20:20:10,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:10,958 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-29 20:20:10,966 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-29 20:20:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:11,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:20:11,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:11,048 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-29 20:20:11,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:11,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:11,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574953015] [2023-08-29 20:20:11,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574953015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:11,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:11,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:20:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862735227] [2023-08-29 20:20:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:11,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:20:11,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:11,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:20:11,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:20:11,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 279 [2023-08-29 20:20:11,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 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-29 20:20:11,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:11,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 279 [2023-08-29 20:20:11,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:12,563 INFO L130 PetriNetUnfolder]: 7925/10834 cut-off events. [2023-08-29 20:20:12,594 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2023-08-29 20:20:12,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21744 conditions, 10834 events. 7925/10834 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 57777 event pairs, 7925 based on Foata normal form. 320/9377 useless extension candidates. Maximal degree in co-relation 21732. Up to 10695 conditions per place. [2023-08-29 20:20:12,692 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-29 20:20:12,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-29 20:20:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:20:12,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:20:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-29 20:20:12,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286738351254481 [2023-08-29 20:20:12,706 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-29 20:20:12,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-29 20:20:12,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:12,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-29 20:20:12,713 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-29 20:20:12,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 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-29 20:20:12,717 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 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-29 20:20:12,719 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 295 transitions. [2023-08-29 20:20:12,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-29 20:20:12,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:20:12,732 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-29 20:20:12,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-29 20:20:12,736 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-29 20:20:12,736 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-29 20:20:12,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 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-29 20:20:12,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:12,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:20:12,746 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-29 20:20:12,937 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-29 20:20:12,938 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:12,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash 576999580, now seen corresponding path program 1 times [2023-08-29 20:20:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:12,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220624835] [2023-08-29 20:20:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:12,940 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-29 20:20:12,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:12,941 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-29 20:20:12,945 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-29 20:20:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:13,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:20:13,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:13,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-29 20:20:13,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:13,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:13,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220624835] [2023-08-29 20:20:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220624835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:13,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:13,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:20:13,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024745554] [2023-08-29 20:20:13,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:13,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:20:13,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:20:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:20:13,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 279 [2023-08-29 20:20:13,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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-29 20:20:13,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:13,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 279 [2023-08-29 20:20:13,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:14,008 INFO L130 PetriNetUnfolder]: 6231/8629 cut-off events. [2023-08-29 20:20:14,008 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:14,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17250 conditions, 8629 events. 6231/8629 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 45236 event pairs, 2333 based on Foata normal form. 0/7792 useless extension candidates. Maximal degree in co-relation 17247. Up to 6739 conditions per place. [2023-08-29 20:20:14,049 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 41 selfloop transitions, 2 changer transitions 4/52 dead transitions. [2023-08-29 20:20:14,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 210 flow [2023-08-29 20:20:14,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:20:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:20:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-29 20:20:14,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2023-08-29 20:20:14,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-29 20:20:14,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-29 20:20:14,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:14,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-29 20:20:14,056 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-29 20:20:14,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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-29 20:20:14,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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-29 20:20:14,059 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 432 transitions. [2023-08-29 20:20:14,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 210 flow [2023-08-29 20:20:14,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:20:14,061 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2023-08-29 20:20:14,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-29 20:20:14,062 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-29 20:20:14,062 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2023-08-29 20:20:14,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 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-29 20:20:14,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:14,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:14,075 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-29 20:20:14,272 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-29 20:20:14,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:14,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash 438709440, now seen corresponding path program 1 times [2023-08-29 20:20:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:14,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767579477] [2023-08-29 20:20:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:14,275 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-29 20:20:14,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:14,276 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-29 20:20:14,279 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-29 20:20:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:14,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:20:14,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:14,399 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-29 20:20:14,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:14,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:14,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767579477] [2023-08-29 20:20:14,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767579477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:14,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:20:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491301433] [2023-08-29 20:20:14,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:14,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:20:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:20:14,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:20:14,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-29 20:20:14,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-29 20:20:14,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:14,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-29 20:20:14,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:15,062 INFO L130 PetriNetUnfolder]: 3075/4442 cut-off events. [2023-08-29 20:20:15,063 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2023-08-29 20:20:15,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9281 conditions, 4442 events. 3075/4442 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 23167 event pairs, 693 based on Foata normal form. 81/4290 useless extension candidates. Maximal degree in co-relation 9277. Up to 3944 conditions per place. [2023-08-29 20:20:15,085 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 38 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-29 20:20:15,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 202 flow [2023-08-29 20:20:15,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:20:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:20:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-29 20:20:15,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4970131421744325 [2023-08-29 20:20:15,092 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-29 20:20:15,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-29 20:20:15,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:15,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-29 20:20:15,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-29 20:20:15,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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-29 20:20:15,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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-29 20:20:15,099 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 3 states and 416 transitions. [2023-08-29 20:20:15,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 202 flow [2023-08-29 20:20:15,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:20:15,102 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 101 flow [2023-08-29 20:20:15,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, 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=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-08-29 20:20:15,103 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-29 20:20:15,103 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 101 flow [2023-08-29 20:20:15,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-29 20:20:15,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:15,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:15,116 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-29 20:20:15,314 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-29 20:20:15,315 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:15,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash -471417758, now seen corresponding path program 1 times [2023-08-29 20:20:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:15,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023463499] [2023-08-29 20:20:15,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:15,317 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-29 20:20:15,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:15,318 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-29 20:20:15,322 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-29 20:20:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:15,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:20:15,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:15,503 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-29 20:20:15,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:15,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:15,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023463499] [2023-08-29 20:20:15,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023463499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:15,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:15,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:20:15,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678074703] [2023-08-29 20:20:15,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:15,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:20:15,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:20:15,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:20:15,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-29 20:20:15,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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-29 20:20:15,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:15,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-29 20:20:15,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:15,856 INFO L130 PetriNetUnfolder]: 1455/2282 cut-off events. [2023-08-29 20:20:15,857 INFO L131 PetriNetUnfolder]: For 284/284 co-relation queries the response was YES. [2023-08-29 20:20:15,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 2282 events. 1455/2282 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11686 event pairs, 343 based on Foata normal form. 108/2299 useless extension candidates. Maximal degree in co-relation 5481. Up to 1244 conditions per place. [2023-08-29 20:20:15,870 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 50 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2023-08-29 20:20:15,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 297 flow [2023-08-29 20:20:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:20:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:20:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-29 20:20:15,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982078853046595 [2023-08-29 20:20:15,873 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-29 20:20:15,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-29 20:20:15,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:15,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-29 20:20:15,875 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-29 20:20:15,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 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-29 20:20:15,878 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 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-29 20:20:15,878 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 101 flow. Second operand 4 states and 556 transitions. [2023-08-29 20:20:15,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 297 flow [2023-08-29 20:20:15,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:20:15,884 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 148 flow [2023-08-29 20:20:15,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-29 20:20:15,886 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2023-08-29 20:20:15,886 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 148 flow [2023-08-29 20:20:15,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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-29 20:20:15,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:15,887 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-29 20:20:15,901 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-29 20:20:16,097 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-29 20:20:16,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:16,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:16,098 INFO L85 PathProgramCache]: Analyzing trace with hash -890084705, now seen corresponding path program 1 times [2023-08-29 20:20:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:16,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568195379] [2023-08-29 20:20:16,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:16,098 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-29 20:20:16,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:16,100 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-29 20:20:16,103 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-29 20:20:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:16,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:20:16,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:16,254 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-29 20:20:16,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:16,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:16,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568195379] [2023-08-29 20:20:16,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568195379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:16,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:16,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:16,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396628088] [2023-08-29 20:20:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:16,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:16,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:16,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:16,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:16,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-29 20:20:16,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 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-29 20:20:16,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:16,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-29 20:20:16,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:16,614 INFO L130 PetriNetUnfolder]: 915/1472 cut-off events. [2023-08-29 20:20:16,614 INFO L131 PetriNetUnfolder]: For 984/984 co-relation queries the response was YES. [2023-08-29 20:20:16,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 1472 events. 915/1472 cut-off events. For 984/984 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7137 event pairs, 277 based on Foata normal form. 54/1489 useless extension candidates. Maximal degree in co-relation 4003. Up to 540 conditions per place. [2023-08-29 20:20:16,623 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 60 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2023-08-29 20:20:16,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 402 flow [2023-08-29 20:20:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:20:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:20:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-08-29 20:20:16,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974910394265233 [2023-08-29 20:20:16,626 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-08-29 20:20:16,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-08-29 20:20:16,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:16,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-08-29 20:20:16,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 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-29 20:20:16,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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-29 20:20:16,632 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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-29 20:20:16,633 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 148 flow. Second operand 5 states and 694 transitions. [2023-08-29 20:20:16,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 402 flow [2023-08-29 20:20:16,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 384 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:20:16,636 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 198 flow [2023-08-29 20:20:16,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-29 20:20:16,637 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-08-29 20:20:16,637 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 198 flow [2023-08-29 20:20:16,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 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-29 20:20:16,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:16,638 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-29 20:20:16,651 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-29 20:20:16,851 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-29 20:20:16,851 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:16,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:16,852 INFO L85 PathProgramCache]: Analyzing trace with hash 717800184, now seen corresponding path program 1 times [2023-08-29 20:20:16,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:16,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131984111] [2023-08-29 20:20:16,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:16,853 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-29 20:20:16,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:16,854 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-29 20:20:16,857 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-29 20:20:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:17,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:20:17,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:17,080 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-29 20:20:17,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:17,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:17,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131984111] [2023-08-29 20:20:17,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131984111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:17,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:17,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:20:17,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819306414] [2023-08-29 20:20:17,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:17,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:20:17,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:17,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:20:17,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:20:17,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-29 20:20:17,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 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-29 20:20:17,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:17,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-29 20:20:17,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:17,490 INFO L130 PetriNetUnfolder]: 855/1352 cut-off events. [2023-08-29 20:20:17,490 INFO L131 PetriNetUnfolder]: For 1126/1126 co-relation queries the response was YES. [2023-08-29 20:20:17,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 1352 events. 855/1352 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6519 event pairs, 272 based on Foata normal form. 12/1339 useless extension candidates. Maximal degree in co-relation 3816. Up to 540 conditions per place. [2023-08-29 20:20:17,498 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 56 selfloop transitions, 17 changer transitions 0/78 dead transitions. [2023-08-29 20:20:17,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 428 flow [2023-08-29 20:20:17,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:20:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:20:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2023-08-29 20:20:17,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4886499402628435 [2023-08-29 20:20:17,502 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 818 transitions. [2023-08-29 20:20:17,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 818 transitions. [2023-08-29 20:20:17,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:17,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 818 transitions. [2023-08-29 20:20:17,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.33333333333334) internal successors, (818), 6 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-29 20:20:17,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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-29 20:20:17,508 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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-29 20:20:17,508 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 198 flow. Second operand 6 states and 818 transitions. [2023-08-29 20:20:17,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 428 flow [2023-08-29 20:20:17,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 394 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-29 20:20:17,517 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 208 flow [2023-08-29 20:20:17,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-29 20:20:17,518 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-29 20:20:17,518 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 208 flow [2023-08-29 20:20:17,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 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-29 20:20:17,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:17,519 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-29 20:20:17,529 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-29 20:20:17,728 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-29 20:20:17,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:17,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1572307008, now seen corresponding path program 1 times [2023-08-29 20:20:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040625217] [2023-08-29 20:20:17,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:17,730 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-29 20:20:17,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:17,731 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-29 20:20:17,734 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-29 20:20:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:17,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:20:17,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:17,982 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-29 20:20:17,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:17,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:17,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040625217] [2023-08-29 20:20:17,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040625217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:17,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:17,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:17,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58613357] [2023-08-29 20:20:17,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:17,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:17,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:17,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:17,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:17,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-29 20:20:17,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-29 20:20:17,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:17,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-29 20:20:18,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:18,331 INFO L130 PetriNetUnfolder]: 1263/1955 cut-off events. [2023-08-29 20:20:18,332 INFO L131 PetriNetUnfolder]: For 2076/2076 co-relation queries the response was YES. [2023-08-29 20:20:18,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5747 conditions, 1955 events. 1263/1955 cut-off events. For 2076/2076 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9403 event pairs, 333 based on Foata normal form. 0/1946 useless extension candidates. Maximal degree in co-relation 5739. Up to 1163 conditions per place. [2023-08-29 20:20:18,344 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 83 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2023-08-29 20:20:18,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 90 transitions, 645 flow [2023-08-29 20:20:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:20:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:20:18,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-29 20:20:18,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47813620071684587 [2023-08-29 20:20:18,347 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-29 20:20:18,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-29 20:20:18,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:18,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-29 20:20:18,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 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-29 20:20:18,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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-29 20:20:18,352 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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-29 20:20:18,352 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 208 flow. Second operand 5 states and 667 transitions. [2023-08-29 20:20:18,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 90 transitions, 645 flow [2023-08-29 20:20:18,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 532 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-29 20:20:18,366 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 179 flow [2023-08-29 20:20:18,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-29 20:20:18,366 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-08-29 20:20:18,367 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 179 flow [2023-08-29 20:20:18,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-29 20:20:18,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:18,367 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-29 20:20:18,383 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-29 20:20:18,583 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-29 20:20:18,583 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:18,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:18,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1938822814, now seen corresponding path program 1 times [2023-08-29 20:20:18,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:18,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921157582] [2023-08-29 20:20:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:18,585 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-29 20:20:18,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:18,586 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-29 20:20:18,589 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-29 20:20:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:18,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:20:18,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:19,415 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-29 20:20:19,415 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:19,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921157582] [2023-08-29 20:20:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921157582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:19,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:19,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:19,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006040762] [2023-08-29 20:20:19,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:19,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:20:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:19,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:20:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:20:19,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 279 [2023-08-29 20:20:19,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-29 20:20:19,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:19,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 279 [2023-08-29 20:20:19,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:20,295 INFO L130 PetriNetUnfolder]: 1135/1875 cut-off events. [2023-08-29 20:20:20,295 INFO L131 PetriNetUnfolder]: For 1515/1515 co-relation queries the response was YES. [2023-08-29 20:20:20,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5082 conditions, 1875 events. 1135/1875 cut-off events. For 1515/1515 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10092 event pairs, 87 based on Foata normal form. 2/1877 useless extension candidates. Maximal degree in co-relation 5071. Up to 1471 conditions per place. [2023-08-29 20:20:20,304 INFO L137 encePairwiseOnDemand]: 274/279 looper letters, 43 selfloop transitions, 4 changer transitions 17/69 dead transitions. [2023-08-29 20:20:20,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 420 flow [2023-08-29 20:20:20,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:20:20,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:20:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2023-08-29 20:20:20,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163679808841099 [2023-08-29 20:20:20,307 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 697 transitions. [2023-08-29 20:20:20,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions. [2023-08-29 20:20:20,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:20,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions. [2023-08-29 20:20:20,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 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-29 20:20:20,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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-29 20:20:20,315 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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-29 20:20:20,315 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 179 flow. Second operand 6 states and 697 transitions. [2023-08-29 20:20:20,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 420 flow [2023-08-29 20:20:20,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:20:20,323 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 172 flow [2023-08-29 20:20:20,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-29 20:20:20,324 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-29 20:20:20,324 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 172 flow [2023-08-29 20:20:20,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 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-29 20:20:20,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:20,325 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-29 20:20:20,337 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-29 20:20:20,536 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-29 20:20:20,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:20,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1906581730, now seen corresponding path program 2 times [2023-08-29 20:20:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:20,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933576700] [2023-08-29 20:20:20,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:20:20,538 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-29 20:20:20,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:20,539 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-29 20:20:20,542 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-29 20:20:20,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:20:20,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:20:20,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-29 20:20:20,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:21,292 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-29 20:20:21,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:21,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933576700] [2023-08-29 20:20:21,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933576700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:21,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:21,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:20:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902309290] [2023-08-29 20:20:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:21,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:20:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:20:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:20:21,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-29 20:20:21,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 172 flow. Second operand has 11 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 0 states have call successors, (0), 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-29 20:20:21,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:21,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-29 20:20:21,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:21,915 INFO L130 PetriNetUnfolder]: 1558/2581 cut-off events. [2023-08-29 20:20:21,915 INFO L131 PetriNetUnfolder]: For 1781/1781 co-relation queries the response was YES. [2023-08-29 20:20:21,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7017 conditions, 2581 events. 1558/2581 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14230 event pairs, 509 based on Foata normal form. 1/2563 useless extension candidates. Maximal degree in co-relation 7006. Up to 1163 conditions per place. [2023-08-29 20:20:21,928 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 68 selfloop transitions, 6 changer transitions 14/92 dead transitions. [2023-08-29 20:20:21,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 574 flow [2023-08-29 20:20:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:20:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:20:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-08-29 20:20:21,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468936678614098 [2023-08-29 20:20:21,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-08-29 20:20:21,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-08-29 20:20:21,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:21,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-08-29 20:20:21,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 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-29 20:20:21,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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-29 20:20:21,938 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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-29 20:20:21,938 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 172 flow. Second operand 6 states and 785 transitions. [2023-08-29 20:20:21,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 574 flow [2023-08-29 20:20:21,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 553 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-29 20:20:21,955 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 195 flow [2023-08-29 20:20:21,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-29 20:20:21,956 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-29 20:20:21,956 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 195 flow [2023-08-29 20:20:21,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 0 states have call successors, (0), 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-29 20:20:21,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:21,957 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-29 20:20:21,971 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 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:20:22,171 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-29 20:20:22,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:22,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash 854957060, now seen corresponding path program 3 times [2023-08-29 20:20:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:22,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937216607] [2023-08-29 20:20:22,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:20:22,173 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-29 20:20:22,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:22,174 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-29 20:20:22,175 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-29 20:20:22,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:20:22,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:20:22,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:20:22,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:22,417 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-29 20:20:22,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:22,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937216607] [2023-08-29 20:20:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937216607] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:22,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:22,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:22,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785938819] [2023-08-29 20:20:22,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:22,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:22,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:22,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-29 20:20:22,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-29 20:20:22,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:22,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-29 20:20:22,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:22,903 INFO L130 PetriNetUnfolder]: 2226/3606 cut-off events. [2023-08-29 20:20:22,903 INFO L131 PetriNetUnfolder]: For 3641/3641 co-relation queries the response was YES. [2023-08-29 20:20:22,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11217 conditions, 3606 events. 2226/3606 cut-off events. For 3641/3641 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20709 event pairs, 912 based on Foata normal form. 1/3594 useless extension candidates. Maximal degree in co-relation 11205. Up to 1342 conditions per place. [2023-08-29 20:20:22,918 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 43 selfloop transitions, 1 changer transitions 40/89 dead transitions. [2023-08-29 20:20:22,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 589 flow [2023-08-29 20:20:22,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:20:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:20:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2023-08-29 20:20:22,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47240143369175625 [2023-08-29 20:20:22,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2023-08-29 20:20:22,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2023-08-29 20:20:22,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:22,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2023-08-29 20:20:22,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 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-29 20:20:22,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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-29 20:20:22,928 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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-29 20:20:22,928 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 195 flow. Second operand 5 states and 659 transitions. [2023-08-29 20:20:22,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 589 flow [2023-08-29 20:20:22,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 577 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 20:20:22,966 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 198 flow [2023-08-29 20:20:22,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-08-29 20:20:22,967 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-08-29 20:20:22,967 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 198 flow [2023-08-29 20:20:22,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-29 20:20:22,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:22,968 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-29 20:20:22,979 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-29 20:20:23,178 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-29 20:20:23,179 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:23,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1796625220, now seen corresponding path program 4 times [2023-08-29 20:20:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:23,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238520691] [2023-08-29 20:20:23,180 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:20:23,180 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-29 20:20:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:23,182 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-29 20:20:23,186 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-29 20:20:23,307 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:20:23,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:20:23,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-29 20:20:23,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:24,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-29 20:20:24,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:24,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:24,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238520691] [2023-08-29 20:20:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238520691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:24,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:24,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:20:24,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536754169] [2023-08-29 20:20:24,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:24,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:20:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:24,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:20:24,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:20:24,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-29 20:20:24,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 198 flow. Second operand has 11 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 0 states have call successors, (0), 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-29 20:20:24,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:24,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-29 20:20:24,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:24,622 INFO L130 PetriNetUnfolder]: 1801/2941 cut-off events. [2023-08-29 20:20:24,622 INFO L131 PetriNetUnfolder]: For 3046/3058 co-relation queries the response was YES. [2023-08-29 20:20:24,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9255 conditions, 2941 events. 1801/2941 cut-off events. For 3046/3058 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16180 event pairs, 440 based on Foata normal form. 6/2901 useless extension candidates. Maximal degree in co-relation 9241. Up to 1123 conditions per place. [2023-08-29 20:20:24,635 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 65 selfloop transitions, 6 changer transitions 18/93 dead transitions. [2023-08-29 20:20:24,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 602 flow [2023-08-29 20:20:24,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:20:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:20:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-08-29 20:20:24,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468936678614098 [2023-08-29 20:20:24,638 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-08-29 20:20:24,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-08-29 20:20:24,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:24,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-08-29 20:20:24,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 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-29 20:20:24,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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-29 20:20:24,644 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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-29 20:20:24,644 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 198 flow. Second operand 6 states and 785 transitions. [2023-08-29 20:20:24,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 602 flow [2023-08-29 20:20:24,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 593 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:20:24,673 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 216 flow [2023-08-29 20:20:24,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-08-29 20:20:24,674 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2023-08-29 20:20:24,674 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 216 flow [2023-08-29 20:20:24,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 0 states have call successors, (0), 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-29 20:20:24,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:24,675 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-29 20:20:24,691 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-29 20:20:24,885 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-29 20:20:24,886 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:24,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -651485136, now seen corresponding path program 5 times [2023-08-29 20:20:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:24,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193371278] [2023-08-29 20:20:24,887 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:20:24,888 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-29 20:20:24,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:24,889 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-29 20:20:24,891 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-29 20:20:25,001 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:20:25,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:20:25,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:20:25,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:20:25,087 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-29 20:20:25,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:20:25,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:20:25,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193371278] [2023-08-29 20:20:25,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193371278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:25,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:25,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:25,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185716644] [2023-08-29 20:20:25,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:25,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:25,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:20:25,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:25,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-29 20:20:25,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-29 20:20:25,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:25,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-29 20:20:25,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:25,528 INFO L130 PetriNetUnfolder]: 2831/4682 cut-off events. [2023-08-29 20:20:25,528 INFO L131 PetriNetUnfolder]: For 5242/5270 co-relation queries the response was YES. [2023-08-29 20:20:25,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15314 conditions, 4682 events. 2831/4682 cut-off events. For 5242/5270 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 28305 event pairs, 748 based on Foata normal form. 29/4662 useless extension candidates. Maximal degree in co-relation 15300. Up to 2303 conditions per place. [2023-08-29 20:20:25,544 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 38 selfloop transitions, 1 changer transitions 49/92 dead transitions. [2023-08-29 20:20:25,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 625 flow [2023-08-29 20:20:25,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:20:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:20:25,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-29 20:20:25,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4752688172043011 [2023-08-29 20:20:25,546 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-29 20:20:25,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-29 20:20:25,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:25,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-29 20:20:25,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 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-29 20:20:25,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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-29 20:20:25,551 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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-29 20:20:25,551 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 216 flow. Second operand 5 states and 663 transitions. [2023-08-29 20:20:25,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 625 flow [2023-08-29 20:20:25,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 614 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 20:20:25,619 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 191 flow [2023-08-29 20:20:25,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2023-08-29 20:20:25,620 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2023-08-29 20:20:25,620 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 191 flow [2023-08-29 20:20:25,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 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-29 20:20:25,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:25,621 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-29 20:20:25,631 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-29 20:20:25,830 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-29 20:20:25,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:25,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1316085114, now seen corresponding path program 6 times [2023-08-29 20:20:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:20:25,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019487693] [2023-08-29 20:20:25,833 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 20:20:25,833 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-29 20:20:25,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:20:25,834 INFO L229 MonitoredProcess]: Starting monitored process 14 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-29 20:20:25,835 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 (14)] Waiting until timeout for monitored process [2023-08-29 20:20:25,991 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-29 20:20:25,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:20:25,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:20:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:20:26,152 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:20:26,152 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:20:26,153 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:20:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:20:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:20:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:20:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:20:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:20:26,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:20:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:20:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:20:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:20:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:20:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:20:26,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:20:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:20:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:20:26,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:20:26,177 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 (14)] Forceful destruction successful, exit code 0 [2023-08-29 20:20:26,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-29 20:20:26,369 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:26,373 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:20:26,374 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:20:26,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:20:26 BasicIcfg [2023-08-29 20:20:26,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:20:26,467 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:20:26,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:20:26,467 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:20:26,467 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:20:03" (3/4) ... [2023-08-29 20:20:26,469 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:20:26,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:20:26,470 INFO L158 Benchmark]: Toolchain (without parser) took 24600.48ms. Allocated memory was 69.2MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 42.3MB in the beginning and 665.6MB in the end (delta: -623.3MB). Peak memory consumption was 732.9MB. Max. memory is 16.1GB. [2023-08-29 20:20:26,470 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 69.2MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:20:26,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 624.13ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 42.1MB in the beginning and 65.4MB in the end (delta: -23.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-08-29 20:20:26,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.97ms. Allocated memory is still 94.4MB. Free memory was 65.4MB in the beginning and 62.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:20:26,471 INFO L158 Benchmark]: Boogie Preprocessor took 37.32ms. Allocated memory is still 94.4MB. Free memory was 62.6MB in the beginning and 60.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:20:26,471 INFO L158 Benchmark]: RCFGBuilder took 872.18ms. Allocated memory is still 94.4MB. Free memory was 60.1MB in the beginning and 46.3MB in the end (delta: 13.8MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2023-08-29 20:20:26,472 INFO L158 Benchmark]: TraceAbstraction took 22999.19ms. Allocated memory was 94.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 45.7MB in the beginning and 665.6MB in the end (delta: -619.8MB). Peak memory consumption was 711.5MB. Max. memory is 16.1GB. [2023-08-29 20:20:26,476 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 1.4GB. Free memory is still 665.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:20:26,477 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.18ms. Allocated memory is still 69.2MB. Free memory is still 47.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 624.13ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 42.1MB in the beginning and 65.4MB in the end (delta: -23.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.97ms. Allocated memory is still 94.4MB. Free memory was 65.4MB in the beginning and 62.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.32ms. Allocated memory is still 94.4MB. Free memory was 62.6MB in the beginning and 60.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 872.18ms. Allocated memory is still 94.4MB. Free memory was 60.1MB in the beginning and 46.3MB in the end (delta: 13.8MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22999.19ms. Allocated memory was 94.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 45.7MB in the beginning and 665.6MB in the end (delta: -619.8MB). Peak memory consumption was 711.5MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 1.4GB. Free memory is still 665.6MB. 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.2s, 151 PlacesBefore, 54 PlacesAfterwards, 140 TransitionsBefore, 42 TransitionsAfterwards, 3506 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 10529 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3926, independent: 3675, independent conditional: 0, independent unconditional: 3675, dependent: 251, dependent conditional: 0, dependent unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1755, independent: 1715, independent conditional: 0, independent unconditional: 1715, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3926, independent: 1960, independent conditional: 0, independent unconditional: 1960, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 1755, unknown conditional: 0, unknown unconditional: 1755] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=0, t489={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=1, t489={3:0}, t490={-2147483641:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=2, t489={3:0}, t490={-2147483641:0}, t491={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=3, t489={3:0}, t490={-2147483641:0}, t491={-2147483645:0}, t492={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={3:0}, t490={-2147483641:0}, t491={-2147483645:0}, t492={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] 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=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that 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: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: 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, 181 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: 22.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 615 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2404 IncrementalHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 11 mSDtfsCounter, 2404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=11, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 240 ConstructedInterpolants, 19 QuantifiedInterpolants, 2816 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1940 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:20:26,497 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