./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix037_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/mix037_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 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --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:25:35,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:25:35,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:25:35,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:25:35,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:25:35,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:25:35,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:25:35,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:25:35,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:25:35,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:25:35,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:25:35,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:25:35,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:25:35,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:25:35,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:25:35,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:25:35,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:25:35,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:25:35,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:25:35,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:25:35,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:25:35,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:25:35,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:25:35,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:25:35,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:25:35,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:25:35,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:25:35,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:25:35,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:25:35,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:25:35,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:25:35,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:25:35,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:25:35,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:25:35,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:25:35,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:25:35,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:25:35,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:25:35,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:25:35,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:25:35,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:25:35,414 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:25:35,435 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:25:35,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:25:35,436 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:25:35,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:25:35,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:25:35,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:25:35,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:25:35,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:25:35,438 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:25:35,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:25:35,438 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:25:35,439 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:25:35,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:25:35,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:25:35,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:25:35,439 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:25:35,440 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:25:35,440 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:25:35,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:25:35,440 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:25:35,441 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:25:35,441 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:25:35,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:25:35,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:25:35,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:25:35,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:25:35,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:25:35,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:25:35,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:25:35,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:25:35,443 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:25:35,443 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:25:35,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:25:35,443 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:25:35,444 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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 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:25:35,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:25:35,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:25:35,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:25:35,733 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:25:35,733 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:25:35,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2023-08-29 20:25:36,838 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:25:37,110 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:25:37,110 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2023-08-29 20:25:37,124 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee15e2b0/717fd3ec391942268fd940b90b472268/FLAG9d7c26297 [2023-08-29 20:25:37,138 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dee15e2b0/717fd3ec391942268fd940b90b472268 [2023-08-29 20:25:37,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:25:37,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:25:37,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:25:37,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:25:37,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:25:37,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f6f38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37, skipping insertion in model container [2023-08-29 20:25:37,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:25:37,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:25:37,369 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/mix037_tso.oepc.i[949,962] [2023-08-29 20:25:37,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:25:37,594 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:25:37,606 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/mix037_tso.oepc.i[949,962] [2023-08-29 20:25:37,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:25:37,727 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:25:37,727 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:25:37,733 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:25:37,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37 WrapperNode [2023-08-29 20:25:37,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:25:37,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:25:37,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:25:37,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:25:37,741 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:25:37" (1/1) ... [2023-08-29 20:25:37,772 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:25:37" (1/1) ... [2023-08-29 20:25:37,812 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-08-29 20:25:37,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:25:37,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:25:37,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:25:37,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:25:37,823 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,865 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,866 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:25:37,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:25:37,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:25:37,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:25:37,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (1/1) ... [2023-08-29 20:25:37,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:25:37,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:25:37,904 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:25:37,925 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:25:37,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:25:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:25:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:25:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:25:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:25:37,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:25:37,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:25:37,940 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:25:37,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:25:37,940 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:25:37,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:25:37,940 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:25:37,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:25:37,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:25:37,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:25:37,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:25:37,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:25:37,942 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:25:38,060 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:25:38,061 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:25:38,447 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:25:38,611 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:25:38,612 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:25:38,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:25:38 BoogieIcfgContainer [2023-08-29 20:25:38,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:25:38,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:25:38,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:25:38,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:25:38,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:25:37" (1/3) ... [2023-08-29 20:25:38,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a563103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:25:38, skipping insertion in model container [2023-08-29 20:25:38,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:25:37" (2/3) ... [2023-08-29 20:25:38,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a563103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:25:38, skipping insertion in model container [2023-08-29 20:25:38,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:25:38" (3/3) ... [2023-08-29 20:25:38,624 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2023-08-29 20:25:38,638 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:25:38,638 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:25:38,639 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:25:38,706 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:25:38,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 310 flow [2023-08-29 20:25:38,825 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-29 20:25:38,825 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:25:38,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:25:38,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 145 transitions, 310 flow [2023-08-29 20:25:38,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 141 transitions, 294 flow [2023-08-29 20:25:38,842 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:25:38,854 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-29 20:25:38,857 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 141 transitions, 294 flow [2023-08-29 20:25:38,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 294 flow [2023-08-29 20:25:38,907 INFO L130 PetriNetUnfolder]: 2/141 cut-off events. [2023-08-29 20:25:38,908 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:25:38,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 2/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:25:38,913 INFO L119 LiptonReduction]: Number of co-enabled transitions 3618 [2023-08-29 20:25:43,409 INFO L134 LiptonReduction]: Checked pairs total: 10563 [2023-08-29 20:25:43,409 INFO L136 LiptonReduction]: Total number of compositions: 132 [2023-08-29 20:25:43,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:25:43,427 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;@2e7c3609, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:25:43,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:25:43,429 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:25:43,429 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:25:43,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:43,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:25:43,430 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:25:43,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash 608, now seen corresponding path program 1 times [2023-08-29 20:25:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:43,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543019701] [2023-08-29 20:25:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:43,527 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:25:43,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:43,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543019701] [2023-08-29 20:25:43,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543019701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:43,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:43,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:25:43,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793489317] [2023-08-29 20:25:43,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:43,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:25:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:25:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:25:43,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 277 [2023-08-29 20:25:43,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:43,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:43,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 277 [2023-08-29 20:25:43,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:44,738 INFO L130 PetriNetUnfolder]: 6949/9677 cut-off events. [2023-08-29 20:25:44,739 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-29 20:25:44,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19291 conditions, 9677 events. 6949/9677 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 52423 event pairs, 6949 based on Foata normal form. 0/8347 useless extension candidates. Maximal degree in co-relation 19279. Up to 9399 conditions per place. [2023-08-29 20:25:44,812 INFO L137 encePairwiseOnDemand]: 268/277 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-29 20:25:44,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-29 20:25:44,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:25:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:25:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-29 20:25:44,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5342960288808665 [2023-08-29 20:25:44,831 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-29 20:25:44,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-29 20:25:44,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:44,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-29 20:25:44,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:25:44,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states 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:25:44,846 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states 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:25:44,847 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 296 transitions. [2023-08-29 20:25:44,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-29 20:25:44,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:25:44,855 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-29 20:25:44,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-29 20:25:44,861 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:25:44,861 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-29 20:25:44,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:44,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:44,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:25:44,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:25:44,866 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:25:44,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash 576163604, now seen corresponding path program 1 times [2023-08-29 20:25:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:44,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656297393] [2023-08-29 20:25:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:44,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:45,157 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:25:45,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:45,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656297393] [2023-08-29 20:25:45,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656297393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:45,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:45,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:25:45,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847666875] [2023-08-29 20:25:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:45,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:25:45,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:45,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:25:45,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:25:45,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 277 [2023-08-29 20:25:45,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:25:45,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:45,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 277 [2023-08-29 20:25:45,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:46,007 INFO L130 PetriNetUnfolder]: 5463/7617 cut-off events. [2023-08-29 20:25:46,008 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:25:46,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15214 conditions, 7617 events. 5463/7617 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 39509 event pairs, 2045 based on Foata normal form. 0/7056 useless extension candidates. Maximal degree in co-relation 15211. Up to 5923 conditions per place. [2023-08-29 20:25:46,048 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-29 20:25:46,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 202 flow [2023-08-29 20:25:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:25:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:25:46,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-29 20:25:46,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210589651022864 [2023-08-29 20:25:46,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-29 20:25:46,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-29 20:25:46,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:46,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-29 20:25:46,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states 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:25:46,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states 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:25:46,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states 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:25:46,055 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 433 transitions. [2023-08-29 20:25:46,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 202 flow [2023-08-29 20:25:46,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:25:46,057 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-29 20:25:46,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-29 20:25:46,058 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-29 20:25:46,058 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-29 20:25:46,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states 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:25:46,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:46,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:46,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:25:46,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:25:46,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:46,059 INFO L85 PathProgramCache]: Analyzing trace with hash -245924148, now seen corresponding path program 1 times [2023-08-29 20:25:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:46,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274581574] [2023-08-29 20:25:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:46,907 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:25:46,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:46,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274581574] [2023-08-29 20:25:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274581574] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:46,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:25:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950763523] [2023-08-29 20:25:46,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:46,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:25:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:46,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:25:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:25:47,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 277 [2023-08-29 20:25:47,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:25:47,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:47,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 277 [2023-08-29 20:25:47,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:48,074 INFO L130 PetriNetUnfolder]: 4903/7004 cut-off events. [2023-08-29 20:25:48,074 INFO L131 PetriNetUnfolder]: For 438/438 co-relation queries the response was YES. [2023-08-29 20:25:48,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14291 conditions, 7004 events. 4903/7004 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 37110 event pairs, 616 based on Foata normal form. 0/7004 useless extension candidates. Maximal degree in co-relation 14287. Up to 3888 conditions per place. [2023-08-29 20:25:48,108 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 51 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-29 20:25:48,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 250 flow [2023-08-29 20:25:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:25:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:25:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 842 transitions. [2023-08-29 20:25:48,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43424445590510574 [2023-08-29 20:25:48,111 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 842 transitions. [2023-08-29 20:25:48,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 842 transitions. [2023-08-29 20:25:48,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:48,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 842 transitions. [2023-08-29 20:25:48,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states 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:25:48,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:25:48,117 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:25:48,117 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 7 states and 842 transitions. [2023-08-29 20:25:48,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 250 flow [2023-08-29 20:25:48,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:25:48,119 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 76 flow [2023-08-29 20:25:48,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=76, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-29 20:25:48,120 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-08-29 20:25:48,120 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 76 flow [2023-08-29 20:25:48,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states 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:25:48,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:48,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:48,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:25:48,121 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:25:48,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash -245924192, now seen corresponding path program 1 times [2023-08-29 20:25:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:48,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628198033] [2023-08-29 20:25:48,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:48,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:48,332 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:25:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:48,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628198033] [2023-08-29 20:25:48,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628198033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:48,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:48,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:25:48,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875498641] [2023-08-29 20:25:48,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:48,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:25:48,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:48,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:25:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:25:48,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 277 [2023-08-29 20:25:48,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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:25:48,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:48,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 277 [2023-08-29 20:25:48,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:49,036 INFO L130 PetriNetUnfolder]: 4855/6960 cut-off events. [2023-08-29 20:25:49,036 INFO L131 PetriNetUnfolder]: For 228/228 co-relation queries the response was YES. [2023-08-29 20:25:49,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14163 conditions, 6960 events. 4855/6960 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 37398 event pairs, 1527 based on Foata normal form. 320/7259 useless extension candidates. Maximal degree in co-relation 14159. Up to 3761 conditions per place. [2023-08-29 20:25:49,073 INFO L137 encePairwiseOnDemand]: 273/277 looper letters, 34 selfloop transitions, 2 changer transitions 23/63 dead transitions. [2023-08-29 20:25:49,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 264 flow [2023-08-29 20:25:49,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:25:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:25:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 696 transitions. [2023-08-29 20:25:49,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025270758122744 [2023-08-29 20:25:49,076 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 696 transitions. [2023-08-29 20:25:49,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 696 transitions. [2023-08-29 20:25:49,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:49,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 696 transitions. [2023-08-29 20:25:49,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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:25:49,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states 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:25:49,081 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states 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:25:49,081 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 76 flow. Second operand 5 states and 696 transitions. [2023-08-29 20:25:49,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 264 flow [2023-08-29 20:25:49,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 254 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 20:25:49,084 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 79 flow [2023-08-29 20:25:49,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=79, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2023-08-29 20:25:49,085 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-29 20:25:49,085 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 79 flow [2023-08-29 20:25:49,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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:25:49,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:49,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:49,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:25:49,086 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:25:49,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:49,086 INFO L85 PathProgramCache]: Analyzing trace with hash -141900912, now seen corresponding path program 1 times [2023-08-29 20:25:49,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:49,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952593901] [2023-08-29 20:25:49,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:49,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:49,569 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:25:49,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952593901] [2023-08-29 20:25:49,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952593901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:49,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:49,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:25:49,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675007316] [2023-08-29 20:25:49,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:49,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:25:49,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:25:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:25:49,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 277 [2023-08-29 20:25:49,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:25:49,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:49,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 277 [2023-08-29 20:25:49,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:50,422 INFO L130 PetriNetUnfolder]: 4915/6924 cut-off events. [2023-08-29 20:25:50,423 INFO L131 PetriNetUnfolder]: For 1348/1358 co-relation queries the response was YES. [2023-08-29 20:25:50,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14678 conditions, 6924 events. 4915/6924 cut-off events. For 1348/1358 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 35355 event pairs, 2555 based on Foata normal form. 244/7138 useless extension candidates. Maximal degree in co-relation 14671. Up to 6001 conditions per place. [2023-08-29 20:25:50,474 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 35 selfloop transitions, 5 changer transitions 19/63 dead transitions. [2023-08-29 20:25:50,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 273 flow [2023-08-29 20:25:50,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:25:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:25:50,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2023-08-29 20:25:50,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061371841155234 [2023-08-29 20:25:50,477 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2023-08-29 20:25:50,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2023-08-29 20:25:50,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:50,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2023-08-29 20:25:50,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 states 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:25:50,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states 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:25:50,483 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states 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:25:50,483 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 79 flow. Second operand 5 states and 701 transitions. [2023-08-29 20:25:50,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 273 flow [2023-08-29 20:25:50,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 265 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-29 20:25:50,510 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 116 flow [2023-08-29 20:25:50,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, 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:25:50,512 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-29 20:25:50,512 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 116 flow [2023-08-29 20:25:50,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:25:50,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:50,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:50,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:25:50,513 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:25:50,514 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash -103999009, now seen corresponding path program 1 times [2023-08-29 20:25:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276745149] [2023-08-29 20:25:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:50,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:51,323 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:25:51,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:51,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276745149] [2023-08-29 20:25:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276745149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:51,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:25:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119722635] [2023-08-29 20:25:51,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:51,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:25:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:51,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:25:51,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:25:51,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-29 20:25:51,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:51,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:51,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-29 20:25:51,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:52,781 INFO L130 PetriNetUnfolder]: 12585/16994 cut-off events. [2023-08-29 20:25:52,781 INFO L131 PetriNetUnfolder]: For 8753/8753 co-relation queries the response was YES. [2023-08-29 20:25:52,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43993 conditions, 16994 events. 12585/16994 cut-off events. For 8753/8753 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 82888 event pairs, 3953 based on Foata normal form. 562/17556 useless extension candidates. Maximal degree in co-relation 43985. Up to 13574 conditions per place. [2023-08-29 20:25:52,910 INFO L137 encePairwiseOnDemand]: 264/277 looper letters, 61 selfloop transitions, 14 changer transitions 39/114 dead transitions. [2023-08-29 20:25:52,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 114 transitions, 610 flow [2023-08-29 20:25:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:25:52,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:25:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2023-08-29 20:25:52,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47343991748323877 [2023-08-29 20:25:52,914 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2023-08-29 20:25:52,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2023-08-29 20:25:52,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:52,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2023-08-29 20:25:53,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 states 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:25:53,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:25:53,079 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:25:53,079 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 116 flow. Second operand 7 states and 918 transitions. [2023-08-29 20:25:53,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 114 transitions, 610 flow [2023-08-29 20:25:53,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 114 transitions, 603 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:25:53,121 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 243 flow [2023-08-29 20:25:53,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-29 20:25:53,122 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-29 20:25:53,122 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 243 flow [2023-08-29 20:25:53,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:53,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:53,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:25:53,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:25:53,124 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:25:53,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash -103335919, now seen corresponding path program 2 times [2023-08-29 20:25:53,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:53,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352521904] [2023-08-29 20:25:53,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:53,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:53,548 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:25:53,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352521904] [2023-08-29 20:25:53,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352521904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:53,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:53,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:25:53,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067296077] [2023-08-29 20:25:53,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:53,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:25:53,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:53,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:25:53,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:25:53,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-29 20:25:53,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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:25:53,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:53,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-29 20:25:53,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:54,782 INFO L130 PetriNetUnfolder]: 10913/15164 cut-off events. [2023-08-29 20:25:54,782 INFO L131 PetriNetUnfolder]: For 32330/33697 co-relation queries the response was YES. [2023-08-29 20:25:54,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53736 conditions, 15164 events. 10913/15164 cut-off events. For 32330/33697 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 81655 event pairs, 4290 based on Foata normal form. 538/14984 useless extension candidates. Maximal degree in co-relation 53724. Up to 10791 conditions per place. [2023-08-29 20:25:54,889 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 58 selfloop transitions, 11 changer transitions 20/97 dead transitions. [2023-08-29 20:25:54,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 97 transitions, 658 flow [2023-08-29 20:25:54,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:25:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:25:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2023-08-29 20:25:54,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49879663056558365 [2023-08-29 20:25:54,891 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2023-08-29 20:25:54,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2023-08-29 20:25:54,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:54,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2023-08-29 20:25:54,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:25:54,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states 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:25:54,896 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states 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:25:54,896 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 243 flow. Second operand 6 states and 829 transitions. [2023-08-29 20:25:54,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 97 transitions, 658 flow [2023-08-29 20:25:55,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 646 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-29 20:25:55,072 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 341 flow [2023-08-29 20:25:55,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=341, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-29 20:25:55,073 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-08-29 20:25:55,073 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 341 flow [2023-08-29 20:25:55,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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:25:55,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:55,073 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:25:55,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:25:55,074 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:25:55,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 91793739, now seen corresponding path program 1 times [2023-08-29 20:25:55,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:55,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695262375] [2023-08-29 20:25:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:55,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:55,546 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:25:55,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695262375] [2023-08-29 20:25:55,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695262375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:55,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:55,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:25:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477919139] [2023-08-29 20:25:55,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:55,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:25:55,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:55,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:25:55,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:25:55,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-29 20:25:55,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:25:55,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:55,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-29 20:25:55,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:56,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= 2 .cse7) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 0) (= 0 v_~__unbuffered_p3_EBX~0_14))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, 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_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} 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][66], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 88#L834true, 14#L785true, 233#(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))), 210#true, 159#true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 85#L893true, P0Thread1of1ForFork1InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork0InUse, 46#P2EXITtrue, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 215#(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))), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:25:56,793 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,793 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,793 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,793 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,794 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][22], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 88#L834true, 14#L785true, 210#true, 108#L876true, 159#true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P0Thread1of1ForFork1InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork0InUse, 46#P2EXITtrue, P1Thread1of1ForFork3InUse, 127#L765true, 226#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 215#(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))), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:25:56,794 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,794 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,794 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,794 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,794 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][64], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 14#L785true, 210#true, 108#L876true, 159#true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P0Thread1of1ForFork1InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork0InUse, 46#P2EXITtrue, P1Thread1of1ForFork3InUse, 226#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, Black: 215#(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))), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:25:56,794 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,795 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,795 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,795 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-29 20:25:56,941 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([496] L876-->L893: Formula: (let ((.cse4 (= (mod v_~x$r_buff1_thd0~0_68 256) 0)) (.cse8 (= (mod v_~x$r_buff0_thd0~0_70 256) 0))) (let ((.cse9 (not .cse8)) (.cse13 (= (mod v_~x$w_buff0_used~0_174 256) 0)) (.cse5 (and .cse8 .cse4)) (.cse6 (and .cse8 (= 0 (mod v_~x$w_buff1_used~0_147 256))))) (let ((.cse11 (or .cse13 .cse5 .cse6)) (.cse12 (and (not .cse13) .cse9))) (let ((.cse7 (ite .cse11 v_~x~0_100 (ite .cse12 v_~x$w_buff0~0_91 v_~x$w_buff1~0_70))) (.cse2 (= (mod v_~x$w_buff1_used~0_146 256) 0)) (.cse1 (= (mod v_~x$w_buff0_used~0_173 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_34 256) 0)))) (and (= v_~x$r_buff1_thd0~0_67 (ite .cse0 v_~x$r_buff1_thd0~0_68 (ite (let ((.cse3 (= (mod v_~x$r_buff0_thd0~0_69 256) 0))) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4))) v_~x$r_buff1_thd0~0_68 0))) (= v_~x$w_buff1~0_69 v_~x$w_buff1~0_70) (= v_~x$mem_tmp~0_24 v_~x~0_100) (= v_~x$w_buff1_used~0_146 (ite .cse0 v_~x$w_buff1_used~0_147 (ite (or .cse1 .cse5 .cse6) v_~x$w_buff1_used~0_147 0))) (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_16 1) (= 2 .cse7) (= v_~__unbuffered_p1_EAX~0_16 0) (= v_~__unbuffered_p2_EAX~0_16 0) (= 0 v_~__unbuffered_p3_EBX~0_14))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_16) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$mem_tmp~0_24 .cse7) v_~x~0_99) (= (ite .cse0 v_~x$r_buff0_thd0~0_70 (ite (or .cse1 .cse5 (and .cse2 .cse8)) v_~x$r_buff0_thd0~0_70 (ite (and (not .cse1) .cse9) 0 v_~x$r_buff0_thd0~0_70))) v_~x$r_buff0_thd0~0_69) (= v_~x$flush_delayed~0_33 0) (= (let ((.cse10 (mod (mod v_~main$tmp_guard1~0_16 256) 4294967296))) (ite (<= .cse10 2147483647) .cse10 (+ .cse10 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= (ite .cse0 v_~x$w_buff0_used~0_174 (ite .cse11 v_~x$w_buff0_used~0_174 (ite .cse12 0 v_~x$w_buff0_used~0_174))) v_~x$w_buff0_used~0_173)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_70, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~x$w_buff1~0=v_~x$w_buff1~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_147, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_68, ~x~0=v_~x~0_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_174} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_69, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_69, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_67, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_33|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_173, ~weak$$choice0~0=v_~weak$$choice0~0_15, 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_16, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~x~0=v_~x~0_99} 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][66], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 24#L788true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 233#(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))), 88#L834true, 210#true, 159#true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 85#L893true, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 46#P2EXITtrue, P1Thread1of1ForFork3InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, P2Thread1of1ForFork2InUse, Black: 215#(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))), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:25:56,941 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,941 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,941 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,941 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,941 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L758-->L765: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd1~0_26 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_28 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_127 256) 0)))) (let ((.cse1 (and .cse5 .cse2)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_128 256) 0)))) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_115 256) 0))))) (and (= v_~x$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_115)) (= v_~x$r_buff1_thd1~0_25 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_27 256) 0)) .cse2) (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3)) 0 v_~x$r_buff1_thd1~0_26)) (= v_~x$w_buff0_used~0_127 (ite .cse4 0 v_~x$w_buff0_used~0_128)) (= v_~x$r_buff0_thd1~0_27 (ite .cse1 0 v_~x$r_buff0_thd1~0_28)) (= v_~x~0_71 (ite .cse4 v_~x$w_buff0~0_52 (ite .cse0 v_~x$w_buff1~0_41 v_~x~0_72)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_28, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_26, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_128} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_52, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_127} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][22], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 24#L788true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 88#L834true, 210#true, 108#L876true, 159#true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P0Thread1of1ForFork1InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork0InUse, 46#P2EXITtrue, P1Thread1of1ForFork3InUse, 127#L765true, 226#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 215#(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))), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:25:56,942 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,942 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,942 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,942 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][64], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 8#L841true, 24#L788true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 210#true, 108#L876true, 159#true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P0Thread1of1ForFork1InUse, Black: 176#(= ~__unbuffered_p3_EAX~0 0), P3Thread1of1ForFork0InUse, 46#P2EXITtrue, P1Thread1of1ForFork3InUse, 226#(and (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 68#L758true, P2Thread1of1ForFork2InUse, Black: 215#(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))), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-29 20:25:56,942 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,943 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,943 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:56,943 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:25:57,270 INFO L130 PetriNetUnfolder]: 11623/16242 cut-off events. [2023-08-29 20:25:57,270 INFO L131 PetriNetUnfolder]: For 47673/49466 co-relation queries the response was YES. [2023-08-29 20:25:57,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63781 conditions, 16242 events. 11623/16242 cut-off events. For 47673/49466 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 88429 event pairs, 6927 based on Foata normal form. 577/16426 useless extension candidates. Maximal degree in co-relation 63767. Up to 11071 conditions per place. [2023-08-29 20:25:57,408 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 50 selfloop transitions, 12 changer transitions 20/90 dead transitions. [2023-08-29 20:25:57,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 728 flow [2023-08-29 20:25:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:25:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:25:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions. [2023-08-29 20:25:57,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49458483754512633 [2023-08-29 20:25:57,413 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 822 transitions. [2023-08-29 20:25:57,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions. [2023-08-29 20:25:57,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:57,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions. [2023-08-29 20:25:57,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 states 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:25:57,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states 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:25:57,424 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states 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:25:57,424 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 341 flow. Second operand 6 states and 822 transitions. [2023-08-29 20:25:57,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 728 flow [2023-08-29 20:25:57,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 688 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-29 20:25:57,495 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 400 flow [2023-08-29 20:25:57,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-08-29 20:25:57,496 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-08-29 20:25:57,496 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 400 flow [2023-08-29 20:25:57,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:25:57,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:57,496 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:25:57,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:25:57,497 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:25:57,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1629237373, now seen corresponding path program 1 times [2023-08-29 20:25:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:57,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527583553] [2023-08-29 20:25:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:25:58,078 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:25:58,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:25:58,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527583553] [2023-08-29 20:25:58,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527583553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:25:58,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:25:58,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:25:58,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818877007] [2023-08-29 20:25:58,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:25:58,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:25:58,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:25:58,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:25:58,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:25:58,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 277 [2023-08-29 20:25:58,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 400 flow. Second operand has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states 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:25:58,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:25:58,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 277 [2023-08-29 20:25:58,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:25:59,648 INFO L130 PetriNetUnfolder]: 12570/17559 cut-off events. [2023-08-29 20:25:59,648 INFO L131 PetriNetUnfolder]: For 93210/97585 co-relation queries the response was YES. [2023-08-29 20:25:59,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78814 conditions, 17559 events. 12570/17559 cut-off events. For 93210/97585 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 98328 event pairs, 3527 based on Foata normal form. 561/17408 useless extension candidates. Maximal degree in co-relation 78798. Up to 11560 conditions per place. [2023-08-29 20:25:59,782 INFO L137 encePairwiseOnDemand]: 268/277 looper letters, 86 selfloop transitions, 15 changer transitions 27/136 dead transitions. [2023-08-29 20:25:59,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 136 transitions, 1240 flow [2023-08-29 20:25:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:25:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:25:59,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1109 transitions. [2023-08-29 20:25:59,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004512635379061 [2023-08-29 20:25:59,786 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1109 transitions. [2023-08-29 20:25:59,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1109 transitions. [2023-08-29 20:25:59,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:25:59,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1109 transitions. [2023-08-29 20:25:59,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.625) internal successors, (1109), 8 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states 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:25:59,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states 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:25:59,792 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states 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:25:59,792 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 400 flow. Second operand 8 states and 1109 transitions. [2023-08-29 20:25:59,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 136 transitions, 1240 flow [2023-08-29 20:25:59,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 136 transitions, 1171 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-08-29 20:25:59,912 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 539 flow [2023-08-29 20:25:59,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=539, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-08-29 20:25:59,912 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2023-08-29 20:25:59,912 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 539 flow [2023-08-29 20:25:59,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states 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:25:59,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:25:59,913 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:25:59,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:25:59,913 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:25:59,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:25:59,914 INFO L85 PathProgramCache]: Analyzing trace with hash -537764592, now seen corresponding path program 1 times [2023-08-29 20:25:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:25:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778314594] [2023-08-29 20:25:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:25:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:25:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:00,116 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:26:00,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:00,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778314594] [2023-08-29 20:26:00,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778314594] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:00,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:00,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:00,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932956157] [2023-08-29 20:26:00,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:00,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:00,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:00,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:00,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:00,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:26:00,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 539 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:26:00,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:00,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:26:00,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:01,258 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([542] L869-->L876: Formula: (let ((.cse0 (not (= (mod v_~x$r_buff1_thd0~0_80 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_185 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_80 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_186 256) 0)))) (.cse4 (and .cse5 .cse1)) (.cse3 (and (not (= (mod v_~x$w_buff1_used~0_157 256) 0)) .cse0))) (and (= v_~x$r_buff1_thd0~0_79 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_156 256) 0))) (and (not (= 0 (mod v_~x$r_buff0_thd0~0_79 256))) .cse1)) 0 v_~x$r_buff1_thd0~0_80)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| 0)) (= v_~x$w_buff0_used~0_185 (ite .cse2 0 v_~x$w_buff0_used~0_186)) (= (ite .cse2 v_~x$w_buff0~0_100 (ite .cse3 v_~x$w_buff1~0_79 v_~x~0_110)) v_~x~0_109) (= v_~x$r_buff0_thd0~0_79 (ite .cse4 0 v_~x$r_buff0_thd0~0_80)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|) (= (ite (or .cse4 .cse3) 0 v_~x$w_buff1_used~0_157) v_~x$w_buff1_used~0_156)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_100, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_80, ~x$w_buff1~0=v_~x$w_buff1~0_79, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_157, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ~x~0=v_~x~0_110, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_186, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_100, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_79, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~x$w_buff1~0=v_~x$w_buff1~0_79, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_79, ~x~0=v_~x~0_109, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_185, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0][100], [Black: 246#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 240#true, 88#L834true, 50#L808true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P0Thread1of1ForFork1InUse, 257#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 108#L876true, 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 248#(and (= ~x$w_buff1_used~0 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))), 127#L765true, 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: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:01,259 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,259 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,259 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,259 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,259 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][124], [Black: 246#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 240#true, 50#L808true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, 257#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 248#(and (= ~x$w_buff1_used~0 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))), 127#L765true, 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: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:01,259 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,259 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,259 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,259 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,260 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][77], [Black: 246#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 240#true, 88#L834true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, 257#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork2InUse, Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 248#(and (= ~x$w_buff1_used~0 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))), 127#L765true, 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: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:01,260 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,260 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,260 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,260 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,266 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][135], [Black: 246#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 240#true, 50#L808true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 248#(and (= ~x$w_buff1_used~0 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))), 127#L765true, 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: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:01,266 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,266 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,267 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,267 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,267 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 246#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 240#true, 88#L834true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 248#(and (= ~x$w_buff1_used~0 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))), 127#L765true, 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: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:01,267 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,267 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,267 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,267 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,270 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][135], [Black: 246#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, 240#true, 50#L808true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 95#L795true, Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 248#(and (= ~x$w_buff1_used~0 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))), 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: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:01,270 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,270 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,270 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,271 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 246#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, 240#true, 88#L834true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 95#L795true, Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 248#(and (= ~x$w_buff1_used~0 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))), 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: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:01,273 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,273 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,273 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,273 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:01,348 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][135], [Black: 246#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, 240#true, 50#L808true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 248#(and (= ~x$w_buff1_used~0 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))), 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: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:01,348 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:26:01,348 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:01,348 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:01,348 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:01,348 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][134], [Black: 246#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, 240#true, 88#L834true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 248#(and (= ~x$w_buff1_used~0 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))), 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: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:01,348 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:26:01,348 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:01,348 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:01,349 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:01,483 INFO L130 PetriNetUnfolder]: 8918/12672 cut-off events. [2023-08-29 20:26:01,483 INFO L131 PetriNetUnfolder]: For 141645/146705 co-relation queries the response was YES. [2023-08-29 20:26:01,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64660 conditions, 12672 events. 8918/12672 cut-off events. For 141645/146705 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 72895 event pairs, 1970 based on Foata normal form. 1817/13927 useless extension candidates. Maximal degree in co-relation 64640. Up to 7207 conditions per place. [2023-08-29 20:26:01,573 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 152 selfloop transitions, 10 changer transitions 0/174 dead transitions. [2023-08-29 20:26:01,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 174 transitions, 1947 flow [2023-08-29 20:26:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:01,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:01,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-08-29 20:26:01,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49747292418772565 [2023-08-29 20:26:01,575 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-08-29 20:26:01,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-08-29 20:26:01,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:01,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-08-29 20:26:01,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:01,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states 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:26:01,579 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states 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:26:01,579 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 539 flow. Second operand 5 states and 689 transitions. [2023-08-29 20:26:01,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 174 transitions, 1947 flow [2023-08-29 20:26:01,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 174 transitions, 1693 flow, removed 103 selfloop flow, removed 5 redundant places. [2023-08-29 20:26:01,689 INFO L231 Difference]: Finished difference. Result has 67 places, 71 transitions, 546 flow [2023-08-29 20:26:01,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=546, PETRI_PLACES=67, PETRI_TRANSITIONS=71} [2023-08-29 20:26:01,689 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 14 predicate places. [2023-08-29 20:26:01,690 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 71 transitions, 546 flow [2023-08-29 20:26:01,690 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:26:01,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:01,690 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:26:01,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:26:01,690 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:26:01,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:01,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1773071599, now seen corresponding path program 1 times [2023-08-29 20:26:01,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:01,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402581060] [2023-08-29 20:26:01,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:01,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:01,882 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:26:01,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:01,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402581060] [2023-08-29 20:26:01,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402581060] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:01,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:01,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:01,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692334737] [2023-08-29 20:26:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:01,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:01,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:26:01,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 546 flow. Second operand has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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:26:01,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:01,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:26:01,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:02,732 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][138], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 50#L808true, Black: 259#(= ~__unbuffered_cnt~0 0), 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, 257#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), 127#L765true, Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,732 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,732 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,732 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,732 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,733 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 88#L834true, Black: 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, 257#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), 127#L765true, Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,733 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,733 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,733 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,733 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,735 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][138], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 50#L808true, Black: 259#(= ~__unbuffered_cnt~0 0), 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), 127#L765true, Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,736 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,736 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,736 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,736 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,736 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 88#L834true, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), 127#L765true, Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,736 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,736 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,736 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,736 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,740 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][138], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 50#L808true, Black: 259#(= ~__unbuffered_cnt~0 0), 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 95#L795true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,740 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,740 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,740 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,740 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,740 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, 88#L834true, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 95#L795true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,740 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,740 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,740 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,740 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:02,781 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][201], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, Black: 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 50#L808true, Black: 259#(= ~__unbuffered_cnt~0 0), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, 257#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,781 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,781 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,781 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,781 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,782 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][199], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, 88#L834true, Black: 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, 257#true, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,782 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,782 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,782 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,782 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,784 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][201], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 50#L808true, Black: 259#(= ~__unbuffered_cnt~0 0), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,784 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,784 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,784 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,784 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,784 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][199], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, 88#L834true, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, 61#L869true, P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:02,784 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,785 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,785 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,785 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:02,870 INFO L130 PetriNetUnfolder]: 6573/9584 cut-off events. [2023-08-29 20:26:02,870 INFO L131 PetriNetUnfolder]: For 93864/98575 co-relation queries the response was YES. [2023-08-29 20:26:02,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48880 conditions, 9584 events. 6573/9584 cut-off events. For 93864/98575 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 56225 event pairs, 878 based on Foata normal form. 1418/10539 useless extension candidates. Maximal degree in co-relation 48860. Up to 3794 conditions per place. [2023-08-29 20:26:02,935 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 195 selfloop transitions, 19 changer transitions 5/231 dead transitions. [2023-08-29 20:26:02,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 231 transitions, 2380 flow [2023-08-29 20:26:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 966 transitions. [2023-08-29 20:26:02,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981949458483754 [2023-08-29 20:26:02,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 966 transitions. [2023-08-29 20:26:02,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 966 transitions. [2023-08-29 20:26:02,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:02,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 966 transitions. [2023-08-29 20:26:02,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 states 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:26:02,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:26:02,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:26:02,944 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 546 flow. Second operand 7 states and 966 transitions. [2023-08-29 20:26:02,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 231 transitions, 2380 flow [2023-08-29 20:26:03,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 231 transitions, 2375 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:26:03,026 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 679 flow [2023-08-29 20:26:03,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=679, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2023-08-29 20:26:03,027 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 22 predicate places. [2023-08-29 20:26:03,027 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 679 flow [2023-08-29 20:26:03,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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:26:03,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:03,027 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:26:03,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:26:03,028 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:26:03,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash 232803014, now seen corresponding path program 1 times [2023-08-29 20:26:03,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:03,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321358077] [2023-08-29 20:26:03,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:03,256 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:26:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:03,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321358077] [2023-08-29 20:26:03,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321358077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:03,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:03,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:03,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779250583] [2023-08-29 20:26:03,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:03,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:03,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:03,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:03,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:03,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:26:03,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 679 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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:26:03,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:03,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:26:03,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:04,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][138], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 50#L808true, 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, Black: 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 61#L869true, P0Thread1of1ForFork1InUse, Black: 270#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 289#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), 127#L765true, Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:04,124 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,124 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,124 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,124 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,125 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 88#L834true, Black: 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 194#true, Black: 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 61#L869true, P0Thread1of1ForFork1InUse, Black: 270#(<= ~__unbuffered_cnt~0 1), P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 289#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), 127#L765true, Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:04,125 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,125 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,125 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,125 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,129 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][138], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 50#L808true, 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, Black: 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 61#L869true, Black: 270#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 289#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), 127#L765true, Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:04,129 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,130 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,130 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,130 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,130 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 88#L834true, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, Black: 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 61#L869true, Black: 270#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 289#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, Black: 176#(= ~__unbuffered_p3_EAX~0 0), 127#L765true, Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:04,130 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,131 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,131 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,131 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,135 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][138], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 50#L808true, 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 95#L795true, Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, Black: 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 61#L869true, Black: 270#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 289#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:04,135 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,136 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,136 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,136 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,136 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][137], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, 88#L834true, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 95#L795true, Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, Black: 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 61#L869true, Black: 270#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 289#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:04,136 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,137 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,137 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,137 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 20:26:04,185 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([436] L834-->L841: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= v_~x$w_buff1_used~0_106 (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x~0_63 (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_37 v_~x~0_64))) (= (ite .cse4 0 v_~x$w_buff0_used~0_120) v_~x$w_buff0_used~0_119)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_64, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_37, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_63, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][202], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), 50#L808true, Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, 61#L869true, Black: 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 270#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 8#L841true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, 291#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:04,186 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:26:04,186 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:04,186 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:04,186 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:04,187 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([427] L808-->L815: Formula: (let ((.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_105 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_106 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff0_used~0_105 (ite .cse0 0 v_~x$w_buff0_used~0_106)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_93) v_~x$w_buff1_used~0_92) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20)) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_24) v_~x$r_buff0_thd3~0_23) (= v_~x~0_51 (ite .cse0 v_~x$w_buff0~0_40 (ite .cse2 v_~x$w_buff1~0_29 v_~x~0_52)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][199], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 111#P0EXITtrue, 88#L834true, Black: 262#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 259#(= ~__unbuffered_cnt~0 0), Black: 201#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 198#(and (or (and (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)))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= ~__unbuffered_p2_EAX~0 0)) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0))), Black: 196#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 260#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 271#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 194#true, 61#L869true, Black: 275#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 270#(<= ~__unbuffered_cnt~0 1), P0Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 214#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 132#L815true, 172#(and (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t995~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t995~0#1.base| 0) |ULTIMATE.start_main_~#t994~0#1.base| 0) |ULTIMATE.start_main_~#t996~0#1.base| 0) |ULTIMATE.start_main_~#t993~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t995~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|)) (not (= |ULTIMATE.start_main_~#t996~0#1.base| |ULTIMATE.start_main_~#t994~0#1.base|)) (not (= |ULTIMATE.start_main_~#t994~0#1.base| |ULTIMATE.start_main_~#t993~0#1.base|))), 159#true, Black: 231#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(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))), 116#P1EXITtrue, 291#(and (<= ~__unbuffered_cnt~0 2) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 176#(= ~__unbuffered_p3_EAX~0 0), Black: 243#(and (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 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: 244#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0))]) [2023-08-29 20:26:04,187 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 20:26:04,187 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:04,187 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:04,187 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 20:26:04,263 INFO L130 PetriNetUnfolder]: 5963/8687 cut-off events. [2023-08-29 20:26:04,263 INFO L131 PetriNetUnfolder]: For 93160/97789 co-relation queries the response was YES. [2023-08-29 20:26:04,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47344 conditions, 8687 events. 5963/8687 cut-off events. For 93160/97789 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 51053 event pairs, 658 based on Foata normal form. 1054/9309 useless extension candidates. Maximal degree in co-relation 47321. Up to 3333 conditions per place. [2023-08-29 20:26:04,339 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 204 selfloop transitions, 28 changer transitions 17/261 dead transitions. [2023-08-29 20:26:04,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 261 transitions, 2812 flow [2023-08-29 20:26:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:26:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:26:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1241 transitions. [2023-08-29 20:26:04,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49779382270357 [2023-08-29 20:26:04,342 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1241 transitions. [2023-08-29 20:26:04,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1241 transitions. [2023-08-29 20:26:04,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:04,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1241 transitions. [2023-08-29 20:26:04,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.88888888888889) internal successors, (1241), 9 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states 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:26:04,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 277.0) internal successors, (2770), 10 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states 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:26:04,349 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 277.0) internal successors, (2770), 10 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states 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:26:04,349 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 679 flow. Second operand 9 states and 1241 transitions. [2023-08-29 20:26:04,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 261 transitions, 2812 flow [2023-08-29 20:26:04,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 261 transitions, 2762 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-29 20:26:04,703 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 794 flow [2023-08-29 20:26:04,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=794, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2023-08-29 20:26:04,704 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2023-08-29 20:26:04,705 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 794 flow [2023-08-29 20:26:04,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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:26:04,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:04,705 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:26:04,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:26:04,706 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:26:04,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1297569336, now seen corresponding path program 1 times [2023-08-29 20:26:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:04,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586192970] [2023-08-29 20:26:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:04,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:05,171 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:26:05,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:05,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586192970] [2023-08-29 20:26:05,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586192970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:05,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:05,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:05,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192354089] [2023-08-29 20:26:05,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:05,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:05,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:05,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:05,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-29 20:26:05,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 794 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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:26:05,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:05,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-29 20:26:05,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:06,915 INFO L130 PetriNetUnfolder]: 11272/16264 cut-off events. [2023-08-29 20:26:06,915 INFO L131 PetriNetUnfolder]: For 109394/111055 co-relation queries the response was YES. [2023-08-29 20:26:06,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85745 conditions, 16264 events. 11272/16264 cut-off events. For 109394/111055 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 94989 event pairs, 2148 based on Foata normal form. 547/16792 useless extension candidates. Maximal degree in co-relation 85719. Up to 9462 conditions per place. [2023-08-29 20:26:06,989 INFO L137 encePairwiseOnDemand]: 268/277 looper letters, 134 selfloop transitions, 14 changer transitions 98/250 dead transitions. [2023-08-29 20:26:06,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 250 transitions, 2681 flow [2023-08-29 20:26:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 908 transitions. [2023-08-29 20:26:06,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46828261990716863 [2023-08-29 20:26:06,991 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 908 transitions. [2023-08-29 20:26:06,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 908 transitions. [2023-08-29 20:26:06,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:06,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 908 transitions. [2023-08-29 20:26:06,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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:26:06,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:26:06,997 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:26:06,997 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 794 flow. Second operand 7 states and 908 transitions. [2023-08-29 20:26:06,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 250 transitions, 2681 flow [2023-08-29 20:26:07,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 250 transitions, 2410 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:07,740 INFO L231 Difference]: Finished difference. Result has 90 places, 90 transitions, 784 flow [2023-08-29 20:26:07,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=784, PETRI_PLACES=90, PETRI_TRANSITIONS=90} [2023-08-29 20:26:07,741 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2023-08-29 20:26:07,741 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 784 flow [2023-08-29 20:26:07,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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:26:07,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:07,742 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:26:07,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:26:07,742 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:26:07,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash -700580404, now seen corresponding path program 2 times [2023-08-29 20:26:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360760143] [2023-08-29 20:26:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:08,004 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:26:08,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:08,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360760143] [2023-08-29 20:26:08,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360760143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:08,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:08,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:26:08,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745154632] [2023-08-29 20:26:08,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:08,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:26:08,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:08,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:26:08,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:26:08,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-08-29 20:26:08,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 784 flow. Second operand has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states 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:26:08,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:08,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-08-29 20:26:08,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:09,114 INFO L130 PetriNetUnfolder]: 6511/9528 cut-off events. [2023-08-29 20:26:09,114 INFO L131 PetriNetUnfolder]: For 101839/106395 co-relation queries the response was YES. [2023-08-29 20:26:09,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52198 conditions, 9528 events. 6511/9528 cut-off events. For 101839/106395 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 57323 event pairs, 653 based on Foata normal form. 1146/10273 useless extension candidates. Maximal degree in co-relation 52166. Up to 4154 conditions per place. [2023-08-29 20:26:09,166 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 193 selfloop transitions, 23 changer transitions 38/269 dead transitions. [2023-08-29 20:26:09,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 269 transitions, 2964 flow [2023-08-29 20:26:09,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:26:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:26:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1480 transitions. [2023-08-29 20:26:09,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857236626189695 [2023-08-29 20:26:09,171 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1480 transitions. [2023-08-29 20:26:09,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1480 transitions. [2023-08-29 20:26:09,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:09,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1480 transitions. [2023-08-29 20:26:09,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.54545454545453) internal successors, (1480), 11 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states 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:26:09,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states 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:26:09,178 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states 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:26:09,179 INFO L175 Difference]: Start difference. First operand has 90 places, 90 transitions, 784 flow. Second operand 11 states and 1480 transitions. [2023-08-29 20:26:09,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 269 transitions, 2964 flow [2023-08-29 20:26:09,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 269 transitions, 2862 flow, removed 38 selfloop flow, removed 6 redundant places. [2023-08-29 20:26:09,483 INFO L231 Difference]: Finished difference. Result has 94 places, 83 transitions, 716 flow [2023-08-29 20:26:09,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=716, PETRI_PLACES=94, PETRI_TRANSITIONS=83} [2023-08-29 20:26:09,484 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2023-08-29 20:26:09,484 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 83 transitions, 716 flow [2023-08-29 20:26:09,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states 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:26:09,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:09,485 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:26:09,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:26:09,485 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:26:09,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1999102420, now seen corresponding path program 1 times [2023-08-29 20:26:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:09,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949308377] [2023-08-29 20:26:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:09,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:09,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:26:09,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:09,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949308377] [2023-08-29 20:26:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949308377] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:09,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:09,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:26:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2749318] [2023-08-29 20:26:09,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:09,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:26:09,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:09,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:26:09,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:26:10,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 277 [2023-08-29 20:26:10,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 83 transitions, 716 flow. Second operand has 9 states, 9 states have (on average 125.88888888888889) internal successors, (1133), 9 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states 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:26:10,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:10,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 277 [2023-08-29 20:26:10,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:11,842 INFO L130 PetriNetUnfolder]: 11274/17062 cut-off events. [2023-08-29 20:26:11,842 INFO L131 PetriNetUnfolder]: For 138491/140242 co-relation queries the response was YES. [2023-08-29 20:26:12,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97254 conditions, 17062 events. 11274/17062 cut-off events. For 138491/140242 co-relation queries the response was YES. Maximal size of possible extension queue 938. Compared 113393 event pairs, 2663 based on Foata normal form. 115/16704 useless extension candidates. Maximal degree in co-relation 97224. Up to 9058 conditions per place. [2023-08-29 20:26:12,114 INFO L137 encePairwiseOnDemand]: 266/277 looper letters, 107 selfloop transitions, 20 changer transitions 138/273 dead transitions. [2023-08-29 20:26:12,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 273 transitions, 3021 flow [2023-08-29 20:26:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:26:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:26:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1458 transitions. [2023-08-29 20:26:12,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785034460124713 [2023-08-29 20:26:12,117 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1458 transitions. [2023-08-29 20:26:12,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1458 transitions. [2023-08-29 20:26:12,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:12,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1458 transitions. [2023-08-29 20:26:12,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 132.54545454545453) internal successors, (1458), 11 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states 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:26:12,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states 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:26:12,124 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 277.0) internal successors, (3324), 12 states have internal predecessors, (3324), 0 states have call successors, (0), 0 states 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:26:12,125 INFO L175 Difference]: Start difference. First operand has 94 places, 83 transitions, 716 flow. Second operand 11 states and 1458 transitions. [2023-08-29 20:26:12,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 273 transitions, 3021 flow [2023-08-29 20:26:12,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 273 transitions, 2437 flow, removed 203 selfloop flow, removed 12 redundant places. [2023-08-29 20:26:12,661 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 802 flow [2023-08-29 20:26:12,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=802, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2023-08-29 20:26:12,662 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 46 predicate places. [2023-08-29 20:26:12,662 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 802 flow [2023-08-29 20:26:12,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 125.88888888888889) internal successors, (1133), 9 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states 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:26:12,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:12,662 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:26:12,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:26:12,663 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:26:12,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:12,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1110514900, now seen corresponding path program 2 times [2023-08-29 20:26:12,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:12,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082629361] [2023-08-29 20:26:12,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:12,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:13,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:26:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082629361] [2023-08-29 20:26:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082629361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:13,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:13,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834977577] [2023-08-29 20:26:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:13,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:13,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:13,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:13,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:13,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-29 20:26:13,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 802 flow. Second operand has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:26:13,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:13,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-29 20:26:13,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:14,928 INFO L130 PetriNetUnfolder]: 10969/15993 cut-off events. [2023-08-29 20:26:14,929 INFO L131 PetriNetUnfolder]: For 78922/80456 co-relation queries the response was YES. [2023-08-29 20:26:14,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79484 conditions, 15993 events. 10969/15993 cut-off events. For 78922/80456 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 100905 event pairs, 1116 based on Foata normal form. 885/16850 useless extension candidates. Maximal degree in co-relation 79452. Up to 8189 conditions per place. [2023-08-29 20:26:15,003 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 99 selfloop transitions, 5 changer transitions 104/212 dead transitions. [2023-08-29 20:26:15,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 212 transitions, 2058 flow [2023-08-29 20:26:15,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2023-08-29 20:26:15,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4553893759669933 [2023-08-29 20:26:15,006 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2023-08-29 20:26:15,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2023-08-29 20:26:15,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:15,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2023-08-29 20:26:15,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 0 states 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:26:15,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:26:15,011 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:26:15,011 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 802 flow. Second operand 7 states and 883 transitions. [2023-08-29 20:26:15,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 212 transitions, 2058 flow [2023-08-29 20:26:15,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 212 transitions, 1949 flow, removed 45 selfloop flow, removed 7 redundant places. [2023-08-29 20:26:15,386 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 567 flow [2023-08-29 20:26:15,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2023-08-29 20:26:15,386 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2023-08-29 20:26:15,386 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 567 flow [2023-08-29 20:26:15,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:26:15,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:15,387 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:26:15,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:26:15,387 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:26:15,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:15,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2003117304, now seen corresponding path program 3 times [2023-08-29 20:26:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:15,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561701377] [2023-08-29 20:26:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:15,877 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:26:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561701377] [2023-08-29 20:26:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561701377] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:15,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133720835] [2023-08-29 20:26:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:15,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:15,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 277 [2023-08-29 20:26:15,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 567 flow. Second operand has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:26:15,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:15,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 277 [2023-08-29 20:26:15,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:16,644 INFO L130 PetriNetUnfolder]: 2279/3535 cut-off events. [2023-08-29 20:26:16,644 INFO L131 PetriNetUnfolder]: For 12811/13081 co-relation queries the response was YES. [2023-08-29 20:26:16,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16042 conditions, 3535 events. 2279/3535 cut-off events. For 12811/13081 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18687 event pairs, 355 based on Foata normal form. 153/3674 useless extension candidates. Maximal degree in co-relation 16013. Up to 1582 conditions per place. [2023-08-29 20:26:16,668 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 56 selfloop transitions, 3 changer transitions 80/141 dead transitions. [2023-08-29 20:26:16,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 141 transitions, 1287 flow [2023-08-29 20:26:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-08-29 20:26:16,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44662197008767407 [2023-08-29 20:26:16,672 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-08-29 20:26:16,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-08-29 20:26:16,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:16,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-08-29 20:26:16,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states 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:26:16,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:26:16,676 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states 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:26:16,676 INFO L175 Difference]: Start difference. First operand has 95 places, 75 transitions, 567 flow. Second operand 7 states and 866 transitions. [2023-08-29 20:26:16,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 141 transitions, 1287 flow [2023-08-29 20:26:16,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 141 transitions, 1227 flow, removed 28 selfloop flow, removed 8 redundant places. [2023-08-29 20:26:16,736 INFO L231 Difference]: Finished difference. Result has 85 places, 49 transitions, 314 flow [2023-08-29 20:26:16,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=85, PETRI_TRANSITIONS=49} [2023-08-29 20:26:16,736 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2023-08-29 20:26:16,737 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 49 transitions, 314 flow [2023-08-29 20:26:16,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:26:16,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:16,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:16,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:26:16,738 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:26:16,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:16,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1135002052, now seen corresponding path program 4 times [2023-08-29 20:26:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526291161] [2023-08-29 20:26:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:16,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:18,036 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:26:18,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:18,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526291161] [2023-08-29 20:26:18,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526291161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:18,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:18,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:26:18,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649088498] [2023-08-29 20:26:18,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:18,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:26:18,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:18,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:26:18,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:26:18,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-08-29 20:26:18,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 49 transitions, 314 flow. Second operand has 9 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:26:18,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:18,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-08-29 20:26:18,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:18,544 INFO L130 PetriNetUnfolder]: 1490/2398 cut-off events. [2023-08-29 20:26:18,544 INFO L131 PetriNetUnfolder]: For 8055/8161 co-relation queries the response was YES. [2023-08-29 20:26:18,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 2398 events. 1490/2398 cut-off events. For 8055/8161 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12357 event pairs, 374 based on Foata normal form. 45/2367 useless extension candidates. Maximal degree in co-relation 10439. Up to 1251 conditions per place. [2023-08-29 20:26:18,558 INFO L137 encePairwiseOnDemand]: 271/277 looper letters, 54 selfloop transitions, 6 changer transitions 18/82 dead transitions. [2023-08-29 20:26:18,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 650 flow [2023-08-29 20:26:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:26:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:26:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 797 transitions. [2023-08-29 20:26:18,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4795427196149218 [2023-08-29 20:26:18,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 797 transitions. [2023-08-29 20:26:18,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 797 transitions. [2023-08-29 20:26:18,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:18,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 797 transitions. [2023-08-29 20:26:18,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states 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:26:18,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states 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:26:18,563 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states 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:26:18,563 INFO L175 Difference]: Start difference. First operand has 85 places, 49 transitions, 314 flow. Second operand 6 states and 797 transitions. [2023-08-29 20:26:18,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 650 flow [2023-08-29 20:26:18,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 82 transitions, 592 flow, removed 20 selfloop flow, removed 13 redundant places. [2023-08-29 20:26:18,589 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 284 flow [2023-08-29 20:26:18,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2023-08-29 20:26:18,590 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 19 predicate places. [2023-08-29 20:26:18,590 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 284 flow [2023-08-29 20:26:18,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states 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:26:18,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:18,591 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:26:18,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:26:18,591 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:26:18,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2123627440, now seen corresponding path program 5 times [2023-08-29 20:26:18,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:18,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754846234] [2023-08-29 20:26:18,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:18,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:26:18,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:26:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:26:18,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:26:18,765 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:26:18,766 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:26:18,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:26:18,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:26:18,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:26:18,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:26:18,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:26:18,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:26:18,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:26:18,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:26:18,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:26:18,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:26:18,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:26:18,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:26:18,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:26:18,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:26:18,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:26:18,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:26:18,778 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:18,783 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:26:18,783 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:26:18,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:26:18 BasicIcfg [2023-08-29 20:26:18,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:26:18,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:26:18,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:26:18,883 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:26:18,883 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:25:38" (3/4) ... [2023-08-29 20:26:18,885 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:26:18,886 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:26:18,886 INFO L158 Benchmark]: Toolchain (without parser) took 41745.08ms. Allocated memory was 90.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 65.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-08-29 20:26:18,887 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:18,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.84ms. Allocated memory is still 90.2MB. Free memory was 65.5MB in the beginning and 64.9MB in the end (delta: 559.5kB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-08-29 20:26:18,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.06ms. Allocated memory is still 90.2MB. Free memory was 64.9MB in the beginning and 62.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:18,887 INFO L158 Benchmark]: Boogie Preprocessor took 59.32ms. Allocated memory is still 90.2MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:18,888 INFO L158 Benchmark]: RCFGBuilder took 738.98ms. Allocated memory is still 90.2MB. Free memory was 59.9MB in the beginning and 48.9MB in the end (delta: 11.0MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2023-08-29 20:26:18,888 INFO L158 Benchmark]: TraceAbstraction took 40264.38ms. Allocated memory was 90.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 47.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-08-29 20:26:18,888 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 3.7GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:18,889 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.84ms. Allocated memory is still 90.2MB. Free memory was 65.5MB in the beginning and 64.9MB in the end (delta: 559.5kB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.06ms. Allocated memory is still 90.2MB. Free memory was 64.9MB in the beginning and 62.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.32ms. Allocated memory is still 90.2MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 738.98ms. Allocated memory is still 90.2MB. Free memory was 59.9MB in the beginning and 48.9MB in the end (delta: 11.0MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * TraceAbstraction took 40264.38ms. Allocated memory was 90.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 47.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 3.7GB. Free memory is still 2.0GB. 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.6s, 152 PlacesBefore, 53 PlacesAfterwards, 141 TransitionsBefore, 41 TransitionsAfterwards, 3618 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 10563 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5121, independent: 4876, independent conditional: 0, independent unconditional: 4876, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1894, independent: 1854, independent conditional: 0, independent unconditional: 1854, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5121, independent: 3022, independent conditional: 0, independent unconditional: 3022, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1894, unknown conditional: 0, unknown unconditional: 1894] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t993, ((void *)0), P0, ((void *)0))=-4, t993={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] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t994, ((void *)0), P1, ((void *)0))=-3, t993={5:0}, t994={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] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t995, ((void *)0), P2, ((void *)0))=-2, t993={5:0}, t994={6:0}, t995={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] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t996, ((void *)0), P3, ((void *)0))=-1, t993={5:0}, t994={6:0}, t995={7:0}, t996={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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = 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}, b=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] [L824] 4 z = 1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a 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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b 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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 b = 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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, 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] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 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) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 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 [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 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=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, 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] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={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] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 183 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1436 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1170 mSDsluCounter, 936 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 708 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3737 IncrementalHoareTripleChecker+Invalid, 3966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 228 mSDtfsCounter, 3737 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=802occurred in iteration=15, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 2917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:26:18,924 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/mix037_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 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --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:26:21,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:26:21,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:26:21,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:26:21,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:26:21,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:26:21,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:26:21,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:26:21,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:26:21,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:26:21,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:26:21,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:26:21,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:26:21,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:26:21,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:26:21,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:26:21,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:26:21,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:26:21,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:26:21,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:26:21,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:26:21,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:26:21,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:26:21,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:26:21,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:26:21,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:26:21,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:26:21,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:26:21,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:26:21,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:26:21,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:26:21,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:26:21,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:26:21,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:26:21,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:26:21,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:26:21,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:26:21,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:26:21,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:26:21,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:26:21,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:26:21,148 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:26:21,174 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:26:21,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:26:21,176 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:26:21,176 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:26:21,177 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:26:21,177 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:26:21,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:26:21,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:26:21,178 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:26:21,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:26:21,179 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:26:21,179 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:26:21,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:26:21,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:26:21,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:26:21,180 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:26:21,180 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:26:21,181 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:26:21,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:26:21,181 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:26:21,181 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:26:21,181 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:26:21,182 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:26:21,182 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:26:21,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:26:21,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:26:21,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:26:21,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:26:21,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:26:21,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:26:21,183 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:26:21,183 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:26:21,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:26:21,184 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:26:21,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:26:21,184 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:26:21,185 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:26:21,185 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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 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:26:21,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:26:21,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:26:21,511 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:26:21,512 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:26:21,513 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:26:21,514 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2023-08-29 20:26:22,633 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:26:22,862 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:26:22,862 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2023-08-29 20:26:22,881 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20fad2db7/bc2acf9d86bb44108469f388d7376bf8/FLAG597c1ac0a [2023-08-29 20:26:22,892 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20fad2db7/bc2acf9d86bb44108469f388d7376bf8 [2023-08-29 20:26:22,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:26:22,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:26:22,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:26:22,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:26:22,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:26:22,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:26:22" (1/1) ... [2023-08-29 20:26:22,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218b9494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:22, skipping insertion in model container [2023-08-29 20:26:22,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:26:22" (1/1) ... [2023-08-29 20:26:22,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:26:22,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:26:23,058 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/mix037_tso.oepc.i[949,962] [2023-08-29 20:26:23,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:26:23,292 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:26:23,304 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/mix037_tso.oepc.i[949,962] [2023-08-29 20:26:23,361 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:26:23,403 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:26:23,404 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:26:23,410 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:26:23,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23 WrapperNode [2023-08-29 20:26:23,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:26:23,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:26:23,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:26:23,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:26:23,418 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:26:23" (1/1) ... [2023-08-29 20:26:23,450 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:26:23" (1/1) ... [2023-08-29 20:26:23,489 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2023-08-29 20:26:23,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:26:23,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:26:23,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:26:23,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:26:23,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (1/1) ... [2023-08-29 20:26:23,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (1/1) ... [2023-08-29 20:26:23,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (1/1) ... [2023-08-29 20:26:23,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (1/1) ... [2023-08-29 20:26:23,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (1/1) ... [2023-08-29 20:26:23,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (1/1) ... [2023-08-29 20:26:23,547 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (1/1) ... [2023-08-29 20:26:23,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (1/1) ... [2023-08-29 20:26:23,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:26:23,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:26:23,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:26:23,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:26:23,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (1/1) ... [2023-08-29 20:26:23,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:26:23,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:26:23,590 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:26:23,615 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:26:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:26:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:26:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:26:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:26:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:26:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:26:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:26:23,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:26:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:26:23,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:26:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:26:23,645 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:26:23,645 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:26:23,646 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:26:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:26:23,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:26:23,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:26:23,648 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:26:23,804 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:26:23,819 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:26:24,214 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:26:24,336 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:26:24,336 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:26:24,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:24 BoogieIcfgContainer [2023-08-29 20:26:24,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:26:24,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:26:24,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:26:24,345 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:26:24,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:26:22" (1/3) ... [2023-08-29 20:26:24,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d6be01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:26:24, skipping insertion in model container [2023-08-29 20:26:24,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:23" (2/3) ... [2023-08-29 20:26:24,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d6be01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:26:24, skipping insertion in model container [2023-08-29 20:26:24,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:24" (3/3) ... [2023-08-29 20:26:24,348 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2023-08-29 20:26:24,363 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:26:24,364 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:26:24,364 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:26:24,453 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:26:24,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2023-08-29 20:26:24,565 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-29 20:26:24,566 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:24,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:26:24,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 146 transitions, 312 flow [2023-08-29 20:26:24,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 142 transitions, 296 flow [2023-08-29 20:26:24,589 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:26:24,607 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-29 20:26:24,610 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 142 transitions, 296 flow [2023-08-29 20:26:24,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 296 flow [2023-08-29 20:26:24,651 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2023-08-29 20:26:24,651 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:24,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-29 20:26:24,657 INFO L119 LiptonReduction]: Number of co-enabled transitions 3618 [2023-08-29 20:26:32,539 INFO L134 LiptonReduction]: Checked pairs total: 10424 [2023-08-29 20:26:32,539 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-08-29 20:26:32,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:26:32,557 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;@639bee00, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:26:32,557 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:26:32,559 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:26:32,559 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:32,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:32,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:26:32,560 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:26:32,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash 618, now seen corresponding path program 1 times [2023-08-29 20:26:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:32,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648742318] [2023-08-29 20:26:32,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:32,575 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:26:32,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:32,581 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:26:32,597 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:26:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:32,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:26:32,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:32,658 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:26:32,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:32,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:32,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648742318] [2023-08-29 20:26:32,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648742318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:32,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:32,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:26:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093650400] [2023-08-29 20:26:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:32,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:26:32,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:32,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:26:32,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:26:32,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 285 [2023-08-29 20:26:32,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:32,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:32,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 285 [2023-08-29 20:26:32,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:33,979 INFO L130 PetriNetUnfolder]: 5973/8246 cut-off events. [2023-08-29 20:26:33,980 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 20:26:33,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16564 conditions, 8246 events. 5973/8246 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 43386 event pairs, 5973 based on Foata normal form. 0/7002 useless extension candidates. Maximal degree in co-relation 16552. Up to 8103 conditions per place. [2023-08-29 20:26:34,040 INFO L137 encePairwiseOnDemand]: 277/285 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-29 20:26:34,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-08-29 20:26:34,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:26:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:26:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 296 transitions. [2023-08-29 20:26:34,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519298245614035 [2023-08-29 20:26:34,059 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 296 transitions. [2023-08-29 20:26:34,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 296 transitions. [2023-08-29 20:26:34,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:34,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 296 transitions. [2023-08-29 20:26:34,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 148.0) internal successors, (296), 2 states have internal predecessors, (296), 0 states have call successors, (0), 0 states 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:26:34,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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:26:34,077 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 285.0) internal successors, (855), 3 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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:26:34,079 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 296 transitions. [2023-08-29 20:26:34,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-08-29 20:26:34,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:34,090 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-29 20:26:34,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-29 20:26:34,095 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-29 20:26:34,095 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-29 20:26:34,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:34,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:34,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:26:34,113 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:26:34,313 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:26:34,313 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:26:34,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash 585517894, now seen corresponding path program 1 times [2023-08-29 20:26:34,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:34,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584431796] [2023-08-29 20:26:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:34,315 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:26:34,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:34,321 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:26:34,323 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:26:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:34,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:26:34,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:34,423 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:26:34,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:34,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:34,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584431796] [2023-08-29 20:26:34,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584431796] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:34,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:34,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:26:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205503452] [2023-08-29 20:26:34,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:34,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:26:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:26:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:26:34,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 285 [2023-08-29 20:26:34,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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:26:34,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:34,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 285 [2023-08-29 20:26:34,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:35,362 INFO L130 PetriNetUnfolder]: 4695/6854 cut-off events. [2023-08-29 20:26:35,362 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:35,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13427 conditions, 6854 events. 4695/6854 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 40747 event pairs, 861 based on Foata normal form. 0/6289 useless extension candidates. Maximal degree in co-relation 13424. Up to 5107 conditions per place. [2023-08-29 20:26:35,405 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 39 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-08-29 20:26:35,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 194 flow [2023-08-29 20:26:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:26:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:26:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-08-29 20:26:35,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076023391812865 [2023-08-29 20:26:35,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-08-29 20:26:35,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-08-29 20:26:35,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:35,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-08-29 20:26:35,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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:26:35,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states 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:26:35,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states 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:26:35,413 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 434 transitions. [2023-08-29 20:26:35,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 194 flow [2023-08-29 20:26:35,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:26:35,414 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-29 20:26:35,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, 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=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:26:35,415 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-29 20:26:35,416 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-29 20:26:35,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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:26:35,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:35,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:35,428 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:26:35,625 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:26:35,626 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:26:35,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1366908247, now seen corresponding path program 1 times [2023-08-29 20:26:35,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:35,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208099555] [2023-08-29 20:26:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:35,628 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:26:35,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:35,630 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:26:35,632 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:26:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:35,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:26:35,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:35,807 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:26:35,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:35,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:35,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208099555] [2023-08-29 20:26:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208099555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:35,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:35,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867000044] [2023-08-29 20:26:35,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:35,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:35,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:35,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:35,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 285 [2023-08-29 20:26:35,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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:26:35,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:35,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 285 [2023-08-29 20:26:35,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:36,518 INFO L130 PetriNetUnfolder]: 3224/4673 cut-off events. [2023-08-29 20:26:36,518 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2023-08-29 20:26:36,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9769 conditions, 4673 events. 3224/4673 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 24977 event pairs, 626 based on Foata normal form. 256/4688 useless extension candidates. Maximal degree in co-relation 9765. Up to 3325 conditions per place. [2023-08-29 20:26:36,543 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 37 selfloop transitions, 5 changer transitions 25/72 dead transitions. [2023-08-29 20:26:36,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 302 flow [2023-08-29 20:26:36,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-29 20:26:36,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47649122807017547 [2023-08-29 20:26:36,546 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-29 20:26:36,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-29 20:26:36,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:36,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-29 20:26:36,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:36,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states 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:26:36,552 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states 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:26:36,553 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 679 transitions. [2023-08-29 20:26:36,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 302 flow [2023-08-29 20:26:36,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:36,555 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2023-08-29 20:26:36,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-29 20:26:36,557 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-08-29 20:26:36,557 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2023-08-29 20:26:36,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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:26:36,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:36,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:36,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-29 20:26:36,770 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:26:36,771 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:26:36,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash -943552825, now seen corresponding path program 1 times [2023-08-29 20:26:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:36,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039293617] [2023-08-29 20:26:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:36,772 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:26:36,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:36,773 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:26:36,779 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:26:36,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:36,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:36,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:36,938 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:26:36,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:36,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:36,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039293617] [2023-08-29 20:26:36,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039293617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:36,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:36,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:36,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021341440] [2023-08-29 20:26:36,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:36,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:36,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:36,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:36,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 285 [2023-08-29 20:26:36,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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:26:36,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:36,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 285 [2023-08-29 20:26:36,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:37,397 INFO L130 PetriNetUnfolder]: 1712/2651 cut-off events. [2023-08-29 20:26:37,397 INFO L131 PetriNetUnfolder]: For 925/925 co-relation queries the response was YES. [2023-08-29 20:26:37,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 2651 events. 1712/2651 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13917 event pairs, 330 based on Foata normal form. 175/2728 useless extension candidates. Maximal degree in co-relation 7067. Up to 1057 conditions per place. [2023-08-29 20:26:37,412 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 49 selfloop transitions, 9 changer transitions 25/88 dead transitions. [2023-08-29 20:26:37,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 447 flow [2023-08-29 20:26:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:26:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:26:37,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-29 20:26:37,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2023-08-29 20:26:37,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-29 20:26:37,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-29 20:26:37,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:37,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-29 20:26:37,418 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:26:37,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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:26:37,422 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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:26:37,422 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 817 transitions. [2023-08-29 20:26:37,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 447 flow [2023-08-29 20:26:37,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 440 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:37,431 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow [2023-08-29 20:26:37,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-29 20:26:37,432 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-29 20:26:37,432 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow [2023-08-29 20:26:37,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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:26:37,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:37,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:37,445 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:26:37,645 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:26:37,646 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:37,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash -574158521, now seen corresponding path program 1 times [2023-08-29 20:26:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:37,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449346818] [2023-08-29 20:26:37,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:37,647 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:26:37,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:37,648 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:26:37,649 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:26:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:37,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:26:37,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:37,810 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:26:37,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:37,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:37,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449346818] [2023-08-29 20:26:37,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449346818] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:37,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771054002] [2023-08-29 20:26:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:37,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:37,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:37,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:37,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:37,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 285 [2023-08-29 20:26:37,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states 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:26:37,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:37,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 285 [2023-08-29 20:26:37,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:38,298 INFO L130 PetriNetUnfolder]: 1010/1625 cut-off events. [2023-08-29 20:26:38,298 INFO L131 PetriNetUnfolder]: For 1538/1538 co-relation queries the response was YES. [2023-08-29 20:26:38,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4885 conditions, 1625 events. 1010/1625 cut-off events. For 1538/1538 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8015 event pairs, 276 based on Foata normal form. 67/1656 useless extension candidates. Maximal degree in co-relation 4876. Up to 540 conditions per place. [2023-08-29 20:26:38,308 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 59 selfloop transitions, 13 changer transitions 25/102 dead transitions. [2023-08-29 20:26:38,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 102 transitions, 612 flow [2023-08-29 20:26:38,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 953 transitions. [2023-08-29 20:26:38,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47769423558897245 [2023-08-29 20:26:38,312 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 953 transitions. [2023-08-29 20:26:38,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 953 transitions. [2023-08-29 20:26:38,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:38,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 953 transitions. [2023-08-29 20:26:38,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.14285714285714) internal successors, (953), 7 states have internal predecessors, (953), 0 states have call successors, (0), 0 states 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:26:38,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states 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:26:38,320 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 285.0) internal successors, (2280), 8 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states 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:26:38,320 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 953 transitions. [2023-08-29 20:26:38,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 102 transitions, 612 flow [2023-08-29 20:26:38,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 102 transitions, 550 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:38,334 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow [2023-08-29 20:26:38,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-29 20:26:38,337 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-29 20:26:38,338 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow [2023-08-29 20:26:38,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states 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:26:38,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:38,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:38,353 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:26:38,551 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:26:38,551 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:38,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:38,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1024057084, now seen corresponding path program 1 times [2023-08-29 20:26:38,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:38,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526935278] [2023-08-29 20:26:38,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:38,553 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:26:38,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:38,554 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:26:38,554 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:26:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:38,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:26:38,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:38,770 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:26:38,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:38,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526935278] [2023-08-29 20:26:38,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526935278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:38,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:38,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:26:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215213087] [2023-08-29 20:26:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:38,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:26:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:38,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:26:38,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:26:38,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 285 [2023-08-29 20:26:38,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states 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:26:38,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:38,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 285 [2023-08-29 20:26:38,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:39,314 INFO L130 PetriNetUnfolder]: 866/1379 cut-off events. [2023-08-29 20:26:39,316 INFO L131 PetriNetUnfolder]: For 1254/1254 co-relation queries the response was YES. [2023-08-29 20:26:39,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3985 conditions, 1379 events. 866/1379 cut-off events. For 1254/1254 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6616 event pairs, 272 based on Foata normal form. 13/1368 useless extension candidates. Maximal degree in co-relation 3975. Up to 540 conditions per place. [2023-08-29 20:26:39,328 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 55 selfloop transitions, 17 changer transitions 13/90 dead transitions. [2023-08-29 20:26:39,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 552 flow [2023-08-29 20:26:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:26:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:26:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1063 transitions. [2023-08-29 20:26:39,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662280701754386 [2023-08-29 20:26:39,332 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1063 transitions. [2023-08-29 20:26:39,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1063 transitions. [2023-08-29 20:26:39,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:39,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1063 transitions. [2023-08-29 20:26:39,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.875) internal successors, (1063), 8 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states 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:26:39,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states 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:26:39,339 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 285.0) internal successors, (2565), 9 states have internal predecessors, (2565), 0 states have call successors, (0), 0 states 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:26:39,339 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1063 transitions. [2023-08-29 20:26:39,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 552 flow [2023-08-29 20:26:39,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 490 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-29 20:26:39,356 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow [2023-08-29 20:26:39,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-29 20:26:39,358 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-29 20:26:39,359 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow [2023-08-29 20:26:39,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states 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:26:39,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:39,359 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] [2023-08-29 20:26:39,369 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:26:39,569 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:26:39,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:26:39,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1000927934, now seen corresponding path program 1 times [2023-08-29 20:26:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:39,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262103735] [2023-08-29 20:26:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:39,571 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:26:39,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:39,572 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:26:39,574 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:26:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:39,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:26:39,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:40,445 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:26:40,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:40,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:40,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262103735] [2023-08-29 20:26:40,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262103735] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818276511] [2023-08-29 20:26:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:40,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:40,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:41,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 285 [2023-08-29 20:26:41,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:41,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:41,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 285 [2023-08-29 20:26:41,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:41,470 INFO L130 PetriNetUnfolder]: 855/1392 cut-off events. [2023-08-29 20:26:41,470 INFO L131 PetriNetUnfolder]: For 1351/1351 co-relation queries the response was YES. [2023-08-29 20:26:41,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1392 events. 855/1392 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6774 event pairs, 140 based on Foata normal form. 0/1376 useless extension candidates. Maximal degree in co-relation 3934. Up to 1043 conditions per place. [2023-08-29 20:26:41,479 INFO L137 encePairwiseOnDemand]: 280/285 looper letters, 57 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2023-08-29 20:26:41,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 473 flow [2023-08-29 20:26:41,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:26:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:26:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 708 transitions. [2023-08-29 20:26:41,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41403508771929826 [2023-08-29 20:26:41,484 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 708 transitions. [2023-08-29 20:26:41,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 708 transitions. [2023-08-29 20:26:41,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:41,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 708 transitions. [2023-08-29 20:26:41,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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:26:41,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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:26:41,489 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states 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:26:41,490 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 6 states and 708 transitions. [2023-08-29 20:26:41,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 473 flow [2023-08-29 20:26:41,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 384 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-29 20:26:41,498 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 162 flow [2023-08-29 20:26:41,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-29 20:26:41,498 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-08-29 20:26:41,499 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 162 flow [2023-08-29 20:26:41,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:41,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:41,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:41,510 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:26:41,710 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:26:41,711 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:26:41,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:41,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1658361343, now seen corresponding path program 1 times [2023-08-29 20:26:41,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:41,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16418638] [2023-08-29 20:26:41,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:41,712 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:26:41,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:41,713 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:26:41,716 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:26:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:41,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:41,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:41,883 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:26:41,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:41,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:41,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16418638] [2023-08-29 20:26:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16418638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:41,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:41,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918067831] [2023-08-29 20:26:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:41,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:41,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:41,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:41,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 285 [2023-08-29 20:26:41,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:26:41,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:41,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 285 [2023-08-29 20:26:41,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:42,227 INFO L130 PetriNetUnfolder]: 1507/2377 cut-off events. [2023-08-29 20:26:42,228 INFO L131 PetriNetUnfolder]: For 1338/1338 co-relation queries the response was YES. [2023-08-29 20:26:42,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 2377 events. 1507/2377 cut-off events. For 1338/1338 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12535 event pairs, 279 based on Foata normal form. 1/2375 useless extension candidates. Maximal degree in co-relation 6398. Up to 1149 conditions per place. [2023-08-29 20:26:42,240 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 51 selfloop transitions, 1 changer transitions 28/84 dead transitions. [2023-08-29 20:26:42,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 518 flow [2023-08-29 20:26:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-08-29 20:26:42,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4903508771929825 [2023-08-29 20:26:42,244 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-08-29 20:26:42,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-08-29 20:26:42,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:42,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-08-29 20:26:42,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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:26:42,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states 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:26:42,252 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states 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:26:42,252 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 162 flow. Second operand 4 states and 559 transitions. [2023-08-29 20:26:42,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 518 flow [2023-08-29 20:26:42,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 509 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:42,267 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 162 flow [2023-08-29 20:26:42,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-29 20:26:42,269 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-29 20:26:42,269 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 162 flow [2023-08-29 20:26:42,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:26:42,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:42,270 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] [2023-08-29 20:26:42,283 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:26:42,480 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:26:42,480 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:26:42,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash 219181351, now seen corresponding path program 2 times [2023-08-29 20:26:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:42,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601094693] [2023-08-29 20:26:42,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:26:42,482 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:26:42,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:42,483 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:26:42,485 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:26:42,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:26:42,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:26:42,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:42,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:42,633 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:26:42,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:42,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601094693] [2023-08-29 20:26:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1601094693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:42,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:42,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479085722] [2023-08-29 20:26:42,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:42,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:42,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 285 [2023-08-29 20:26:42,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:26:42,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:42,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 285 [2023-08-29 20:26:42,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:42,953 INFO L130 PetriNetUnfolder]: 1534/2536 cut-off events. [2023-08-29 20:26:42,953 INFO L131 PetriNetUnfolder]: For 1694/1697 co-relation queries the response was YES. [2023-08-29 20:26:42,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6738 conditions, 2536 events. 1534/2536 cut-off events. For 1694/1697 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14018 event pairs, 554 based on Foata normal form. 1/2512 useless extension candidates. Maximal degree in co-relation 6728. Up to 925 conditions per place. [2023-08-29 20:26:42,964 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 48 selfloop transitions, 1 changer transitions 27/80 dead transitions. [2023-08-29 20:26:42,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 497 flow [2023-08-29 20:26:42,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-08-29 20:26:42,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2023-08-29 20:26:42,967 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-08-29 20:26:42,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-08-29 20:26:42,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:42,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-08-29 20:26:42,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:26:42,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states 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:26:42,971 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states 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:26:42,971 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 162 flow. Second operand 4 states and 555 transitions. [2023-08-29 20:26:42,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 497 flow [2023-08-29 20:26:42,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 80 transitions, 493 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:42,986 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 166 flow [2023-08-29 20:26:42,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-08-29 20:26:42,986 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-29 20:26:42,987 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 166 flow [2023-08-29 20:26:42,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:26:42,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:42,987 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] [2023-08-29 20:26:43,000 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:26:43,197 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:26:43,198 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:26:43,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1894894817, now seen corresponding path program 3 times [2023-08-29 20:26:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:43,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827976792] [2023-08-29 20:26:43,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:26:43,199 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:26:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:43,200 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:26:43,205 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:26:43,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:26:43,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:26:43,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:43,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:43,363 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:26:43,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:43,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:43,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827976792] [2023-08-29 20:26:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827976792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:43,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:43,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:43,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411001205] [2023-08-29 20:26:43,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:43,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:43,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:43,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:43,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 285 [2023-08-29 20:26:43,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:26:43,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:43,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 285 [2023-08-29 20:26:43,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:43,661 INFO L130 PetriNetUnfolder]: 1584/2536 cut-off events. [2023-08-29 20:26:43,662 INFO L131 PetriNetUnfolder]: For 1745/1747 co-relation queries the response was YES. [2023-08-29 20:26:43,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7102 conditions, 2536 events. 1584/2536 cut-off events. For 1745/1747 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 13483 event pairs, 394 based on Foata normal form. 2/2473 useless extension candidates. Maximal degree in co-relation 7091. Up to 1473 conditions per place. [2023-08-29 20:26:43,672 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 47 selfloop transitions, 1 changer transitions 34/86 dead transitions. [2023-08-29 20:26:43,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 536 flow [2023-08-29 20:26:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-08-29 20:26:43,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4921052631578947 [2023-08-29 20:26:43,675 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-08-29 20:26:43,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-08-29 20:26:43,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:43,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-08-29 20:26:43,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:43,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states 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:26:43,679 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states 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:26:43,679 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 166 flow. Second operand 4 states and 561 transitions. [2023-08-29 20:26:43,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 536 flow [2023-08-29 20:26:43,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 532 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:43,701 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 170 flow [2023-08-29 20:26:43,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-08-29 20:26:43,702 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-29 20:26:43,702 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 170 flow [2023-08-29 20:26:43,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states 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:26:43,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:43,702 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] [2023-08-29 20:26:43,716 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:26:43,912 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:26:43,913 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:26:43,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2062917323, now seen corresponding path program 4 times [2023-08-29 20:26:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:43,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819922862] [2023-08-29 20:26:43,914 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:26:43,914 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:26:43,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:43,915 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:26:43,915 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:26:44,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:26:44,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:26:44,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:26:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:26:44,324 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:26:44,325 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:26:44,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:26:44,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:26:44,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:26:44,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:26:44,327 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:26:44,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:26:44,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:26:44,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:26:44,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:26:44,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:26:44,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:26:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:26:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:26:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:26:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:26:44,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:26:44,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-08-29 20:26:44,547 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:26:44,548 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:44,552 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:26:44,552 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:26:44,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:26:44 BasicIcfg [2023-08-29 20:26:44,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:26:44,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:26:44,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:26:44,680 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:26:44,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:24" (3/4) ... [2023-08-29 20:26:44,682 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:26:44,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:26:44,686 INFO L158 Benchmark]: Toolchain (without parser) took 21788.05ms. Allocated memory was 69.2MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 39.7MB in the beginning and 1.0GB in the end (delta: -1.0GB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2023-08-29 20:26:44,688 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 69.2MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:44,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.80ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 36.2MB in the end (delta: 3.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-08-29 20:26:44,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.68ms. Allocated memory is still 69.2MB. Free memory was 36.2MB in the beginning and 33.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:26:44,689 INFO L158 Benchmark]: Boogie Preprocessor took 61.99ms. Allocated memory is still 69.2MB. Free memory was 33.3MB in the beginning and 31.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:44,689 INFO L158 Benchmark]: RCFGBuilder took 785.11ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 30.9MB in the beginning and 44.6MB in the end (delta: -13.7MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2023-08-29 20:26:44,689 INFO L158 Benchmark]: TraceAbstraction took 20337.66ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 44.1MB in the beginning and 1.0GB in the end (delta: -1.0GB). Peak memory consumption was 451.8MB. Max. memory is 16.1GB. [2023-08-29 20:26:44,690 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:44,692 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.19ms. Allocated memory is still 69.2MB. Free memory is still 47.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.80ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 36.2MB in the end (delta: 3.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.68ms. Allocated memory is still 69.2MB. Free memory was 36.2MB in the beginning and 33.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.99ms. Allocated memory is still 69.2MB. Free memory was 33.3MB in the beginning and 31.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 785.11ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 30.9MB in the beginning and 44.6MB in the end (delta: -13.7MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20337.66ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 44.1MB in the beginning and 1.0GB in the end (delta: -1.0GB). Peak memory consumption was 451.8MB. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 1.1GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 1.0MB). 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.9s, 153 PlacesBefore, 52 PlacesAfterwards, 142 TransitionsBefore, 39 TransitionsAfterwards, 3618 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 139 TotalNumberOfCompositions, 10424 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4475, independent: 4222, independent conditional: 0, independent unconditional: 4222, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1921, independent: 1856, independent conditional: 0, independent unconditional: 1856, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4475, independent: 2366, independent conditional: 0, independent unconditional: 2366, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 1921, unknown conditional: 0, unknown unconditional: 1921] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t993, ((void *)0), P0, ((void *)0))=0, t993={-16:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t994, ((void *)0), P1, ((void *)0))=1, t993={-16:0}, t994={-12:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t995; [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L863] FCALL, FORK 0 pthread_create(&t995, ((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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t995, ((void *)0), P2, ((void *)0))=2, t993={-16:0}, t994={-12:0}, t995={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((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}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t996, ((void *)0), P3, ((void *)0))=3, t993={-16:0}, t994={-12:0}, t995={-2:0}, t996={-4:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = 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}, b=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] [L824] 4 z = 1 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a 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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b 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}, b=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] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 b = 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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, 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] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=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}, b=1, 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] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\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}, arg={0:0}, arg={0:0}, b=1, 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] [L810] 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) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 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 [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 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=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={-16:0}, t994={-12:0}, t995={-2:0}, t996={-4:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, b=1, 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 483 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1924 IncrementalHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 65 mSDtfsCounter, 1924 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=5, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 176 ConstructedInterpolants, 20 QuantifiedInterpolants, 1496 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1578 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:26:44,717 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