./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:13:14,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:13:14,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:13:14,611 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:13:14,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:13:14,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:13:14,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:13:14,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:13:14,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:13:14,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:13:14,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:13:14,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:13:14,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:13:14,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:13:14,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:13:14,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:13:14,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:13:14,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:13:14,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:13:14,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:13:14,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:13:14,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:13:14,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:13:14,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:13:14,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:13:14,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:13:14,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:13:14,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:13:14,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:13:14,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:13:14,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:13:14,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:13:14,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:13:14,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:13:14,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:13:14,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:13:14,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:13:14,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:13:14,674 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:13:14,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:13:14,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:13:14,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:13:14,712 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:13:14,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:13:14,713 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:13:14,714 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:13:14,714 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:13:14,715 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:13:14,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:13:14,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:13:14,716 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:13:14,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:13:14,717 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:13:14,717 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:13:14,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:13:14,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:13:14,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:13:14,718 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:13:14,718 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:13:14,718 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:13:14,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:13:14,719 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:13:14,719 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:13:14,719 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:13:14,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:13:14,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:13:14,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:13:14,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:14,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:13:14,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:13:14,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:13:14,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:13:14,721 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:13:14,721 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:13:14,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:13:14,721 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:13:14,721 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:13:15,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:13:15,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:13:15,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:13:15,096 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:13:15,096 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:13:15,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-08-31 23:13:16,331 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:13:16,636 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:13:16,636 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-08-31 23:13:16,647 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5280c2ee2/e085eca3ab224ecd943fb23a9b415f5b/FLAG3b9e462db [2023-08-31 23:13:16,664 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5280c2ee2/e085eca3ab224ecd943fb23a9b415f5b [2023-08-31 23:13:16,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:13:16,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:13:16,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:16,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:13:16,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:13:16,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:16" (1/1) ... [2023-08-31 23:13:16,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eabdccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:16, skipping insertion in model container [2023-08-31 23:13:16,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:13:16" (1/1) ... [2023-08-31 23:13:16,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:13:16,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:13:16,881 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i[949,962] [2023-08-31 23:13:17,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:17,112 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:13:17,126 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i[949,962] [2023-08-31 23:13:17,196 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:13:17,244 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:17,244 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:13:17,250 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:13:17,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17 WrapperNode [2023-08-31 23:13:17,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:13:17,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:17,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:13:17,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:13:17,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,324 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-08-31 23:13:17,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:13:17,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:13:17,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:13:17,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:13:17,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,375 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:13:17,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:13:17,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:13:17,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:13:17,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (1/1) ... [2023-08-31 23:13:17,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:13:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:13:17,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:13:17,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:13:17,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:13:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:13:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:13:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:13:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:13:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:13:17,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:13:17,460 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:13:17,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:13:17,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:13:17,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:13:17,461 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:13:17,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:13:17,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:13:17,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:13:17,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:13:17,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:13:17,463 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:13:17,660 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:13:17,663 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:13:18,107 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:13:18,223 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:13:18,223 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:13:18,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:18 BoogieIcfgContainer [2023-08-31 23:13:18,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:13:18,227 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:13:18,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:13:18,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:13:18,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:13:16" (1/3) ... [2023-08-31 23:13:18,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7945963b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:18, skipping insertion in model container [2023-08-31 23:13:18,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:13:17" (2/3) ... [2023-08-31 23:13:18,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7945963b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:13:18, skipping insertion in model container [2023-08-31 23:13:18,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:18" (3/3) ... [2023-08-31 23:13:18,233 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2023-08-31 23:13:18,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:13:18,248 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:13:18,249 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:13:18,313 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:13:18,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:13:18,393 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:13:18,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:18,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:13:18,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:13:18,407 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-31 23:13:18,412 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:13:18,436 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:13:18,443 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:13:18,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-31 23:13:18,497 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:13:18,498 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:18,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:13:18,504 INFO L119 LiptonReduction]: Number of co-enabled transitions 3506 [2023-08-31 23:13:23,501 INFO L134 LiptonReduction]: Checked pairs total: 11503 [2023-08-31 23:13:23,502 INFO L136 LiptonReduction]: Total number of compositions: 130 [2023-08-31 23:13:23,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:13:23,520 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;@b1ac813, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:13:23,520 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:13:23,521 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:13:23,522 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:23,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:23,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:13:23,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:13:23,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash 603, now seen corresponding path program 1 times [2023-08-31 23:13:23,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:23,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864920708] [2023-08-31 23:13:23,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:23,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:23,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864920708] [2023-08-31 23:13:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864920708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:23,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:23,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:13:23,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084796047] [2023-08-31 23:13:23,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:23,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:13:23,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:23,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:13:23,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:13:23,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 273 [2023-08-31 23:13:23,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:23,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:23,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 273 [2023-08-31 23:13:23,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:25,103 INFO L130 PetriNetUnfolder]: 7925/10838 cut-off events. [2023-08-31 23:13:25,104 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-31 23:13:25,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21748 conditions, 10838 events. 7925/10838 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 58006 event pairs, 7925 based on Foata normal form. 320/9386 useless extension candidates. Maximal degree in co-relation 21736. Up to 10695 conditions per place. [2023-08-31 23:13:25,178 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-31 23:13:25,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-31 23:13:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:13:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:13:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-31 23:13:25,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366300366300366 [2023-08-31 23:13:25,194 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-31 23:13:25,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-31 23:13:25,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:25,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-31 23:13:25,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:25,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:25,209 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:25,210 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 293 transitions. [2023-08-31 23:13:25,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-31 23:13:25,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:13:25,221 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-31 23:13:25,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-31 23:13:25,226 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-31 23:13:25,226 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-31 23:13:25,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:25,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:25,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:13:25,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:13:25,231 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-31 23:13:25,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash 569491207, now seen corresponding path program 1 times [2023-08-31 23:13:25,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:25,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554913302] [2023-08-31 23:13:25,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:25,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:25,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554913302] [2023-08-31 23:13:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554913302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:13:25,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352785329] [2023-08-31 23:13:25,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:25,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:13:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:25,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:13:25,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:13:25,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 273 [2023-08-31 23:13:25,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:25,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:25,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 273 [2023-08-31 23:13:25,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:26,572 INFO L130 PetriNetUnfolder]: 6231/9030 cut-off events. [2023-08-31 23:13:26,573 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:13:26,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17651 conditions, 9030 events. 6231/9030 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 55281 event pairs, 1149 based on Foata normal form. 0/8181 useless extension candidates. Maximal degree in co-relation 17648. Up to 6739 conditions per place. [2023-08-31 23:13:26,642 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 41 selfloop transitions, 2 changer transitions 4/52 dead transitions. [2023-08-31 23:13:26,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 210 flow [2023-08-31 23:13:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:13:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:13:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-31 23:13:26,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-08-31 23:13:26,646 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-31 23:13:26,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-31 23:13:26,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:26,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-31 23:13:26,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:26,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:26,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:26,652 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 429 transitions. [2023-08-31 23:13:26,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 210 flow [2023-08-31 23:13:26,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:13:26,654 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2023-08-31 23:13:26,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-31 23:13:26,655 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-31 23:13:26,655 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2023-08-31 23:13:26,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:26,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:26,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:26,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:13:26,656 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-31 23:13:26,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash 740399366, now seen corresponding path program 1 times [2023-08-31 23:13:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:26,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136709556] [2023-08-31 23:13:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:26,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:27,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:27,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136709556] [2023-08-31 23:13:27,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136709556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:27,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:27,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504379084] [2023-08-31 23:13:27,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:27,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:27,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:27,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:27,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 273 [2023-08-31 23:13:27,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:27,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:27,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 273 [2023-08-31 23:13:27,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:29,029 INFO L130 PetriNetUnfolder]: 11969/16020 cut-off events. [2023-08-31 23:13:29,029 INFO L131 PetriNetUnfolder]: For 805/805 co-relation queries the response was YES. [2023-08-31 23:13:29,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33101 conditions, 16020 events. 11969/16020 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 77964 event pairs, 2649 based on Foata normal form. 0/15619 useless extension candidates. Maximal degree in co-relation 33097. Up to 8101 conditions per place. [2023-08-31 23:13:29,126 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 67 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2023-08-31 23:13:29,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 308 flow [2023-08-31 23:13:29,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-31 23:13:29,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47545787545787543 [2023-08-31 23:13:29,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-31 23:13:29,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-31 23:13:29,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:29,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-31 23:13:29,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,135 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,135 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 5 states and 649 transitions. [2023-08-31 23:13:29,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 308 flow [2023-08-31 23:13:29,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:29,139 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 102 flow [2023-08-31 23:13:29,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-31 23:13:29,140 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-08-31 23:13:29,143 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 102 flow [2023-08-31 23:13:29,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:29,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:29,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:13:29,145 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:13:29,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:29,145 INFO L85 PathProgramCache]: Analyzing trace with hash 740399408, now seen corresponding path program 1 times [2023-08-31 23:13:29,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788694307] [2023-08-31 23:13:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:29,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:29,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788694307] [2023-08-31 23:13:29,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788694307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:29,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:13:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650254156] [2023-08-31 23:13:29,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:29,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:13:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:29,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:13:29,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:13:29,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 273 [2023-08-31 23:13:29,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:29,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:29,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 273 [2023-08-31 23:13:29,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:30,849 INFO L130 PetriNetUnfolder]: 4855/6963 cut-off events. [2023-08-31 23:13:30,850 INFO L131 PetriNetUnfolder]: For 1696/1696 co-relation queries the response was YES. [2023-08-31 23:13:30,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15174 conditions, 6963 events. 4855/6963 cut-off events. For 1696/1696 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 37618 event pairs, 712 based on Foata normal form. 512/7475 useless extension candidates. Maximal degree in co-relation 15167. Up to 4384 conditions per place. [2023-08-31 23:13:30,886 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 49 selfloop transitions, 5 changer transitions 2/60 dead transitions. [2023-08-31 23:13:30,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 262 flow [2023-08-31 23:13:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:13:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:13:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 827 transitions. [2023-08-31 23:13:30,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43275771847200417 [2023-08-31 23:13:30,890 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 827 transitions. [2023-08-31 23:13:30,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 827 transitions. [2023-08-31 23:13:30,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:30,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 827 transitions. [2023-08-31 23:13:30,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,897 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,897 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 102 flow. Second operand 7 states and 827 transitions. [2023-08-31 23:13:30,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 262 flow [2023-08-31 23:13:30,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:30,915 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 86 flow [2023-08-31 23:13:30,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=86, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-08-31 23:13:30,916 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-08-31 23:13:30,917 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 86 flow [2023-08-31 23:13:30,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.71428571428571) internal successors, (782), 7 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:30,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:30,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:30,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:13:30,918 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-31 23:13:30,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1243043692, now seen corresponding path program 1 times [2023-08-31 23:13:30,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:30,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830790095] [2023-08-31 23:13:30,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:30,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830790095] [2023-08-31 23:13:31,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830790095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:31,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:13:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711304215] [2023-08-31 23:13:31,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:31,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:13:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:13:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:13:31,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 273 [2023-08-31 23:13:31,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 29 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:31,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:31,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 273 [2023-08-31 23:13:31,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:32,285 INFO L130 PetriNetUnfolder]: 4915/6914 cut-off events. [2023-08-31 23:13:32,285 INFO L131 PetriNetUnfolder]: For 1448/1448 co-relation queries the response was YES. [2023-08-31 23:13:32,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14758 conditions, 6914 events. 4915/6914 cut-off events. For 1448/1448 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 35169 event pairs, 2535 based on Foata normal form. 240/7129 useless extension candidates. Maximal degree in co-relation 14751. Up to 6001 conditions per place. [2023-08-31 23:13:32,316 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 35 selfloop transitions, 5 changer transitions 19/63 dead transitions. [2023-08-31 23:13:32,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 286 flow [2023-08-31 23:13:32,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-08-31 23:13:32,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062271062271062 [2023-08-31 23:13:32,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-08-31 23:13:32,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-08-31 23:13:32,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:32,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-08-31 23:13:32,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,325 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,325 INFO L175 Difference]: Start difference. First operand has 51 places, 29 transitions, 86 flow. Second operand 5 states and 691 transitions. [2023-08-31 23:13:32,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 286 flow [2023-08-31 23:13:32,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 265 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-08-31 23:13:32,345 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 116 flow [2023-08-31 23:13:32,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-08-31 23:13:32,347 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-08-31 23:13:32,347 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 116 flow [2023-08-31 23:13:32,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:32,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:32,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:13:32,348 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-31 23:13:32,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash 618477214, now seen corresponding path program 1 times [2023-08-31 23:13:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417092535] [2023-08-31 23:13:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:32,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:32,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417092535] [2023-08-31 23:13:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417092535] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864011129] [2023-08-31 23:13:32,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:32,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:32,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:32,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:32,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:32,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:32,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:32,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:32,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:33,635 INFO L130 PetriNetUnfolder]: 5045/7160 cut-off events. [2023-08-31 23:13:33,636 INFO L131 PetriNetUnfolder]: For 4331/4566 co-relation queries the response was YES. [2023-08-31 23:13:33,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18761 conditions, 7160 events. 5045/7160 cut-off events. For 4331/4566 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 37039 event pairs, 2373 based on Foata normal form. 265/7393 useless extension candidates. Maximal degree in co-relation 18753. Up to 5519 conditions per place. [2023-08-31 23:13:33,676 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 52 selfloop transitions, 9 changer transitions 30/95 dead transitions. [2023-08-31 23:13:33,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 512 flow [2023-08-31 23:13:33,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:13:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:13:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 951 transitions. [2023-08-31 23:13:33,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976452119309262 [2023-08-31 23:13:33,679 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 951 transitions. [2023-08-31 23:13:33,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 951 transitions. [2023-08-31 23:13:33,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:33,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 951 transitions. [2023-08-31 23:13:33,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:33,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:33,685 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:33,686 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 116 flow. Second operand 7 states and 951 transitions. [2023-08-31 23:13:33,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 512 flow [2023-08-31 23:13:33,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 95 transitions, 505 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:33,697 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 198 flow [2023-08-31 23:13:33,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=198, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-08-31 23:13:33,698 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-08-31 23:13:33,698 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 198 flow [2023-08-31 23:13:33,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:33,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:33,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:33,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:13:33,699 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-31 23:13:33,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash -592641707, now seen corresponding path program 1 times [2023-08-31 23:13:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:33,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485864372] [2023-08-31 23:13:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:33,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:34,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:34,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485864372] [2023-08-31 23:13:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485864372] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:34,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:34,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295851934] [2023-08-31 23:13:34,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:34,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:34,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:34,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:34,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:34,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:34,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:34,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:34,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:34,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:34,845 INFO L130 PetriNetUnfolder]: 4917/7044 cut-off events. [2023-08-31 23:13:34,845 INFO L131 PetriNetUnfolder]: For 13491/14136 co-relation queries the response was YES. [2023-08-31 23:13:34,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23176 conditions, 7044 events. 4917/7044 cut-off events. For 13491/14136 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 36851 event pairs, 1419 based on Foata normal form. 177/7165 useless extension candidates. Maximal degree in co-relation 23164. Up to 5157 conditions per place. [2023-08-31 23:13:34,890 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 57 selfloop transitions, 11 changer transitions 18/90 dead transitions. [2023-08-31 23:13:34,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 90 transitions, 590 flow [2023-08-31 23:13:34,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:13:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:13:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2023-08-31 23:13:34,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987789987789988 [2023-08-31 23:13:34,894 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2023-08-31 23:13:34,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2023-08-31 23:13:34,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:34,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2023-08-31 23:13:34,897 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-31 23:13:34,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:34,900 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:34,900 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 198 flow. Second operand 6 states and 817 transitions. [2023-08-31 23:13:34,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 90 transitions, 590 flow [2023-08-31 23:13:34,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 90 transitions, 564 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:34,948 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 255 flow [2023-08-31 23:13:34,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-31 23:13:34,949 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-31 23:13:34,949 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 255 flow [2023-08-31 23:13:34,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:34,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:34,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:34,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:13:34,950 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-31 23:13:34,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1304703093, now seen corresponding path program 2 times [2023-08-31 23:13:34,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:34,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738637530] [2023-08-31 23:13:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:35,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-31 23:13:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738637530] [2023-08-31 23:13:35,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738637530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:35,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:35,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:35,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034892933] [2023-08-31 23:13:35,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:35,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:35,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:35,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:35,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:35,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:35,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:35,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:36,258 INFO L130 PetriNetUnfolder]: 4952/7087 cut-off events. [2023-08-31 23:13:36,258 INFO L131 PetriNetUnfolder]: For 18236/18958 co-relation queries the response was YES. [2023-08-31 23:13:36,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25279 conditions, 7087 events. 4952/7087 cut-off events. For 18236/18958 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 37096 event pairs, 1421 based on Foata normal form. 199/7230 useless extension candidates. Maximal degree in co-relation 25265. Up to 5165 conditions per place. [2023-08-31 23:13:36,300 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 58 selfloop transitions, 14 changer transitions 25/101 dead transitions. [2023-08-31 23:13:36,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 101 transitions, 741 flow [2023-08-31 23:13:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:13:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:13:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 948 transitions. [2023-08-31 23:13:36,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49607535321821034 [2023-08-31 23:13:36,304 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 948 transitions. [2023-08-31 23:13:36,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 948 transitions. [2023-08-31 23:13:36,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:36,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 948 transitions. [2023-08-31 23:13:36,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.42857142857142) internal successors, (948), 7 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:36,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:36,310 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:36,310 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 255 flow. Second operand 7 states and 948 transitions. [2023-08-31 23:13:36,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 101 transitions, 741 flow [2023-08-31 23:13:36,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 101 transitions, 703 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:36,362 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 319 flow [2023-08-31 23:13:36,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-08-31 23:13:36,362 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2023-08-31 23:13:36,363 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 319 flow [2023-08-31 23:13:36,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:36,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:36,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:36,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:13:36,364 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-31 23:13:36,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:36,364 INFO L85 PathProgramCache]: Analyzing trace with hash -145929031, now seen corresponding path program 1 times [2023-08-31 23:13:36,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:36,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858224153] [2023-08-31 23:13:36,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:36,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:36,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:36,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858224153] [2023-08-31 23:13:36,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858224153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:36,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:36,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:36,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36032229] [2023-08-31 23:13:36,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:36,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:36,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 273 [2023-08-31 23:13:36,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:36,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:36,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 273 [2023-08-31 23:13:36,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:37,803 INFO L130 PetriNetUnfolder]: 5697/8166 cut-off events. [2023-08-31 23:13:37,803 INFO L131 PetriNetUnfolder]: For 34426/35222 co-relation queries the response was YES. [2023-08-31 23:13:37,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32079 conditions, 8166 events. 5697/8166 cut-off events. For 34426/35222 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 44401 event pairs, 1285 based on Foata normal form. 251/8375 useless extension candidates. Maximal degree in co-relation 32063. Up to 5357 conditions per place. [2023-08-31 23:13:37,889 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 73 selfloop transitions, 19 changer transitions 33/129 dead transitions. [2023-08-31 23:13:37,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 129 transitions, 1056 flow [2023-08-31 23:13:37,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:13:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:13:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1237 transitions. [2023-08-31 23:13:37,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034595034595034 [2023-08-31 23:13:37,893 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1237 transitions. [2023-08-31 23:13:37,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1237 transitions. [2023-08-31 23:13:37,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:37,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1237 transitions. [2023-08-31 23:13:37,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.44444444444446) internal successors, (1237), 9 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:37,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:37,901 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:37,901 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 319 flow. Second operand 9 states and 1237 transitions. [2023-08-31 23:13:37,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 129 transitions, 1056 flow [2023-08-31 23:13:37,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 1017 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:37,957 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 467 flow [2023-08-31 23:13:37,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=467, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-31 23:13:37,957 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 17 predicate places. [2023-08-31 23:13:37,957 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 467 flow [2023-08-31 23:13:37,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:37,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:37,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:37,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:13:37,959 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-31 23:13:37,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:37,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1189329743, now seen corresponding path program 1 times [2023-08-31 23:13:37,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:37,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679733871] [2023-08-31 23:13:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:37,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:38,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:38,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679733871] [2023-08-31 23:13:38,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679733871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:38,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:38,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:38,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135516175] [2023-08-31 23:13:38,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:38,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:38,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:38,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:38,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:38,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 273 [2023-08-31 23:13:38,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 467 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:38,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:38,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 273 [2023-08-31 23:13:38,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:40,950 INFO L130 PetriNetUnfolder]: 16889/22840 cut-off events. [2023-08-31 23:13:40,950 INFO L131 PetriNetUnfolder]: For 155220/155220 co-relation queries the response was YES. [2023-08-31 23:13:41,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99024 conditions, 22840 events. 16889/22840 cut-off events. For 155220/155220 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 117553 event pairs, 3179 based on Foata normal form. 412/23252 useless extension candidates. Maximal degree in co-relation 99004. Up to 15253 conditions per place. [2023-08-31 23:13:41,101 INFO L137 encePairwiseOnDemand]: 260/273 looper letters, 102 selfloop transitions, 30 changer transitions 43/175 dead transitions. [2023-08-31 23:13:41,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 175 transitions, 1766 flow [2023-08-31 23:13:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:13:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:13:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1248 transitions. [2023-08-31 23:13:41,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2023-08-31 23:13:41,105 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1248 transitions. [2023-08-31 23:13:41,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1248 transitions. [2023-08-31 23:13:41,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:41,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1248 transitions. [2023-08-31 23:13:41,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.8) internal successors, (1248), 10 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:41,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:41,113 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:41,113 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 467 flow. Second operand 10 states and 1248 transitions. [2023-08-31 23:13:41,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 175 transitions, 1766 flow [2023-08-31 23:13:41,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 175 transitions, 1589 flow, removed 81 selfloop flow, removed 4 redundant places. [2023-08-31 23:13:41,575 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 744 flow [2023-08-31 23:13:41,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=744, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2023-08-31 23:13:41,576 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2023-08-31 23:13:41,576 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 744 flow [2023-08-31 23:13:41,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:41,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:41,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:41,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:13:41,577 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-31 23:13:41,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:41,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1740010197, now seen corresponding path program 2 times [2023-08-31 23:13:41,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:41,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977274982] [2023-08-31 23:13:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:41,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:41,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:41,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977274982] [2023-08-31 23:13:41,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977274982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:41,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:41,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:41,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347652969] [2023-08-31 23:13:41,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:41,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:41,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:41,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:41,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:41,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:41,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 744 flow. Second operand has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:41,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:41,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:41,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:43,152 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 60#$Ultimate##0true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,153 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-31 23:13:43,153 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:13:43,153 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:13:43,153 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-31 23:13:43,383 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 60#$Ultimate##0true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,383 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-08-31 23:13:43,383 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-31 23:13:43,383 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-31 23:13:43,383 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-31 23:13:43,384 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [60#$Ultimate##0true, Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,385 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-08-31 23:13:43,385 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-31 23:13:43,385 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-31 23:13:43,385 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-08-31 23:13:43,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= v_~x$w_buff1_used~0_106 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff0_used~0_119 (ite .cse4 0 v_~x$w_buff0_used~0_120)) (= (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_54)) v_~x~0_53)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][73], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 107#L813true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,413 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,414 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,414 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,414 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,414 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,415 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,415 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,415 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,415 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,417 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,417 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,417 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,417 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,417 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 60#$Ultimate##0true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,423 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,423 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,423 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,423 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,423 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [60#$Ultimate##0true, Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,423 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,423 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,423 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,424 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [60#$Ultimate##0true, Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,424 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,425 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,425 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,425 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-31 23:13:43,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,650 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,650 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,650 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,650 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,652 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,652 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,652 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,652 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,652 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,654 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,654 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,654 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,654 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-31 23:13:43,690 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= v_~x$w_buff1_used~0_106 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff0_used~0_119 (ite .cse4 0 v_~x$w_buff0_used~0_120)) (= (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_54)) v_~x~0_53)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][73], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 107#L813true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,690 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,690 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,690 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,690 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,691 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,691 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,691 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,691 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,691 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,691 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 113#L826true, Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,692 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,692 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,692 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,692 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,692 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,692 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,693 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,693 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,693 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,693 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,694 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,694 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,694 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,694 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,695 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 88#L803true, 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,695 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,695 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,695 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,696 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,697 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= v_~x$w_buff1_used~0_106 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff0_used~0_119 (ite .cse4 0 v_~x$w_buff0_used~0_120)) (= (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_54)) v_~x~0_53)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][73], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 107#L813true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,697 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,697 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,697 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,697 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,698 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,698 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,698 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,698 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,699 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:43,923 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([408] L756-->L763: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_141 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_140 256) 0)))) 0 v_~x$r_buff1_thd1~0_22) v_~x$r_buff1_thd1~0_21) (= (ite .cse2 v_~x$w_buff0~0_70 (ite .cse3 v_~x$w_buff1~0_65 v_~x~0_88)) v_~x~0_87) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_141) v_~x$w_buff1_used~0_140) (= v_~x$r_buff0_thd1~0_23 (ite .cse4 0 v_~x$r_buff0_thd1~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_141, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_88, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_70, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_140, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_87, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][55], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,924 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,924 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,924 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,924 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,928 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([423] L806-->L813: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_119 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse4 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_120 256) 0)))) (.cse1 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_107 256) 0))))) (and (= v_~x$w_buff1_used~0_106 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_107)) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse2) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_18)) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff0_used~0_119 (ite .cse4 0 v_~x$w_buff0_used~0_120)) (= (ite .cse4 v_~x$w_buff0~0_48 (ite .cse1 v_~x$w_buff1~0_43 v_~x~0_54)) v_~x~0_53)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_120} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_48, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][73], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 107#L813true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,928 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,928 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,928 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,928 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,940 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,941 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-31 23:13:43,941 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-31 23:13:43,941 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-31 23:13:43,941 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-31 23:13:43,941 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][109], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 132#L836true, 110#L871true, 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,941 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,941 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,941 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,941 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,943 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 65#L793true, Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,943 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-08-31 23:13:43,943 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-31 23:13:43,943 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-31 23:13:43,943 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-08-31 23:13:43,943 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] L871-->L888: Formula: (let ((.cse10 (= 0 (mod v_~x$r_buff1_thd0~0_78 256))) (.cse7 (= (mod v_~x$r_buff0_thd0~0_76 256) 0))) (let ((.cse9 (not .cse7)) (.cse2 (and .cse10 .cse7)) (.cse3 (and (= (mod v_~x$w_buff1_used~0_155 256) 0) .cse7)) (.cse13 (= (mod v_~x$w_buff0_used~0_176 256) 0))) (let ((.cse5 (or .cse2 .cse3 .cse13)) (.cse6 (and .cse9 (not .cse13)))) (let ((.cse1 (ite .cse5 v_~x~0_94 (ite .cse6 v_~x$w_buff0~0_91 v_~x$w_buff1~0_76))) (.cse0 (not (= (mod v_~weak$$choice2~0_36 256) 0))) (.cse4 (= (mod v_~x$w_buff0_used~0_175 256) 0)) (.cse8 (= (mod v_~x$w_buff1_used~0_154 256) 0))) (and (= v_~x~0_93 (ite .cse0 v_~x$mem_tmp~0_18 .cse1)) (= v_~x$w_buff1_used~0_154 (ite .cse0 v_~x$w_buff1_used~0_155 (ite (or .cse2 .cse3 .cse4) v_~x$w_buff1_used~0_155 0))) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 2 .cse1) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~__unbuffered_p2_EAX~0_20 0) (= v_~__unbuffered_p1_EAX~0_20 0))) 1 0) 0) 0 1)) (= (ite .cse0 v_~x$w_buff0_used~0_176 (ite .cse5 v_~x$w_buff0_used~0_176 (ite .cse6 0 v_~x$w_buff0_used~0_176))) v_~x$w_buff0_used~0_175) (= v_~x$flush_delayed~0_21 0) (= v_~x$w_buff0~0_91 v_~x$w_buff0~0_90) (= (ite .cse0 v_~x$r_buff0_thd0~0_76 (ite (or .cse2 (and .cse7 .cse8) .cse4) v_~x$r_buff0_thd0~0_76 (ite (and .cse9 (not .cse4)) 0 v_~x$r_buff0_thd0~0_76))) v_~x$r_buff0_thd0~0_75) (= v_~x~0_94 v_~x$mem_tmp~0_18) (= v_~x$r_buff1_thd0~0_77 (ite .cse0 v_~x$r_buff1_thd0~0_78 (ite (let ((.cse11 (= (mod v_~x$r_buff0_thd0~0_75 256) 0))) (or .cse4 (and .cse10 .cse11) (and .cse8 .cse11))) v_~x$r_buff1_thd0~0_78 0))) (= (let ((.cse12 (mod (mod v_~main$tmp_guard1~0_20 256) 4294967296))) (ite (<= .cse12 2147483647) .cse12 (+ .cse12 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|) (= v_~x$w_buff1~0_76 v_~x$w_buff1~0_75)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_91, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_76, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_155, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_78, ~x~0=v_~x~0_94, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_176} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_75, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_75, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_154, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_175, ~weak$$choice0~0=v_~weak$$choice0~0_17, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_23|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~x~0=v_~x~0_93} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet12#1, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~weak$$choice2~0, ~x~0][115], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 20#L888true, 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 109#L829true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork0InUse, Black: 277#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 275#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 121#L806true, Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 279#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 52#L756true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 89#P1EXITtrue, Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:43,943 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,943 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,943 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:43,944 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:44,339 INFO L130 PetriNetUnfolder]: 14145/19966 cut-off events. [2023-08-31 23:13:44,340 INFO L131 PetriNetUnfolder]: For 240147/242262 co-relation queries the response was YES. [2023-08-31 23:13:44,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111098 conditions, 19966 events. 14145/19966 cut-off events. For 240147/242262 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 116031 event pairs, 3323 based on Foata normal form. 658/19980 useless extension candidates. Maximal degree in co-relation 111073. Up to 12260 conditions per place. [2023-08-31 23:13:44,589 INFO L137 encePairwiseOnDemand]: 263/273 looper letters, 82 selfloop transitions, 38 changer transitions 10/141 dead transitions. [2023-08-31 23:13:44,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 141 transitions, 1552 flow [2023-08-31 23:13:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:13:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:13:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2023-08-31 23:13:44,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4955520669806384 [2023-08-31 23:13:44,592 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 947 transitions. [2023-08-31 23:13:44,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 947 transitions. [2023-08-31 23:13:44,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:44,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 947 transitions. [2023-08-31 23:13:44,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.28571428571428) internal successors, (947), 7 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:44,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:44,598 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:44,598 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 744 flow. Second operand 7 states and 947 transitions. [2023-08-31 23:13:44,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 141 transitions, 1552 flow [2023-08-31 23:13:45,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 141 transitions, 1419 flow, removed 66 selfloop flow, removed 6 redundant places. [2023-08-31 23:13:45,088 INFO L231 Difference]: Finished difference. Result has 78 places, 92 transitions, 1012 flow [2023-08-31 23:13:45,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1012, PETRI_PLACES=78, PETRI_TRANSITIONS=92} [2023-08-31 23:13:45,088 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-08-31 23:13:45,089 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 92 transitions, 1012 flow [2023-08-31 23:13:45,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:45,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:45,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:45,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:13:45,090 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-31 23:13:45,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash 851047931, now seen corresponding path program 3 times [2023-08-31 23:13:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:45,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083233120] [2023-08-31 23:13:45,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:45,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:45,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:45,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083233120] [2023-08-31 23:13:45,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083233120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:45,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:45,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:13:45,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130312083] [2023-08-31 23:13:45,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:45,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:13:45,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:45,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:13:45,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:13:45,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 273 [2023-08-31 23:13:45,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 92 transitions, 1012 flow. Second operand has 8 states, 8 states have (on average 117.125) internal successors, (937), 8 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:45,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:45,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 273 [2023-08-31 23:13:45,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:48,189 INFO L130 PetriNetUnfolder]: 18854/25537 cut-off events. [2023-08-31 23:13:48,189 INFO L131 PetriNetUnfolder]: For 190103/190103 co-relation queries the response was YES. [2023-08-31 23:13:48,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131896 conditions, 25537 events. 18854/25537 cut-off events. For 190103/190103 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 135726 event pairs, 3033 based on Foata normal form. 390/25927 useless extension candidates. Maximal degree in co-relation 131874. Up to 12542 conditions per place. [2023-08-31 23:13:48,404 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 86 selfloop transitions, 46 changer transitions 36/168 dead transitions. [2023-08-31 23:13:48,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 168 transitions, 1993 flow [2023-08-31 23:13:48,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:13:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:13:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1030 transitions. [2023-08-31 23:13:48,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716117216117216 [2023-08-31 23:13:48,407 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1030 transitions. [2023-08-31 23:13:48,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1030 transitions. [2023-08-31 23:13:48,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:48,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1030 transitions. [2023-08-31 23:13:48,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.75) internal successors, (1030), 8 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,413 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,413 INFO L175 Difference]: Start difference. First operand has 78 places, 92 transitions, 1012 flow. Second operand 8 states and 1030 transitions. [2023-08-31 23:13:48,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 168 transitions, 1993 flow [2023-08-31 23:13:48,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 168 transitions, 1909 flow, removed 28 selfloop flow, removed 4 redundant places. [2023-08-31 23:13:48,760 INFO L231 Difference]: Finished difference. Result has 85 places, 96 transitions, 1184 flow [2023-08-31 23:13:48,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1184, PETRI_PLACES=85, PETRI_TRANSITIONS=96} [2023-08-31 23:13:48,760 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2023-08-31 23:13:48,760 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 96 transitions, 1184 flow [2023-08-31 23:13:48,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.125) internal successors, (937), 8 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:48,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:48,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:13:48,761 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-31 23:13:48,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:48,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2023680085, now seen corresponding path program 1 times [2023-08-31 23:13:48,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:48,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648936985] [2023-08-31 23:13:48,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:48,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648936985] [2023-08-31 23:13:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648936985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:13:48,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903092210] [2023-08-31 23:13:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:48,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:13:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:48,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:13:48,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:13:48,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:48,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 96 transitions, 1184 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:48,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:48,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:48,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:50,245 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][128], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 308#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 317#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 319#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 114#L865true, 18#P2EXITtrue, Black: 315#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 313#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 326#true, 132#L836true, 80#L783true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 293#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 307#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:50,245 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-31 23:13:50,245 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:50,245 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:50,245 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-31 23:13:50,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][128], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 308#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 317#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 319#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 114#L865true, 18#P2EXITtrue, Black: 315#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 313#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 326#true, 132#L836true, 80#L783true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 293#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 127#P0EXITtrue, 307#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:50,422 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:13:50,422 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:50,422 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:50,422 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:50,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][128], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 308#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 317#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 319#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 18#P2EXITtrue, Black: 315#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 313#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 326#true, 132#L836true, 110#L871true, 80#L783true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 293#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 4#L763true, 307#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:50,424 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-31 23:13:50,424 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:50,425 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:50,425 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-31 23:13:50,567 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([431] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][128], [Black: 186#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 244#(and (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 308#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0)), Black: 245#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 317#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 319#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 18#P2EXITtrue, Black: 315#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 313#(and (= ~x$w_buff1_used~0 0) (not (= 2 ~x~0)) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 292#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), 157#true, 263#(and (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd0~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 198#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0)), 194#true, P2Thread1of1ForFork1InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, Black: 271#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, Black: 269#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0)), Black: 273#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 267#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 219#(and (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1)), 326#true, 132#L836true, 110#L871true, 80#L783true, Black: 166#(= ~__unbuffered_p3_EAX~0 0), Black: 293#(and (= 0 ~x$w_buff1~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 229#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 182#(and (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|)) (not (= |ULTIMATE.start_main_~#t490~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t491~0#1.base| |ULTIMATE.start_main_~#t489~0#1.base|)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t491~0#1.base|)) (= |ULTIMATE.start_main_old_#valid#1| (store (store (store (store |#valid| |ULTIMATE.start_main_~#t489~0#1.base| 0) |ULTIMATE.start_main_~#t490~0#1.base| 0) |ULTIMATE.start_main_~#t491~0#1.base| 0) |ULTIMATE.start_main_~#t492~0#1.base| 0)) (not (= |ULTIMATE.start_main_~#t492~0#1.base| |ULTIMATE.start_main_~#t490~0#1.base|))), 127#P0EXITtrue, 307#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 250#(and (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 189#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)))]) [2023-08-31 23:13:50,567 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-31 23:13:50,568 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:13:50,568 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:13:50,568 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-31 23:13:50,784 INFO L130 PetriNetUnfolder]: 8383/12020 cut-off events. [2023-08-31 23:13:50,785 INFO L131 PetriNetUnfolder]: For 202573/208298 co-relation queries the response was YES. [2023-08-31 23:13:50,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77789 conditions, 12020 events. 8383/12020 cut-off events. For 202573/208298 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 68320 event pairs, 1928 based on Foata normal form. 1455/12785 useless extension candidates. Maximal degree in co-relation 77763. Up to 9098 conditions per place. [2023-08-31 23:13:50,913 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 133 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2023-08-31 23:13:50,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 155 transitions, 2232 flow [2023-08-31 23:13:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:13:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:13:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-31 23:13:50,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503052503052503 [2023-08-31 23:13:50,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-31 23:13:50,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-31 23:13:50,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:50,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-31 23:13:50,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,917 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:50,917 INFO L175 Difference]: Start difference. First operand has 85 places, 96 transitions, 1184 flow. Second operand 3 states and 412 transitions. [2023-08-31 23:13:50,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 155 transitions, 2232 flow [2023-08-31 23:13:51,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 155 transitions, 2066 flow, removed 43 selfloop flow, removed 7 redundant places. [2023-08-31 23:13:51,154 INFO L231 Difference]: Finished difference. Result has 78 places, 100 transitions, 1117 flow [2023-08-31 23:13:51,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1117, PETRI_PLACES=78, PETRI_TRANSITIONS=100} [2023-08-31 23:13:51,154 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-08-31 23:13:51,154 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 100 transitions, 1117 flow [2023-08-31 23:13:51,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:51,155 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-31 23:13:51,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:13:51,155 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-31 23:13:51,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -716551583, now seen corresponding path program 1 times [2023-08-31 23:13:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693230343] [2023-08-31 23:13:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:51,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:51,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693230343] [2023-08-31 23:13:51,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693230343] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:51,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:51,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:13:51,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403036564] [2023-08-31 23:13:51,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:51,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:13:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:13:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:13:51,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:51,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 100 transitions, 1117 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:51,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:51,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:51,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:52,524 INFO L130 PetriNetUnfolder]: 4334/6562 cut-off events. [2023-08-31 23:13:52,525 INFO L131 PetriNetUnfolder]: For 75737/78533 co-relation queries the response was YES. [2023-08-31 23:13:52,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38796 conditions, 6562 events. 4334/6562 cut-off events. For 75737/78533 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 36640 event pairs, 619 based on Foata normal form. 1131/7436 useless extension candidates. Maximal degree in co-relation 38773. Up to 2862 conditions per place. [2023-08-31 23:13:52,562 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 174 selfloop transitions, 9 changer transitions 0/200 dead transitions. [2023-08-31 23:13:52,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 2750 flow [2023-08-31 23:13:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:13:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:13:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-08-31 23:13:52,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045787545787546 [2023-08-31 23:13:52,564 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-08-31 23:13:52,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-08-31 23:13:52,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:52,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-08-31 23:13:52,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,568 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 273.0) internal successors, (1365), 5 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,568 INFO L175 Difference]: Start difference. First operand has 78 places, 100 transitions, 1117 flow. Second operand 4 states and 551 transitions. [2023-08-31 23:13:52,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 2750 flow [2023-08-31 23:13:52,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 2745 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:13:52,629 INFO L231 Difference]: Finished difference. Result has 81 places, 101 transitions, 1128 flow [2023-08-31 23:13:52,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1128, PETRI_PLACES=81, PETRI_TRANSITIONS=101} [2023-08-31 23:13:52,630 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2023-08-31 23:13:52,630 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 101 transitions, 1128 flow [2023-08-31 23:13:52,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:52,630 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-31 23:13:52,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:13:52,631 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-31 23:13:52,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:52,631 INFO L85 PathProgramCache]: Analyzing trace with hash -383741557, now seen corresponding path program 1 times [2023-08-31 23:13:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:52,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297580423] [2023-08-31 23:13:52,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:52,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297580423] [2023-08-31 23:13:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297580423] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:52,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:52,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:52,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652377935] [2023-08-31 23:13:52,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:52,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:52,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:52,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:52,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:52,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:52,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 101 transitions, 1128 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:52,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:52,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:52,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:53,694 INFO L130 PetriNetUnfolder]: 3354/5031 cut-off events. [2023-08-31 23:13:53,695 INFO L131 PetriNetUnfolder]: For 62320/64561 co-relation queries the response was YES. [2023-08-31 23:13:53,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30736 conditions, 5031 events. 3354/5031 cut-off events. For 62320/64561 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 27419 event pairs, 466 based on Foata normal form. 816/5614 useless extension candidates. Maximal degree in co-relation 30712. Up to 2272 conditions per place. [2023-08-31 23:13:53,732 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 184 selfloop transitions, 13 changer transitions 0/214 dead transitions. [2023-08-31 23:13:53,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 214 transitions, 2953 flow [2023-08-31 23:13:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2023-08-31 23:13:53,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504029304029304 [2023-08-31 23:13:53,735 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2023-08-31 23:13:53,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2023-08-31 23:13:53,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:53,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2023-08-31 23:13:53,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,752 INFO L175 Difference]: Start difference. First operand has 81 places, 101 transitions, 1128 flow. Second operand 5 states and 688 transitions. [2023-08-31 23:13:53,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 214 transitions, 2953 flow [2023-08-31 23:13:53,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 214 transitions, 2836 flow, removed 23 selfloop flow, removed 5 redundant places. [2023-08-31 23:13:53,851 INFO L231 Difference]: Finished difference. Result has 81 places, 99 transitions, 1063 flow [2023-08-31 23:13:53,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1063, PETRI_PLACES=81, PETRI_TRANSITIONS=99} [2023-08-31 23:13:53,851 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2023-08-31 23:13:53,851 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 99 transitions, 1063 flow [2023-08-31 23:13:53,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:53,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:53,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:53,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:13:53,852 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-31 23:13:53,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:53,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2091572267, now seen corresponding path program 1 times [2023-08-31 23:13:53,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:53,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393478047] [2023-08-31 23:13:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:54,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:54,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393478047] [2023-08-31 23:13:54,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393478047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:54,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:54,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:54,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764588749] [2023-08-31 23:13:54,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:54,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:54,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:54,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 99 transitions, 1063 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:54,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:54,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:54,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:55,121 INFO L130 PetriNetUnfolder]: 4830/7419 cut-off events. [2023-08-31 23:13:55,121 INFO L131 PetriNetUnfolder]: For 67836/68861 co-relation queries the response was YES. [2023-08-31 23:13:55,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44261 conditions, 7419 events. 4830/7419 cut-off events. For 67836/68861 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 43313 event pairs, 716 based on Foata normal form. 432/7607 useless extension candidates. Maximal degree in co-relation 44237. Up to 3792 conditions per place. [2023-08-31 23:13:55,172 INFO L137 encePairwiseOnDemand]: 269/273 looper letters, 117 selfloop transitions, 2 changer transitions 80/213 dead transitions. [2023-08-31 23:13:55,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 213 transitions, 2701 flow [2023-08-31 23:13:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:13:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:13:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-31 23:13:55,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010989010989011 [2023-08-31 23:13:55,175 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-31 23:13:55,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-31 23:13:55,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:55,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-31 23:13:55,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:55,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:55,178 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:55,179 INFO L175 Difference]: Start difference. First operand has 81 places, 99 transitions, 1063 flow. Second operand 5 states and 684 transitions. [2023-08-31 23:13:55,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 213 transitions, 2701 flow [2023-08-31 23:13:55,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 213 transitions, 2611 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-31 23:13:55,508 INFO L231 Difference]: Finished difference. Result has 85 places, 98 transitions, 1038 flow [2023-08-31 23:13:55,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1038, PETRI_PLACES=85, PETRI_TRANSITIONS=98} [2023-08-31 23:13:55,509 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2023-08-31 23:13:55,509 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 1038 flow [2023-08-31 23:13:55,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:55,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:55,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:55,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:13:55,510 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-31 23:13:55,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash 706754159, now seen corresponding path program 2 times [2023-08-31 23:13:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:55,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554508789] [2023-08-31 23:13:55,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:55,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:56,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:56,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554508789] [2023-08-31 23:13:56,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554508789] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:56,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:56,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:13:56,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304498588] [2023-08-31 23:13:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:56,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:13:56,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:56,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:13:56,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:13:56,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:56,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 1038 flow. Second operand has 9 states, 9 states have (on average 125.44444444444444) internal successors, (1129), 9 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:56,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:56,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:56,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:57,598 INFO L130 PetriNetUnfolder]: 5462/8642 cut-off events. [2023-08-31 23:13:57,599 INFO L131 PetriNetUnfolder]: For 77370/78788 co-relation queries the response was YES. [2023-08-31 23:13:57,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49966 conditions, 8642 events. 5462/8642 cut-off events. For 77370/78788 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 53919 event pairs, 556 based on Foata normal form. 604/9022 useless extension candidates. Maximal degree in co-relation 49939. Up to 3816 conditions per place. [2023-08-31 23:13:57,655 INFO L137 encePairwiseOnDemand]: 265/273 looper letters, 121 selfloop transitions, 52 changer transitions 22/205 dead transitions. [2023-08-31 23:13:57,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 205 transitions, 2288 flow [2023-08-31 23:13:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-31 23:13:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-31 23:13:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1336 transitions. [2023-08-31 23:13:57,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48937728937728936 [2023-08-31 23:13:57,659 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1336 transitions. [2023-08-31 23:13:57,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1336 transitions. [2023-08-31 23:13:57,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:57,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1336 transitions. [2023-08-31 23:13:57,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:57,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:57,666 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 273.0) internal successors, (3003), 11 states have internal predecessors, (3003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:57,666 INFO L175 Difference]: Start difference. First operand has 85 places, 98 transitions, 1038 flow. Second operand 10 states and 1336 transitions. [2023-08-31 23:13:57,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 205 transitions, 2288 flow [2023-08-31 23:13:57,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 205 transitions, 2279 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 23:13:57,888 INFO L231 Difference]: Finished difference. Result has 97 places, 113 transitions, 1500 flow [2023-08-31 23:13:57,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1035, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1500, PETRI_PLACES=97, PETRI_TRANSITIONS=113} [2023-08-31 23:13:57,888 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2023-08-31 23:13:57,889 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 113 transitions, 1500 flow [2023-08-31 23:13:57,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 125.44444444444444) internal successors, (1129), 9 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:57,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:57,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:57,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:13:57,890 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-31 23:13:57,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1768836791, now seen corresponding path program 3 times [2023-08-31 23:13:57,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:57,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544748226] [2023-08-31 23:13:57,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:57,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:58,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:58,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544748226] [2023-08-31 23:13:58,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544748226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:58,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:58,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:13:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400863036] [2023-08-31 23:13:58,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:58,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:13:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:58,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:13:58,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:13:58,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:58,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 113 transitions, 1500 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:58,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:58,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:58,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:13:58,980 INFO L130 PetriNetUnfolder]: 4939/7516 cut-off events. [2023-08-31 23:13:58,980 INFO L131 PetriNetUnfolder]: For 115398/118561 co-relation queries the response was YES. [2023-08-31 23:13:59,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50547 conditions, 7516 events. 4939/7516 cut-off events. For 115398/118561 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 45977 event pairs, 568 based on Foata normal form. 1186/8451 useless extension candidates. Maximal degree in co-relation 50515. Up to 3300 conditions per place. [2023-08-31 23:13:59,029 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 206 selfloop transitions, 17 changer transitions 20/257 dead transitions. [2023-08-31 23:13:59,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 257 transitions, 4214 flow [2023-08-31 23:13:59,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:13:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:13:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2023-08-31 23:13:59,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49511599511599513 [2023-08-31 23:13:59,031 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 811 transitions. [2023-08-31 23:13:59,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 811 transitions. [2023-08-31 23:13:59,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:13:59,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 811 transitions. [2023-08-31 23:13:59,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:59,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:59,035 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 273.0) internal successors, (1911), 7 states have internal predecessors, (1911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:59,035 INFO L175 Difference]: Start difference. First operand has 97 places, 113 transitions, 1500 flow. Second operand 6 states and 811 transitions. [2023-08-31 23:13:59,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 257 transitions, 4214 flow [2023-08-31 23:13:59,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 257 transitions, 3726 flow, removed 207 selfloop flow, removed 7 redundant places. [2023-08-31 23:13:59,472 INFO L231 Difference]: Finished difference. Result has 93 places, 110 transitions, 1303 flow [2023-08-31 23:13:59,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1303, PETRI_PLACES=93, PETRI_TRANSITIONS=110} [2023-08-31 23:13:59,472 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2023-08-31 23:13:59,472 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 110 transitions, 1303 flow [2023-08-31 23:13:59,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:59,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:13:59,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:13:59,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:13:59,473 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-31 23:13:59,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:13:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1960583898, now seen corresponding path program 1 times [2023-08-31 23:13:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:13:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914919216] [2023-08-31 23:13:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:13:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:13:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:13:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:13:59,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:13:59,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914919216] [2023-08-31 23:13:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914919216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:13:59,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:13:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:13:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032200711] [2023-08-31 23:13:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:13:59,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:13:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:13:59,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:13:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:13:59,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-31 23:13:59,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 110 transitions, 1303 flow. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:13:59,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:13:59,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-31 23:13:59,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:00,635 INFO L130 PetriNetUnfolder]: 4802/7495 cut-off events. [2023-08-31 23:14:00,635 INFO L131 PetriNetUnfolder]: For 71782/72746 co-relation queries the response was YES. [2023-08-31 23:14:00,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46521 conditions, 7495 events. 4802/7495 cut-off events. For 71782/72746 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 46158 event pairs, 703 based on Foata normal form. 723/8076 useless extension candidates. Maximal degree in co-relation 46493. Up to 3315 conditions per place. [2023-08-31 23:14:00,685 INFO L137 encePairwiseOnDemand]: 269/273 looper letters, 114 selfloop transitions, 1 changer transitions 93/219 dead transitions. [2023-08-31 23:14:00,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 219 transitions, 3014 flow [2023-08-31 23:14:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2023-08-31 23:14:00,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48937728937728936 [2023-08-31 23:14:00,686 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2023-08-31 23:14:00,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2023-08-31 23:14:00,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:00,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2023-08-31 23:14:00,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:00,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:00,689 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:00,689 INFO L175 Difference]: Start difference. First operand has 93 places, 110 transitions, 1303 flow. Second operand 5 states and 668 transitions. [2023-08-31 23:14:00,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 219 transitions, 3014 flow [2023-08-31 23:14:00,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 219 transitions, 2621 flow, removed 138 selfloop flow, removed 9 redundant places. [2023-08-31 23:14:00,935 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 903 flow [2023-08-31 23:14:00,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=903, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2023-08-31 23:14:00,935 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2023-08-31 23:14:00,936 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 903 flow [2023-08-31 23:14:00,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:00,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:00,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:00,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:14:00,936 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:00,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 161994844, now seen corresponding path program 2 times [2023-08-31 23:14:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:00,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77014518] [2023-08-31 23:14:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:00,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:01,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77014518] [2023-08-31 23:14:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77014518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:01,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:01,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:14:01,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936605739] [2023-08-31 23:14:01,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:01,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:14:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:14:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:14:01,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 273 [2023-08-31 23:14:01,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 903 flow. Second operand has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:01,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:01,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 273 [2023-08-31 23:14:01,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:02,203 INFO L130 PetriNetUnfolder]: 3211/5127 cut-off events. [2023-08-31 23:14:02,203 INFO L131 PetriNetUnfolder]: For 29047/29487 co-relation queries the response was YES. [2023-08-31 23:14:02,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27669 conditions, 5127 events. 3211/5127 cut-off events. For 29047/29487 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 29703 event pairs, 482 based on Foata normal form. 419/5520 useless extension candidates. Maximal degree in co-relation 27643. Up to 2245 conditions per place. [2023-08-31 23:14:02,228 INFO L137 encePairwiseOnDemand]: 266/273 looper letters, 57 selfloop transitions, 3 changer transitions 132/195 dead transitions. [2023-08-31 23:14:02,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 195 transitions, 2253 flow [2023-08-31 23:14:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:14:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:14:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-31 23:14:02,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4484563055991627 [2023-08-31 23:14:02,229 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-31 23:14:02,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-31 23:14:02,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:02,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-31 23:14:02,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:02,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:02,232 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 273.0) internal successors, (2184), 8 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:02,232 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 903 flow. Second operand 7 states and 857 transitions. [2023-08-31 23:14:02,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 195 transitions, 2253 flow [2023-08-31 23:14:02,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 195 transitions, 2204 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-31 23:14:02,317 INFO L231 Difference]: Finished difference. Result has 92 places, 55 transitions, 434 flow [2023-08-31 23:14:02,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=434, PETRI_PLACES=92, PETRI_TRANSITIONS=55} [2023-08-31 23:14:02,318 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2023-08-31 23:14:02,318 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 55 transitions, 434 flow [2023-08-31 23:14:02,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:02,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:02,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:02,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-31 23:14:02,318 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:02,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:02,319 INFO L85 PathProgramCache]: Analyzing trace with hash 11983556, now seen corresponding path program 3 times [2023-08-31 23:14:02,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:02,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158852920] [2023-08-31 23:14:02,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:02,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:04,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:04,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158852920] [2023-08-31 23:14:04,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158852920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:04,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:04,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-31 23:14:04,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186654749] [2023-08-31 23:14:04,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:04,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 23:14:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 23:14:04,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-08-31 23:14:04,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 273 [2023-08-31 23:14:04,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 55 transitions, 434 flow. Second operand has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:04,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 273 [2023-08-31 23:14:04,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:04,864 INFO L130 PetriNetUnfolder]: 1972/3118 cut-off events. [2023-08-31 23:14:04,864 INFO L131 PetriNetUnfolder]: For 12966/12966 co-relation queries the response was YES. [2023-08-31 23:14:04,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15501 conditions, 3118 events. 1972/3118 cut-off events. For 12966/12966 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15628 event pairs, 245 based on Foata normal form. 1/3119 useless extension candidates. Maximal degree in co-relation 15475. Up to 1374 conditions per place. [2023-08-31 23:14:04,876 INFO L137 encePairwiseOnDemand]: 264/273 looper letters, 69 selfloop transitions, 10 changer transitions 59/138 dead transitions. [2023-08-31 23:14:04,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 138 transitions, 1246 flow [2023-08-31 23:14:04,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:14:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:14:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 959 transitions. [2023-08-31 23:14:04,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4391025641025641 [2023-08-31 23:14:04,878 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 959 transitions. [2023-08-31 23:14:04,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 959 transitions. [2023-08-31 23:14:04,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:04,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 959 transitions. [2023-08-31 23:14:04,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.875) internal successors, (959), 8 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,881 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 273.0) internal successors, (2457), 9 states have internal predecessors, (2457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,881 INFO L175 Difference]: Start difference. First operand has 92 places, 55 transitions, 434 flow. Second operand 8 states and 959 transitions. [2023-08-31 23:14:04,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 138 transitions, 1246 flow [2023-08-31 23:14:04,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 138 transitions, 1111 flow, removed 40 selfloop flow, removed 16 redundant places. [2023-08-31 23:14:04,929 INFO L231 Difference]: Finished difference. Result has 78 places, 54 transitions, 388 flow [2023-08-31 23:14:04,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=388, PETRI_PLACES=78, PETRI_TRANSITIONS=54} [2023-08-31 23:14:04,930 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2023-08-31 23:14:04,930 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 54 transitions, 388 flow [2023-08-31 23:14:04,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:04,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:04,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:04,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-31 23:14:04,930 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:04,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:04,931 INFO L85 PathProgramCache]: Analyzing trace with hash -387337818, now seen corresponding path program 4 times [2023-08-31 23:14:04,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:04,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792261658] [2023-08-31 23:14:04,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:04,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:14:04,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:14:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:14:05,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:14:05,067 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:14:05,068 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:14:05,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:14:05,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:14:05,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:14:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:14:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:14:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:14:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:14:05,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:14:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:14:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:14:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:14:05,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:14:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:14:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:14:05,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:14:05,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-31 23:14:05,074 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:05,081 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:14:05,081 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:14:05,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:14:05 BasicIcfg [2023-08-31 23:14:05,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:14:05,156 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:14:05,156 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:14:05,156 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:14:05,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:13:18" (3/4) ... [2023-08-31 23:14:05,159 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:14:05,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:14:05,160 INFO L158 Benchmark]: Toolchain (without parser) took 48492.36ms. Allocated memory was 86.0MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 65.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-31 23:14:05,160 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:05,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 581.94ms. Allocated memory is still 86.0MB. Free memory was 64.8MB in the beginning and 61.1MB in the end (delta: 3.7MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2023-08-31 23:14:05,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.15ms. Allocated memory is still 86.0MB. Free memory was 61.1MB in the beginning and 58.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:05,161 INFO L158 Benchmark]: Boogie Preprocessor took 60.89ms. Allocated memory is still 86.0MB. Free memory was 58.4MB in the beginning and 56.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:05,161 INFO L158 Benchmark]: RCFGBuilder took 839.11ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 39.9MB in the end (delta: 16.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:05,162 INFO L158 Benchmark]: TraceAbstraction took 46928.84ms. Allocated memory was 86.0MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 39.0MB in the beginning and 4.0GB in the end (delta: -4.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-31 23:14:05,162 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 5.3GB. Free memory is still 4.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:05,163 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.27ms. Allocated memory is still 65.0MB. Free memory is still 43.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 581.94ms. Allocated memory is still 86.0MB. Free memory was 64.8MB in the beginning and 61.1MB in the end (delta: 3.7MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.15ms. Allocated memory is still 86.0MB. Free memory was 61.1MB in the beginning and 58.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.89ms. Allocated memory is still 86.0MB. Free memory was 58.4MB in the beginning and 56.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 839.11ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 39.9MB in the end (delta: 16.4MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * TraceAbstraction took 46928.84ms. Allocated memory was 86.0MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 39.0MB in the beginning and 4.0GB in the end (delta: -4.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 5.3GB. Free memory is still 4.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: 5.1s, 150 PlacesBefore, 54 PlacesAfterwards, 139 TransitionsBefore, 42 TransitionsAfterwards, 3506 CoEnabledTransitionPairs, 8 FixpointIterations, 48 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 130 TotalNumberOfCompositions, 11503 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5603, independent: 5318, independent conditional: 0, independent unconditional: 5318, dependent: 285, dependent conditional: 0, dependent unconditional: 285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1821, independent: 1779, independent conditional: 0, independent unconditional: 1779, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5603, independent: 3539, independent conditional: 0, independent unconditional: 3539, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 1821, unknown conditional: 0, unknown unconditional: 1821] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 208, Positive conditional cache size: 0, Positive unconditional cache size: 208, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=-3, t489={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=-2, t489={5:0}, t490={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=-1, t489={5:0}, t490={6:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 180 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 46.7s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1722 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1434 mSDsluCounter, 1217 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 947 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4239 IncrementalHoareTripleChecker+Invalid, 4578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 270 mSDtfsCounter, 4239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1500occurred in iteration=17, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 3671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:14:05,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:14:07,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:14:07,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:14:07,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:14:07,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:14:07,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:14:07,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:14:07,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:14:07,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:14:07,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:14:07,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:14:07,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:14:07,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:14:07,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:14:07,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:14:07,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:14:07,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:14:07,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:14:07,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:14:07,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:14:07,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:14:07,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:14:07,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:14:07,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:14:07,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:14:07,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:14:07,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:14:07,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:14:07,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:14:07,532 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:14:07,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:14:07,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:14:07,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:14:07,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:14:07,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:14:07,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:14:07,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:14:07,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:14:07,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:14:07,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:14:07,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:14:07,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:14:07,580 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:14:07,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:14:07,581 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:14:07,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:14:07,582 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:14:07,583 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:14:07,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:14:07,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:14:07,583 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:14:07,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:14:07,584 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:14:07,584 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:14:07,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:14:07,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:14:07,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:14:07,585 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:14:07,585 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:14:07,586 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:14:07,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:14:07,586 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:14:07,586 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:14:07,586 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:14:07,586 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:14:07,587 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:14:07,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:14:07,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:14:07,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:14:07,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:14:07,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:14:07,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:14:07,588 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:14:07,588 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:14:07,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:14:07,589 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:14:07,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:14:07,589 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:14:07,589 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:14:07,590 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:14:07,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:14:07,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:14:07,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:14:07,901 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:14:07,901 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:14:07,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-08-31 23:14:09,127 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:14:09,411 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:14:09,411 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2023-08-31 23:14:09,426 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f488346b/06a1c0c314144dc39d972ef572bbdf9d/FLAGc5fda1af8 [2023-08-31 23:14:09,439 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f488346b/06a1c0c314144dc39d972ef572bbdf9d [2023-08-31 23:14:09,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:14:09,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:14:09,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:09,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:14:09,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:14:09,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:09" (1/1) ... [2023-08-31 23:14:09,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221ace43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:09, skipping insertion in model container [2023-08-31 23:14:09,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:09" (1/1) ... [2023-08-31 23:14:09,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:14:09,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:14:09,646 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i[949,962] [2023-08-31 23:14:09,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:09,907 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:14:09,919 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i[949,962] [2023-08-31 23:14:09,958 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:10,009 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:10,010 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:10,016 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:14:10,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10 WrapperNode [2023-08-31 23:14:10,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:10,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:10,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:14:10,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:14:10,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,103 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-08-31 23:14:10,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:10,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:14:10,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:14:10,107 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:14:10,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,157 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:14:10,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:14:10,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:14:10,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:14:10,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (1/1) ... [2023-08-31 23:14:10,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:14:10,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:14:10,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:14:10,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:14:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:14:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:14:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:14:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:14:10,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:14:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:14:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:14:10,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:14:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:14:10,249 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:14:10,249 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:14:10,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:14:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:14:10,250 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:14:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:14:10,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:14:10,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:14:10,252 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:14:10,389 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:14:10,391 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:14:10,882 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:14:10,986 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:14:10,986 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:14:10,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:10 BoogieIcfgContainer [2023-08-31 23:14:10,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:14:10,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:14:10,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:14:10,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:14:10,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:14:09" (1/3) ... [2023-08-31 23:14:10,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4697e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:10, skipping insertion in model container [2023-08-31 23:14:11,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:10" (2/3) ... [2023-08-31 23:14:11,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4697e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:11, skipping insertion in model container [2023-08-31 23:14:11,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:10" (3/3) ... [2023-08-31 23:14:11,007 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2023-08-31 23:14:11,023 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:14:11,024 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:14:11,024 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:14:11,094 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:14:11,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:14:11,199 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:14:11,199 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:11,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:14:11,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-08-31 23:14:11,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 140 transitions, 292 flow [2023-08-31 23:14:11,216 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:14:11,232 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:14:11,235 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 140 transitions, 292 flow [2023-08-31 23:14:11,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 292 flow [2023-08-31 23:14:11,285 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-08-31 23:14:11,285 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:11,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:14:11,298 INFO L119 LiptonReduction]: Number of co-enabled transitions 3506 [2023-08-31 23:14:18,383 INFO L134 LiptonReduction]: Checked pairs total: 10529 [2023-08-31 23:14:18,383 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-31 23:14:18,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:14:18,402 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;@3f8ea56a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:14:18,402 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:14:18,404 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:14:18,404 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:18,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:18,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:14:18,405 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-31 23:14:18,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:18,409 INFO L85 PathProgramCache]: Analyzing trace with hash 609, now seen corresponding path program 1 times [2023-08-31 23:14:18,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:18,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206014586] [2023-08-31 23:14:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:18,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:18,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:18,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:14:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:18,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:14:18,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:18,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:18,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206014586] [2023-08-31 23:14:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206014586] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:14:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849951113] [2023-08-31 23:14:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:18,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:14:18,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:18,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:14:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:14:18,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 279 [2023-08-31 23:14:18,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:18,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 279 [2023-08-31 23:14:18,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:19,929 INFO L130 PetriNetUnfolder]: 7925/10834 cut-off events. [2023-08-31 23:14:19,930 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2023-08-31 23:14:19,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21744 conditions, 10834 events. 7925/10834 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 57777 event pairs, 7925 based on Foata normal form. 320/9377 useless extension candidates. Maximal degree in co-relation 21732. Up to 10695 conditions per place. [2023-08-31 23:14:20,008 INFO L137 encePairwiseOnDemand]: 270/279 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-31 23:14:20,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-08-31 23:14:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:14:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:14:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2023-08-31 23:14:20,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286738351254481 [2023-08-31 23:14:20,026 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2023-08-31 23:14:20,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2023-08-31 23:14:20,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:20,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2023-08-31 23:14:20,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:20,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:20,047 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:20,049 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 295 transitions. [2023-08-31 23:14:20,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-08-31 23:14:20,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:20,061 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-08-31 23:14:20,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-31 23:14:20,067 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-31 23:14:20,067 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-08-31 23:14:20,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:20,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:20,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:14:20,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:20,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:20,282 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-31 23:14:20,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:20,283 INFO L85 PathProgramCache]: Analyzing trace with hash 576999580, now seen corresponding path program 1 times [2023-08-31 23:14:20,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687019936] [2023-08-31 23:14:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:20,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:20,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:20,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:20,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:14:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:20,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:14:20,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:20,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:20,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:20,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687019936] [2023-08-31 23:14:20,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687019936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:20,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:20,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:14:20,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174646231] [2023-08-31 23:14:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:20,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:14:20,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:20,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:14:20,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:14:20,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 279 [2023-08-31 23:14:20,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:20,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:20,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 279 [2023-08-31 23:14:20,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:21,353 INFO L130 PetriNetUnfolder]: 6231/8629 cut-off events. [2023-08-31 23:14:21,354 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:21,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17250 conditions, 8629 events. 6231/8629 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 45236 event pairs, 2333 based on Foata normal form. 0/7792 useless extension candidates. Maximal degree in co-relation 17247. Up to 6739 conditions per place. [2023-08-31 23:14:21,400 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 41 selfloop transitions, 2 changer transitions 4/52 dead transitions. [2023-08-31 23:14:21,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 210 flow [2023-08-31 23:14:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:14:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:14:21,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-31 23:14:21,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2023-08-31 23:14:21,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-31 23:14:21,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-31 23:14:21,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:21,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-31 23:14:21,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:21,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:21,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:21,408 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 432 transitions. [2023-08-31 23:14:21,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 210 flow [2023-08-31 23:14:21,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:14:21,410 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 72 flow [2023-08-31 23:14:21,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-31 23:14:21,411 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-08-31 23:14:21,411 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 72 flow [2023-08-31 23:14:21,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:21,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:21,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:21,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-31 23:14:21,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:21,621 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-31 23:14:21,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 438709440, now seen corresponding path program 1 times [2023-08-31 23:14:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:21,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482820939] [2023-08-31 23:14:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:21,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:21,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:21,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:21,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:14:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:21,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:14:21,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:21,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:21,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:21,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482820939] [2023-08-31 23:14:21,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482820939] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:21,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:21,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:14:21,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116163069] [2023-08-31 23:14:21,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:21,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:14:21,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:21,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:14:21,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:14:21,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-31 23:14:21,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:21,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:21,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-31 23:14:21,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:22,260 INFO L130 PetriNetUnfolder]: 3075/4442 cut-off events. [2023-08-31 23:14:22,260 INFO L131 PetriNetUnfolder]: For 286/286 co-relation queries the response was YES. [2023-08-31 23:14:22,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9281 conditions, 4442 events. 3075/4442 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 23167 event pairs, 693 based on Foata normal form. 81/4290 useless extension candidates. Maximal degree in co-relation 9277. Up to 3944 conditions per place. [2023-08-31 23:14:22,285 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 38 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-31 23:14:22,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 202 flow [2023-08-31 23:14:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:14:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:14:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-31 23:14:22,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4970131421744325 [2023-08-31 23:14:22,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-31 23:14:22,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-31 23:14:22,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:22,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-31 23:14:22,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,292 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 72 flow. Second operand 3 states and 416 transitions. [2023-08-31 23:14:22,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 202 flow [2023-08-31 23:14:22,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:22,293 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 101 flow [2023-08-31 23:14:22,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2023-08-31 23:14:22,294 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-08-31 23:14:22,294 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 101 flow [2023-08-31 23:14:22,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:22,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:22,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:22,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:22,505 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-31 23:14:22,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash -471417758, now seen corresponding path program 1 times [2023-08-31 23:14:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:22,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17920416] [2023-08-31 23:14:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:22,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:22,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:22,507 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:22,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:14:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:22,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:22,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:22,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:22,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:22,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17920416] [2023-08-31 23:14:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17920416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:22,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:22,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:22,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520129596] [2023-08-31 23:14:22,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:22,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:22,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:22,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:22,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:22,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-31 23:14:22,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:22,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-31 23:14:22,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:23,011 INFO L130 PetriNetUnfolder]: 1455/2282 cut-off events. [2023-08-31 23:14:23,011 INFO L131 PetriNetUnfolder]: For 284/284 co-relation queries the response was YES. [2023-08-31 23:14:23,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5486 conditions, 2282 events. 1455/2282 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11686 event pairs, 343 based on Foata normal form. 108/2299 useless extension candidates. Maximal degree in co-relation 5481. Up to 1244 conditions per place. [2023-08-31 23:14:23,026 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 50 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2023-08-31 23:14:23,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 297 flow [2023-08-31 23:14:23,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:14:23,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:14:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-31 23:14:23,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4982078853046595 [2023-08-31 23:14:23,028 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-31 23:14:23,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-31 23:14:23,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:23,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-31 23:14:23,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:23,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:23,033 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:23,033 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 101 flow. Second operand 4 states and 556 transitions. [2023-08-31 23:14:23,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 297 flow [2023-08-31 23:14:23,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:23,037 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 148 flow [2023-08-31 23:14:23,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-31 23:14:23,038 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -8 predicate places. [2023-08-31 23:14:23,038 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 148 flow [2023-08-31 23:14:23,038 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-31 23:14:23,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:23,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:23,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:23,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:23,248 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-31 23:14:23,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:23,249 INFO L85 PathProgramCache]: Analyzing trace with hash -890084705, now seen corresponding path program 1 times [2023-08-31 23:14:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:23,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895457215] [2023-08-31 23:14:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:23,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:23,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:23,251 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:23,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:14:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:23,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:14:23,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:23,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:23,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:23,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895457215] [2023-08-31 23:14:23,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895457215] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:23,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:23,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225175267] [2023-08-31 23:14:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:23,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:23,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:23,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:23,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-31 23:14:23,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:23,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:23,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-31 23:14:23,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:23,747 INFO L130 PetriNetUnfolder]: 915/1472 cut-off events. [2023-08-31 23:14:23,747 INFO L131 PetriNetUnfolder]: For 984/984 co-relation queries the response was YES. [2023-08-31 23:14:23,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4009 conditions, 1472 events. 915/1472 cut-off events. For 984/984 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7137 event pairs, 277 based on Foata normal form. 54/1489 useless extension candidates. Maximal degree in co-relation 4003. Up to 540 conditions per place. [2023-08-31 23:14:23,756 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 60 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2023-08-31 23:14:23,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 402 flow [2023-08-31 23:14:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-08-31 23:14:23,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974910394265233 [2023-08-31 23:14:23,760 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-08-31 23:14:23,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-08-31 23:14:23,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:23,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-08-31 23:14:23,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:23,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:23,766 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:23,766 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 148 flow. Second operand 5 states and 694 transitions. [2023-08-31 23:14:23,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 402 flow [2023-08-31 23:14:23,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 384 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:23,769 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 198 flow [2023-08-31 23:14:23,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-31 23:14:23,770 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-08-31 23:14:23,771 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 198 flow [2023-08-31 23:14:23,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:23,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:23,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:23,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:23,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:23,982 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-31 23:14:23,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash 717800184, now seen corresponding path program 1 times [2023-08-31 23:14:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:23,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713010471] [2023-08-31 23:14:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:23,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:23,984 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:23,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:14:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:24,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:14:24,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:24,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:24,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713010471] [2023-08-31 23:14:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713010471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:24,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:14:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96198878] [2023-08-31 23:14:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:24,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:14:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:24,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:14:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:14:24,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 279 [2023-08-31 23:14:24,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:24,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:24,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 279 [2023-08-31 23:14:24,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:24,612 INFO L130 PetriNetUnfolder]: 855/1352 cut-off events. [2023-08-31 23:14:24,612 INFO L131 PetriNetUnfolder]: For 1126/1126 co-relation queries the response was YES. [2023-08-31 23:14:24,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 1352 events. 855/1352 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6519 event pairs, 272 based on Foata normal form. 12/1339 useless extension candidates. Maximal degree in co-relation 3816. Up to 540 conditions per place. [2023-08-31 23:14:24,621 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 56 selfloop transitions, 17 changer transitions 0/78 dead transitions. [2023-08-31 23:14:24,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 428 flow [2023-08-31 23:14:24,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:24,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2023-08-31 23:14:24,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4886499402628435 [2023-08-31 23:14:24,625 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 818 transitions. [2023-08-31 23:14:24,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 818 transitions. [2023-08-31 23:14:24,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:24,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 818 transitions. [2023-08-31 23:14:24,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.33333333333334) internal successors, (818), 6 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:24,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:24,632 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:24,632 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 198 flow. Second operand 6 states and 818 transitions. [2023-08-31 23:14:24,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 428 flow [2023-08-31 23:14:24,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 78 transitions, 394 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:24,644 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 208 flow [2023-08-31 23:14:24,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-31 23:14:24,647 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -2 predicate places. [2023-08-31 23:14:24,647 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 208 flow [2023-08-31 23:14:24,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:24,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:24,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:24,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:24,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:24,858 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-31 23:14:24,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1572307008, now seen corresponding path program 1 times [2023-08-31 23:14:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:24,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690954853] [2023-08-31 23:14:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:24,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:24,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:24,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:24,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:14:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:24,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:24,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:25,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:25,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:25,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690954853] [2023-08-31 23:14:25,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690954853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:25,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:25,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:25,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911092957] [2023-08-31 23:14:25,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:25,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:25,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:25,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:25,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:25,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-31 23:14:25,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:25,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:25,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-31 23:14:25,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:25,520 INFO L130 PetriNetUnfolder]: 1263/1955 cut-off events. [2023-08-31 23:14:25,521 INFO L131 PetriNetUnfolder]: For 2076/2076 co-relation queries the response was YES. [2023-08-31 23:14:25,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5747 conditions, 1955 events. 1263/1955 cut-off events. For 2076/2076 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9403 event pairs, 333 based on Foata normal form. 0/1946 useless extension candidates. Maximal degree in co-relation 5739. Up to 1163 conditions per place. [2023-08-31 23:14:25,535 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 83 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2023-08-31 23:14:25,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 90 transitions, 645 flow [2023-08-31 23:14:25,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:25,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-31 23:14:25,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47813620071684587 [2023-08-31 23:14:25,538 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-31 23:14:25,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-31 23:14:25,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:25,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-31 23:14:25,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:25,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:25,543 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:25,543 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 208 flow. Second operand 5 states and 667 transitions. [2023-08-31 23:14:25,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 90 transitions, 645 flow [2023-08-31 23:14:25,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 532 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:25,558 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 179 flow [2023-08-31 23:14:25,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-31 23:14:25,559 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-08-31 23:14:25,559 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 179 flow [2023-08-31 23:14:25,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:25,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:25,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:25,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:25,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:25,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:25,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:25,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1938822814, now seen corresponding path program 1 times [2023-08-31 23:14:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:25,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850221113] [2023-08-31 23:14:25,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:25,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-31 23:14:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:25,774 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:25,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:14:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:25,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 23:14:26,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:26,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:26,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:26,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850221113] [2023-08-31 23:14:26,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850221113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:26,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:26,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:26,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210384770] [2023-08-31 23:14:26,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:26,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:14:26,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:14:26,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:14:27,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 279 [2023-08-31 23:14:27,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:27,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:27,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 279 [2023-08-31 23:14:27,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:27,483 INFO L130 PetriNetUnfolder]: 1135/1875 cut-off events. [2023-08-31 23:14:27,484 INFO L131 PetriNetUnfolder]: For 1515/1515 co-relation queries the response was YES. [2023-08-31 23:14:27,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5082 conditions, 1875 events. 1135/1875 cut-off events. For 1515/1515 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10092 event pairs, 87 based on Foata normal form. 2/1877 useless extension candidates. Maximal degree in co-relation 5071. Up to 1471 conditions per place. [2023-08-31 23:14:27,493 INFO L137 encePairwiseOnDemand]: 274/279 looper letters, 43 selfloop transitions, 4 changer transitions 17/69 dead transitions. [2023-08-31 23:14:27,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 420 flow [2023-08-31 23:14:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:27,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions. [2023-08-31 23:14:27,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163679808841099 [2023-08-31 23:14:27,497 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 697 transitions. [2023-08-31 23:14:27,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions. [2023-08-31 23:14:27,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:27,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions. [2023-08-31 23:14:27,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:27,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:27,503 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:27,503 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 179 flow. Second operand 6 states and 697 transitions. [2023-08-31 23:14:27,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 420 flow [2023-08-31 23:14:27,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:27,512 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 172 flow [2023-08-31 23:14:27,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-31 23:14:27,513 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-31 23:14:27,513 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 172 flow [2023-08-31 23:14:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:27,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:27,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:27,525 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 (9)] Ended with exit code 0 [2023-08-31 23:14:27,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:27,724 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-31 23:14:27,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:27,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1906581730, now seen corresponding path program 2 times [2023-08-31 23:14:27,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:27,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491297470] [2023-08-31 23:14:27,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:14:27,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:27,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:27,728 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:27,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:14:27,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:14:27,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:14:27,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-31 23:14:27,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:28,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:28,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:28,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491297470] [2023-08-31 23:14:28,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491297470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:28,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:28,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-31 23:14:28,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610850328] [2023-08-31 23:14:28,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:28,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 23:14:28,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:28,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 23:14:28,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-31 23:14:28,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-31 23:14:28,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 172 flow. Second operand has 11 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:28,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:28,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-31 23:14:28,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:28,975 INFO L130 PetriNetUnfolder]: 1558/2581 cut-off events. [2023-08-31 23:14:28,976 INFO L131 PetriNetUnfolder]: For 1781/1781 co-relation queries the response was YES. [2023-08-31 23:14:28,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7017 conditions, 2581 events. 1558/2581 cut-off events. For 1781/1781 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14230 event pairs, 509 based on Foata normal form. 1/2563 useless extension candidates. Maximal degree in co-relation 7006. Up to 1163 conditions per place. [2023-08-31 23:14:28,987 INFO L137 encePairwiseOnDemand]: 272/279 looper letters, 68 selfloop transitions, 6 changer transitions 14/92 dead transitions. [2023-08-31 23:14:28,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 574 flow [2023-08-31 23:14:28,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-08-31 23:14:28,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468936678614098 [2023-08-31 23:14:28,991 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-08-31 23:14:28,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-08-31 23:14:28,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:28,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-08-31 23:14:28,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:28,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:28,997 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:28,997 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 172 flow. Second operand 6 states and 785 transitions. [2023-08-31 23:14:28,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 574 flow [2023-08-31 23:14:29,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 553 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-31 23:14:29,011 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 195 flow [2023-08-31 23:14:29,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-31 23:14:29,012 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2023-08-31 23:14:29,012 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 195 flow [2023-08-31 23:14:29,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:29,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:29,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:29,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-08-31 23:14:29,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:29,223 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-31 23:14:29,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:29,223 INFO L85 PathProgramCache]: Analyzing trace with hash 854957060, now seen corresponding path program 3 times [2023-08-31 23:14:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:29,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823247597] [2023-08-31 23:14:29,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:14:29,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:29,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:29,226 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:29,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:14:29,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:14:29,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:14:29,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:29,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:29,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:29,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:29,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823247597] [2023-08-31 23:14:29,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823247597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:29,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:29,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:29,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529686743] [2023-08-31 23:14:29,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:29,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:29,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:29,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:29,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:29,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-31 23:14:29,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:29,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:29,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-31 23:14:29,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:29,872 INFO L130 PetriNetUnfolder]: 2226/3606 cut-off events. [2023-08-31 23:14:29,872 INFO L131 PetriNetUnfolder]: For 3641/3641 co-relation queries the response was YES. [2023-08-31 23:14:29,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11217 conditions, 3606 events. 2226/3606 cut-off events. For 3641/3641 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 20709 event pairs, 912 based on Foata normal form. 1/3594 useless extension candidates. Maximal degree in co-relation 11205. Up to 1342 conditions per place. [2023-08-31 23:14:29,884 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 43 selfloop transitions, 1 changer transitions 40/89 dead transitions. [2023-08-31 23:14:29,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 89 transitions, 589 flow [2023-08-31 23:14:29,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 659 transitions. [2023-08-31 23:14:29,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47240143369175625 [2023-08-31 23:14:29,888 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 659 transitions. [2023-08-31 23:14:29,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 659 transitions. [2023-08-31 23:14:29,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:29,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 659 transitions. [2023-08-31 23:14:29,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:29,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:29,894 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:29,894 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 195 flow. Second operand 5 states and 659 transitions. [2023-08-31 23:14:29,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 89 transitions, 589 flow [2023-08-31 23:14:29,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 577 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:29,921 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 198 flow [2023-08-31 23:14:29,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-08-31 23:14:29,923 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-08-31 23:14:29,923 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 198 flow [2023-08-31 23:14:29,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:29,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:29,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:29,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:30,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:30,135 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-31 23:14:30,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1796625220, now seen corresponding path program 4 times [2023-08-31 23:14:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:30,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094038327] [2023-08-31 23:14:30,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:14:30,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:30,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:30,138 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:30,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:14:30,254 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:14:30,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:14:30,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-31 23:14:30,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:30,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:30,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094038327] [2023-08-31 23:14:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094038327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:30,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:30,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-31 23:14:30,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041063338] [2023-08-31 23:14:30,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:30,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 23:14:30,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:30,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 23:14:30,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-08-31 23:14:30,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2023-08-31 23:14:30,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 198 flow. Second operand has 11 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:30,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:30,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2023-08-31 23:14:30,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:31,384 INFO L130 PetriNetUnfolder]: 1801/2941 cut-off events. [2023-08-31 23:14:31,384 INFO L131 PetriNetUnfolder]: For 3046/3058 co-relation queries the response was YES. [2023-08-31 23:14:31,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9255 conditions, 2941 events. 1801/2941 cut-off events. For 3046/3058 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16180 event pairs, 440 based on Foata normal form. 6/2901 useless extension candidates. Maximal degree in co-relation 9241. Up to 1123 conditions per place. [2023-08-31 23:14:31,395 INFO L137 encePairwiseOnDemand]: 273/279 looper letters, 65 selfloop transitions, 6 changer transitions 18/93 dead transitions. [2023-08-31 23:14:31,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 93 transitions, 602 flow [2023-08-31 23:14:31,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-08-31 23:14:31,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.468936678614098 [2023-08-31 23:14:31,398 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-08-31 23:14:31,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-08-31 23:14:31,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:31,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-08-31 23:14:31,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:31,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:31,404 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:31,404 INFO L175 Difference]: Start difference. First operand has 61 places, 44 transitions, 198 flow. Second operand 6 states and 785 transitions. [2023-08-31 23:14:31,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 93 transitions, 602 flow [2023-08-31 23:14:31,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 593 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:31,433 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 216 flow [2023-08-31 23:14:31,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-08-31 23:14:31,434 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2023-08-31 23:14:31,434 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 216 flow [2023-08-31 23:14:31,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 123.27272727272727) internal successors, (1356), 11 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:31,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:31,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:31,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 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:31,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:31,645 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-31 23:14:31,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash -651485136, now seen corresponding path program 5 times [2023-08-31 23:14:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:31,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477474816] [2023-08-31 23:14:31,646 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:14:31,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-31 23:14:31,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:31,648 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:31,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:14:31,753 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:14:31,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:14:31,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:14:31,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:31,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:31,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:31,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477474816] [2023-08-31 23:14:31,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477474816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:31,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:31,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:31,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577525625] [2023-08-31 23:14:31,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:31,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:31,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:31,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 279 [2023-08-31 23:14:31,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 216 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:31,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:31,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 279 [2023-08-31 23:14:31,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:32,373 INFO L130 PetriNetUnfolder]: 2831/4682 cut-off events. [2023-08-31 23:14:32,373 INFO L131 PetriNetUnfolder]: For 5242/5270 co-relation queries the response was YES. [2023-08-31 23:14:32,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15314 conditions, 4682 events. 2831/4682 cut-off events. For 5242/5270 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 28305 event pairs, 748 based on Foata normal form. 29/4662 useless extension candidates. Maximal degree in co-relation 15300. Up to 2303 conditions per place. [2023-08-31 23:14:32,392 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 38 selfloop transitions, 1 changer transitions 49/92 dead transitions. [2023-08-31 23:14:32,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 625 flow [2023-08-31 23:14:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-31 23:14:32,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4752688172043011 [2023-08-31 23:14:32,394 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-31 23:14:32,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-31 23:14:32,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:32,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-31 23:14:32,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:32,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:32,398 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:32,398 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 216 flow. Second operand 5 states and 663 transitions. [2023-08-31 23:14:32,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 625 flow [2023-08-31 23:14:32,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 92 transitions, 614 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:32,454 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 191 flow [2023-08-31 23:14:32,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2023-08-31 23:14:32,454 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 12 predicate places. [2023-08-31 23:14:32,455 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 191 flow [2023-08-31 23:14:32,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:32,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:32,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:32,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:32,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:32,661 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-31 23:14:32,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:32,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1316085114, now seen corresponding path program 6 times [2023-08-31 23:14:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:32,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552580459] [2023-08-31 23:14:32,662 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 23:14:32,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:32,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:32,663 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:32,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-31 23:14:32,800 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-31 23:14:32,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:14:32,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:14:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:14:32,946 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:14:32,946 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:14:32,947 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:14:32,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:14:32,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:14:32,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:14:32,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:14:32,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:14:32,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:14:32,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:14:32,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:14:32,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:14:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:14:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:14:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:14:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:14:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:14:32,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:14:32,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-31 23:14:33,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:33,163 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:33,167 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:14:33,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:14:33,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:14:33 BasicIcfg [2023-08-31 23:14:33,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:14:33,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:14:33,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:14:33,261 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:14:33,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:10" (3/4) ... [2023-08-31 23:14:33,264 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:14:33,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:14:33,265 INFO L158 Benchmark]: Toolchain (without parser) took 23820.15ms. Allocated memory was 73.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 50.2MB in the beginning and 677.5MB in the end (delta: -627.3MB). Peak memory consumption was 411.5MB. Max. memory is 16.1GB. [2023-08-31 23:14:33,265 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:33,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.23ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 50.0MB in the beginning and 61.6MB in the end (delta: -11.7MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2023-08-31 23:14:33,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.25ms. Allocated memory is still 88.1MB. Free memory was 61.6MB in the beginning and 59.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:33,266 INFO L158 Benchmark]: Boogie Preprocessor took 66.86ms. Allocated memory is still 88.1MB. Free memory was 59.0MB in the beginning and 56.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:33,266 INFO L158 Benchmark]: RCFGBuilder took 815.41ms. Allocated memory is still 88.1MB. Free memory was 56.5MB in the beginning and 33.1MB in the end (delta: 23.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-08-31 23:14:33,268 INFO L158 Benchmark]: TraceAbstraction took 22268.98ms. Allocated memory was 88.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 32.7MB in the beginning and 677.5MB in the end (delta: -644.8MB). Peak memory consumption was 377.4MB. Max. memory is 16.1GB. [2023-08-31 23:14:33,270 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 1.1GB. Free memory is still 677.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:33,272 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 73.4MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 78.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.23ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 50.0MB in the beginning and 61.6MB in the end (delta: -11.7MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.25ms. Allocated memory is still 88.1MB. Free memory was 61.6MB in the beginning and 59.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.86ms. Allocated memory is still 88.1MB. Free memory was 59.0MB in the beginning and 56.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 815.41ms. Allocated memory is still 88.1MB. Free memory was 56.5MB in the beginning and 33.1MB in the end (delta: 23.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22268.98ms. Allocated memory was 88.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 32.7MB in the beginning and 677.5MB in the end (delta: -644.8MB). Peak memory consumption was 377.4MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 1.1GB. Free memory is still 677.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 151 PlacesBefore, 54 PlacesAfterwards, 140 TransitionsBefore, 42 TransitionsAfterwards, 3506 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 10529 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3926, independent: 3675, independent conditional: 0, independent unconditional: 3675, dependent: 251, dependent conditional: 0, dependent unconditional: 251, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1755, independent: 1715, independent conditional: 0, independent unconditional: 1715, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3926, independent: 1960, independent conditional: 0, independent unconditional: 1960, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 1755, unknown conditional: 0, unknown unconditional: 1755] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=0, t489={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=1, t489={3:0}, t490={-2147483641:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=2, t489={3:0}, t490={-2147483641:0}, t491={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=3, t489={3:0}, t490={-2147483641:0}, t491={-2147483645:0}, t492={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={3:0}, t490={-2147483641:0}, t491={-2147483645:0}, t492={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 181 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 615 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 365 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2404 IncrementalHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 11 mSDtfsCounter, 2404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 250 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=11, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 240 ConstructedInterpolants, 19 QuantifiedInterpolants, 2816 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1940 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:14:33,291 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