./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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-atomic/read_write_lock-2.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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:24:27,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:24:27,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:24:27,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:24:27,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:24:27,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:24:27,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:24:27,666 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:24:27,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:24:27,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:24:27,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:24:27,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:24:27,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:24:27,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:24:27,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:24:27,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:24:27,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:24:27,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:24:27,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:24:27,681 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:24:27,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:24:27,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:24:27,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:24:27,689 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:24:27,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:24:27,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:24:27,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:24:27,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:24:27,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:24:27,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:24:27,700 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:24:27,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:24:27,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:24:27,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:24:27,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:24:27,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:24:27,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:24:27,703 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:24:27,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:24:27,704 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:24:27,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:24:27,705 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:24:27,740 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:24:27,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:24:27,741 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:24:27,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:24:27,742 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:24:27,742 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:24:27,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:24:27,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:24:27,743 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:24:27,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:24:27,744 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:24:27,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:24:27,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:24:27,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:24:27,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:24:27,745 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:24:27,745 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:24:27,745 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:24:27,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:24:27,745 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:24:27,746 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:24:27,746 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:24:27,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:24:27,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:24:27,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:24:27,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:24:27,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:24:27,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:24:27,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:24:27,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:24:27,747 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:24:27,747 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:24:27,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:24:27,748 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:24:27,748 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 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 -> TOGETHER [2023-08-30 02:24:28,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:24:28,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:24:28,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:24:28,063 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:24:28,063 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:24:28,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-08-30 02:24:29,062 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:24:29,298 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:24:29,299 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-08-30 02:24:29,313 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c67c6de/5b99e8b034e84cbabc1ccaf5f2fecd6f/FLAG843f8e75c [2023-08-30 02:24:29,322 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06c67c6de/5b99e8b034e84cbabc1ccaf5f2fecd6f [2023-08-30 02:24:29,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:24:29,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:24:29,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:24:29,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:24:29,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:24:29,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b095afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29, skipping insertion in model container [2023-08-30 02:24:29,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:24:29,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:24:29,469 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-30 02:24:29,537 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-atomic/read_write_lock-2.i[31244,31257] [2023-08-30 02:24:29,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:24:29,549 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:24:29,558 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-30 02:24:29,571 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-atomic/read_write_lock-2.i[31244,31257] [2023-08-30 02:24:29,574 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:24:29,593 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:24:29,593 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:24:29,593 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:24:29,598 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:24:29,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29 WrapperNode [2023-08-30 02:24:29,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:24:29,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:24:29,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:24:29,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:24:29,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,643 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2023-08-30 02:24:29,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:24:29,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:24:29,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:24:29,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:24:29,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,656 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:24:29,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:24:29,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:24:29,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:24:29,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (1/1) ... [2023-08-30 02:24:29,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:24:29,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:24:29,681 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-30 02:24:29,689 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-30 02:24:29,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 02:24:29,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:24:29,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:24:29,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:24:29,710 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-08-30 02:24:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-08-30 02:24:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:24:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:24:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:24:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:24:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:24:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:24:29,711 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-08-30 02:24:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-08-30 02:24:29,712 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:24:29,820 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:24:29,821 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:24:30,030 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:24:30,057 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:24:30,057 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:24:30,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:24:30 BoogieIcfgContainer [2023-08-30 02:24:30,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:24:30,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:24:30,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:24:30,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:24:30,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:24:29" (1/3) ... [2023-08-30 02:24:30,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5a2aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:24:30, skipping insertion in model container [2023-08-30 02:24:30,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:29" (2/3) ... [2023-08-30 02:24:30,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5a2aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:24:30, skipping insertion in model container [2023-08-30 02:24:30,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:24:30" (3/3) ... [2023-08-30 02:24:30,064 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2023-08-30 02:24:30,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:24:30,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-30 02:24:30,075 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:24:30,132 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 02:24:30,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 292 flow [2023-08-30 02:24:30,207 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-30 02:24:30,207 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:24:30,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 126 events. 2/126 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-30 02:24:30,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 292 flow [2023-08-30 02:24:30,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 268 flow [2023-08-30 02:24:30,218 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:24:30,235 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 122 transitions, 268 flow [2023-08-30 02:24:30,240 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 122 transitions, 268 flow [2023-08-30 02:24:30,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 122 transitions, 268 flow [2023-08-30 02:24:30,271 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-30 02:24:30,271 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:24:30,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 122 events. 2/122 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 161 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-30 02:24:30,276 INFO L119 LiptonReduction]: Number of co-enabled transitions 3246 [2023-08-30 02:24:33,408 INFO L134 LiptonReduction]: Checked pairs total: 11920 [2023-08-30 02:24:33,408 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-30 02:24:33,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:24:33,427 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@759235b3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:24:33,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-08-30 02:24:33,429 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:24:33,429 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:24:33,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:33,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:24:33,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:33,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash 443, now seen corresponding path program 1 times [2023-08-30 02:24:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:33,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185948120] [2023-08-30 02:24:33,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:33,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:33,542 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-30 02:24:33,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:33,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185948120] [2023-08-30 02:24:33,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185948120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:33,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:33,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:24:33,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103697640] [2023-08-30 02:24:33,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:33,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:24:33,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:24:33,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:24:33,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 235 [2023-08-30 02:24:33,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:33,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:33,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 235 [2023-08-30 02:24:33,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:34,023 INFO L130 PetriNetUnfolder]: 3680/5648 cut-off events. [2023-08-30 02:24:34,024 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-08-30 02:24:34,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11093 conditions, 5648 events. 3680/5648 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 37067 event pairs, 3680 based on Foata normal form. 427/4694 useless extension candidates. Maximal degree in co-relation 8653. Up to 5216 conditions per place. [2023-08-30 02:24:34,051 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 43 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2023-08-30 02:24:34,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 220 flow [2023-08-30 02:24:34,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:24:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:24:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions. [2023-08-30 02:24:34,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5936170212765958 [2023-08-30 02:24:34,060 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 279 transitions. [2023-08-30 02:24:34,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 279 transitions. [2023-08-30 02:24:34,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:34,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 279 transitions. [2023-08-30 02:24:34,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,067 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,068 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 146 flow. Second operand 2 states and 279 transitions. [2023-08-30 02:24:34,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 220 flow [2023-08-30 02:24:34,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 204 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 02:24:34,074 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 118 flow [2023-08-30 02:24:34,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-08-30 02:24:34,077 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-30 02:24:34,078 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 118 flow [2023-08-30 02:24:34,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:34,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:24:34,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:24:34,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:34,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash 436444, now seen corresponding path program 1 times [2023-08-30 02:24:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:34,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138309541] [2023-08-30 02:24:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:34,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:34,277 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-30 02:24:34,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:34,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138309541] [2023-08-30 02:24:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138309541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:34,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:34,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:34,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011007834] [2023-08-30 02:24:34,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:34,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:34,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:34,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:34,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:34,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-08-30 02:24:34,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:34,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-08-30 02:24:34,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:34,681 INFO L130 PetriNetUnfolder]: 3508/5398 cut-off events. [2023-08-30 02:24:34,682 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:24:34,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10430 conditions, 5398 events. 3508/5398 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 35297 event pairs, 3508 based on Foata normal form. 0/4123 useless extension candidates. Maximal degree in co-relation 10427. Up to 4964 conditions per place. [2023-08-30 02:24:34,726 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 39 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-30 02:24:34,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 196 flow [2023-08-30 02:24:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-30 02:24:34,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-08-30 02:24:34,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-30 02:24:34,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-30 02:24:34,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:34,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-30 02:24:34,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,732 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,732 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 118 flow. Second operand 3 states and 376 transitions. [2023-08-30 02:24:34,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 196 flow [2023-08-30 02:24:34,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:24:34,734 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 118 flow [2023-08-30 02:24:34,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-30 02:24:34,734 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-30 02:24:34,735 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 118 flow [2023-08-30 02:24:34,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:34,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:24:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:24:34,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:34,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash 436443, now seen corresponding path program 1 times [2023-08-30 02:24:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:34,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822516203] [2023-08-30 02:24:34,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:34,879 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-30 02:24:34,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:34,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822516203] [2023-08-30 02:24:34,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822516203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:34,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:34,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:34,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390996337] [2023-08-30 02:24:34,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:34,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:34,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:34,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:34,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:34,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-30 02:24:34,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:34,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:34,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-30 02:24:34,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:35,251 INFO L130 PetriNetUnfolder]: 3336/5148 cut-off events. [2023-08-30 02:24:35,251 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:24:35,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9933 conditions, 5148 events. 3336/5148 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33369 event pairs, 3336 based on Foata normal form. 0/3979 useless extension candidates. Maximal degree in co-relation 9929. Up to 4714 conditions per place. [2023-08-30 02:24:35,271 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 37 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-30 02:24:35,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 192 flow [2023-08-30 02:24:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:35,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:35,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-08-30 02:24:35,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049645390070922 [2023-08-30 02:24:35,272 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-08-30 02:24:35,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-08-30 02:24:35,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:35,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-08-30 02:24:35,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,275 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 118 flow. Second operand 3 states and 356 transitions. [2023-08-30 02:24:35,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 192 flow [2023-08-30 02:24:35,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:35,277 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2023-08-30 02:24:35,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-30 02:24:35,277 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-08-30 02:24:35,278 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2023-08-30 02:24:35,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:35,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:24:35,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:24:35,278 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:35,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash 419433285, now seen corresponding path program 1 times [2023-08-30 02:24:35,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:35,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770391754] [2023-08-30 02:24:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:35,354 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-30 02:24:35,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:35,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770391754] [2023-08-30 02:24:35,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770391754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:35,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:35,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:35,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953757548] [2023-08-30 02:24:35,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:35,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:35,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:35,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:35,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:35,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-08-30 02:24:35,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:35,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-08-30 02:24:35,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:35,650 INFO L130 PetriNetUnfolder]: 3292/5071 cut-off events. [2023-08-30 02:24:35,650 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:24:35,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9782 conditions, 5071 events. 3292/5071 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32702 event pairs, 3292 based on Foata normal form. 0/3938 useless extension candidates. Maximal degree in co-relation 9778. Up to 4640 conditions per place. [2023-08-30 02:24:35,670 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-30 02:24:35,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 184 flow [2023-08-30 02:24:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-30 02:24:35,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276595744680851 [2023-08-30 02:24:35,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-30 02:24:35,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-30 02:24:35,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:35,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-30 02:24:35,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,675 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 372 transitions. [2023-08-30 02:24:35,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 184 flow [2023-08-30 02:24:35,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:35,676 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2023-08-30 02:24:35,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-30 02:24:35,677 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2023-08-30 02:24:35,677 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2023-08-30 02:24:35,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:35,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:24:35,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:24:35,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:35,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:35,678 INFO L85 PathProgramCache]: Analyzing trace with hash 419433284, now seen corresponding path program 1 times [2023-08-30 02:24:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:35,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664849472] [2023-08-30 02:24:35,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:35,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:35,754 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-30 02:24:35,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:35,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664849472] [2023-08-30 02:24:35,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664849472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:35,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:35,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:35,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481589179] [2023-08-30 02:24:35,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:35,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:35,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:35,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:35,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:35,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-30 02:24:35,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:35,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:35,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-30 02:24:35,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:36,057 INFO L130 PetriNetUnfolder]: 3248/4994 cut-off events. [2023-08-30 02:24:36,057 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:24:36,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 4994 events. 3248/4994 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32159 event pairs, 3248 based on Foata normal form. 0/3897 useless extension candidates. Maximal degree in co-relation 9627. Up to 4566 conditions per place. [2023-08-30 02:24:36,075 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 33 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-30 02:24:36,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 176 flow [2023-08-30 02:24:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-30 02:24:36,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49929078014184397 [2023-08-30 02:24:36,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-30 02:24:36,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-30 02:24:36,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:36,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-30 02:24:36,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,080 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 352 transitions. [2023-08-30 02:24:36,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 176 flow [2023-08-30 02:24:36,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:36,081 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2023-08-30 02:24:36,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-30 02:24:36,082 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -17 predicate places. [2023-08-30 02:24:36,082 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2023-08-30 02:24:36,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:36,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:36,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:24:36,083 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:36,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:36,084 INFO L85 PathProgramCache]: Analyzing trace with hash -651528159, now seen corresponding path program 1 times [2023-08-30 02:24:36,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:36,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570043013] [2023-08-30 02:24:36,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:36,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:36,124 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-30 02:24:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:36,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570043013] [2023-08-30 02:24:36,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570043013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:36,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:36,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820492028] [2023-08-30 02:24:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:36,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:36,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:36,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:36,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-08-30 02:24:36,158 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:36,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-08-30 02:24:36,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:36,428 INFO L130 PetriNetUnfolder]: 3148/4835 cut-off events. [2023-08-30 02:24:36,428 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:24:36,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9322 conditions, 4835 events. 3148/4835 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 31073 event pairs, 3148 based on Foata normal form. 0/3809 useless extension candidates. Maximal degree in co-relation 9318. Up to 4416 conditions per place. [2023-08-30 02:24:36,450 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 31 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-30 02:24:36,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 168 flow [2023-08-30 02:24:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-30 02:24:36,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219858156028369 [2023-08-30 02:24:36,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-30 02:24:36,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-30 02:24:36,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:36,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-30 02:24:36,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,454 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 368 transitions. [2023-08-30 02:24:36,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 168 flow [2023-08-30 02:24:36,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:36,455 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2023-08-30 02:24:36,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-30 02:24:36,456 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2023-08-30 02:24:36,456 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2023-08-30 02:24:36,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:36,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:36,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:24:36,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:36,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:36,457 INFO L85 PathProgramCache]: Analyzing trace with hash -651528160, now seen corresponding path program 1 times [2023-08-30 02:24:36,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839247754] [2023-08-30 02:24:36,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:36,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:36,483 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-30 02:24:36,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:36,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839247754] [2023-08-30 02:24:36,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839247754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:36,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:36,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784387761] [2023-08-30 02:24:36,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:36,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:36,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:36,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:36,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-30 02:24:36,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:36,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-30 02:24:36,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:36,762 INFO L130 PetriNetUnfolder]: 3048/4676 cut-off events. [2023-08-30 02:24:36,763 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:24:36,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9013 conditions, 4676 events. 3048/4676 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 29881 event pairs, 3048 based on Foata normal form. 0/3721 useless extension candidates. Maximal degree in co-relation 9009. Up to 4266 conditions per place. [2023-08-30 02:24:36,779 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-30 02:24:36,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 160 flow [2023-08-30 02:24:36,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-30 02:24:36,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49361702127659574 [2023-08-30 02:24:36,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-30 02:24:36,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-30 02:24:36,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:36,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-30 02:24:36,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,784 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 348 transitions. [2023-08-30 02:24:36,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 160 flow [2023-08-30 02:24:36,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:36,786 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2023-08-30 02:24:36,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-30 02:24:36,787 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2023-08-30 02:24:36,787 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2023-08-30 02:24:36,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:36,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:36,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:24:36,787 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:36,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:36,788 INFO L85 PathProgramCache]: Analyzing trace with hash 911001492, now seen corresponding path program 1 times [2023-08-30 02:24:36,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:36,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573879842] [2023-08-30 02:24:36,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:36,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:36,823 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-30 02:24:36,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:36,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573879842] [2023-08-30 02:24:36,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573879842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:36,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:36,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:24:36,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194817005] [2023-08-30 02:24:36,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:36,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:24:36,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:36,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:24:36,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:24:36,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-30 02:24:36,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:36,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:36,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-30 02:24:36,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:38,314 INFO L130 PetriNetUnfolder]: 20551/31618 cut-off events. [2023-08-30 02:24:38,314 INFO L131 PetriNetUnfolder]: For 440/440 co-relation queries the response was YES. [2023-08-30 02:24:38,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59925 conditions, 31618 events. 20551/31618 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 1602. Compared 233872 event pairs, 3071 based on Foata normal form. 760/29108 useless extension candidates. Maximal degree in co-relation 59921. Up to 13923 conditions per place. [2023-08-30 02:24:38,461 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 158 selfloop transitions, 26 changer transitions 0/190 dead transitions. [2023-08-30 02:24:38,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 190 transitions, 787 flow [2023-08-30 02:24:38,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:24:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:24:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1140 transitions. [2023-08-30 02:24:38,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2023-08-30 02:24:38,464 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1140 transitions. [2023-08-30 02:24:38,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1140 transitions. [2023-08-30 02:24:38,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:38,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1140 transitions. [2023-08-30 02:24:38,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.66666666666667) internal successors, (1140), 9 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:38,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:38,470 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:38,470 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 9 states and 1140 transitions. [2023-08-30 02:24:38,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 190 transitions, 787 flow [2023-08-30 02:24:38,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 190 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:38,472 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 235 flow [2023-08-30 02:24:38,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2023-08-30 02:24:38,473 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-30 02:24:38,473 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 235 flow [2023-08-30 02:24:38,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:38,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:38,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:38,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:24:38,474 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:38,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:38,474 INFO L85 PathProgramCache]: Analyzing trace with hash 946675041, now seen corresponding path program 1 times [2023-08-30 02:24:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:38,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190326928] [2023-08-30 02:24:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:38,580 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-30 02:24:38,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:38,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190326928] [2023-08-30 02:24:38,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190326928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:38,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:38,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:24:38,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402844057] [2023-08-30 02:24:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:38,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:24:38,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:38,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:24:38,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:24:38,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 235 [2023-08-30 02:24:38,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:38,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:38,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 235 [2023-08-30 02:24:38,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:39,487 INFO L130 PetriNetUnfolder]: 8926/14112 cut-off events. [2023-08-30 02:24:39,487 INFO L131 PetriNetUnfolder]: For 3671/4828 co-relation queries the response was YES. [2023-08-30 02:24:39,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30801 conditions, 14112 events. 8926/14112 cut-off events. For 3671/4828 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 107056 event pairs, 7733 based on Foata normal form. 503/12170 useless extension candidates. Maximal degree in co-relation 30793. Up to 12491 conditions per place. [2023-08-30 02:24:39,562 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 31 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-30 02:24:39,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 299 flow [2023-08-30 02:24:39,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:39,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-08-30 02:24:39,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4397163120567376 [2023-08-30 02:24:39,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-08-30 02:24:39,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-08-30 02:24:39,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:39,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-08-30 02:24:39,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:39,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:39,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:39,566 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 235 flow. Second operand 3 states and 310 transitions. [2023-08-30 02:24:39,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 299 flow [2023-08-30 02:24:39,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 67 transitions, 299 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:24:39,575 INFO L231 Difference]: Finished difference. Result has 62 places, 67 transitions, 237 flow [2023-08-30 02:24:39,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=62, PETRI_TRANSITIONS=67} [2023-08-30 02:24:39,576 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-30 02:24:39,576 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 67 transitions, 237 flow [2023-08-30 02:24:39,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:39,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:39,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:39,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:24:39,577 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:39,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash 946675042, now seen corresponding path program 1 times [2023-08-30 02:24:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:39,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271307800] [2023-08-30 02:24:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:39,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:24:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:39,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271307800] [2023-08-30 02:24:39,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271307800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:39,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:39,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568760003] [2023-08-30 02:24:39,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:39,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:39,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:39,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:39,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-30 02:24:39,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:39,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:39,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-30 02:24:39,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:40,256 INFO L130 PetriNetUnfolder]: 6262/10257 cut-off events. [2023-08-30 02:24:40,256 INFO L131 PetriNetUnfolder]: For 2760/3604 co-relation queries the response was YES. [2023-08-30 02:24:40,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22403 conditions, 10257 events. 6262/10257 cut-off events. For 2760/3604 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 77469 event pairs, 5377 based on Foata normal form. 353/9605 useless extension candidates. Maximal degree in co-relation 22394. Up to 8891 conditions per place. [2023-08-30 02:24:40,302 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 30 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-30 02:24:40,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 299 flow [2023-08-30 02:24:40,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-30 02:24:40,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49361702127659574 [2023-08-30 02:24:40,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-30 02:24:40,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-30 02:24:40,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:40,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-30 02:24:40,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:40,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:40,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:40,307 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 237 flow. Second operand 3 states and 348 transitions. [2023-08-30 02:24:40,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 299 flow [2023-08-30 02:24:40,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 66 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:40,312 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 235 flow [2023-08-30 02:24:40,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2023-08-30 02:24:40,313 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-30 02:24:40,313 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 235 flow [2023-08-30 02:24:40,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:40,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:40,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:40,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:24:40,314 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:40,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1830579763, now seen corresponding path program 1 times [2023-08-30 02:24:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:40,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156996261] [2023-08-30 02:24:40,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:40,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:40,375 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-30 02:24:40,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:40,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156996261] [2023-08-30 02:24:40,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156996261] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:40,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:40,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:24:40,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871071839] [2023-08-30 02:24:40,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:40,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:40,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:40,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:40,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 235 [2023-08-30 02:24:40,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:40,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:40,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 235 [2023-08-30 02:24:40,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:40,756 INFO L130 PetriNetUnfolder]: 5010/8557 cut-off events. [2023-08-30 02:24:40,756 INFO L131 PetriNetUnfolder]: For 2425/2701 co-relation queries the response was YES. [2023-08-30 02:24:40,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19124 conditions, 8557 events. 5010/8557 cut-off events. For 2425/2701 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 66659 event pairs, 1317 based on Foata normal form. 906/8934 useless extension candidates. Maximal degree in co-relation 19115. Up to 3435 conditions per place. [2023-08-30 02:24:40,796 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 48 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2023-08-30 02:24:40,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 399 flow [2023-08-30 02:24:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-08-30 02:24:40,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517730496453901 [2023-08-30 02:24:40,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-08-30 02:24:40,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-08-30 02:24:40,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:40,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-08-30 02:24:40,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-30 02:24:40,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:40,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:40,799 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 235 flow. Second operand 3 states and 389 transitions. [2023-08-30 02:24:40,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 399 flow [2023-08-30 02:24:40,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:40,809 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 247 flow [2023-08-30 02:24:40,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2023-08-30 02:24:40,809 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-30 02:24:40,809 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 247 flow [2023-08-30 02:24:40,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:40,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:40,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:40,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:24:40,810 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:40,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2046481205, now seen corresponding path program 2 times [2023-08-30 02:24:40,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:40,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075882443] [2023-08-30 02:24:40,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:40,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:40,847 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-30 02:24:40,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:40,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075882443] [2023-08-30 02:24:40,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075882443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:40,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:40,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:24:40,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375515067] [2023-08-30 02:24:40,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:40,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:24:40,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:40,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:24:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:24:40,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 235 [2023-08-30 02:24:40,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:40,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:40,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 235 [2023-08-30 02:24:40,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:41,240 INFO L130 PetriNetUnfolder]: 2715/5346 cut-off events. [2023-08-30 02:24:41,240 INFO L131 PetriNetUnfolder]: For 3887/4043 co-relation queries the response was YES. [2023-08-30 02:24:41,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12873 conditions, 5346 events. 2715/5346 cut-off events. For 3887/4043 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 43228 event pairs, 661 based on Foata normal form. 450/5571 useless extension candidates. Maximal degree in co-relation 12863. Up to 1987 conditions per place. [2023-08-30 02:24:41,260 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 74 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2023-08-30 02:24:41,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 116 transitions, 570 flow [2023-08-30 02:24:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:24:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:24:41,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-30 02:24:41,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5638297872340425 [2023-08-30 02:24:41,262 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-30 02:24:41,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-30 02:24:41,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:41,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-30 02:24:41,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:41,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:41,265 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:41,265 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 247 flow. Second operand 4 states and 530 transitions. [2023-08-30 02:24:41,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 116 transitions, 570 flow [2023-08-30 02:24:41,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:41,273 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 313 flow [2023-08-30 02:24:41,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2023-08-30 02:24:41,274 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-08-30 02:24:41,274 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 313 flow [2023-08-30 02:24:41,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:41,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:41,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:41,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:24:41,274 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:41,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:41,275 INFO L85 PathProgramCache]: Analyzing trace with hash -646347747, now seen corresponding path program 1 times [2023-08-30 02:24:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:41,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642576443] [2023-08-30 02:24:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:41,307 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-30 02:24:41,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:41,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642576443] [2023-08-30 02:24:41,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642576443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:41,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:41,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:24:41,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987650023] [2023-08-30 02:24:41,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:41,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:24:41,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:24:41,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:24:41,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-30 02:24:41,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:41,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:41,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-30 02:24:41,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:41,985 INFO L130 PetriNetUnfolder]: 4685/8502 cut-off events. [2023-08-30 02:24:41,985 INFO L131 PetriNetUnfolder]: For 7956/8206 co-relation queries the response was YES. [2023-08-30 02:24:42,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23039 conditions, 8502 events. 4685/8502 cut-off events. For 7956/8206 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 64399 event pairs, 824 based on Foata normal form. 494/8938 useless extension candidates. Maximal degree in co-relation 23027. Up to 4051 conditions per place. [2023-08-30 02:24:42,023 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 169 selfloop transitions, 47 changer transitions 0/226 dead transitions. [2023-08-30 02:24:42,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 226 transitions, 1375 flow [2023-08-30 02:24:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:24:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:24:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1117 transitions. [2023-08-30 02:24:42,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5281323877068558 [2023-08-30 02:24:42,026 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1117 transitions. [2023-08-30 02:24:42,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1117 transitions. [2023-08-30 02:24:42,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:42,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1117 transitions. [2023-08-30 02:24:42,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.11111111111111) internal successors, (1117), 9 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:42,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:42,031 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:42,031 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 313 flow. Second operand 9 states and 1117 transitions. [2023-08-30 02:24:42,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 226 transitions, 1375 flow [2023-08-30 02:24:42,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 226 transitions, 1375 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:24:42,045 INFO L231 Difference]: Finished difference. Result has 80 places, 111 transitions, 654 flow [2023-08-30 02:24:42,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=654, PETRI_PLACES=80, PETRI_TRANSITIONS=111} [2023-08-30 02:24:42,045 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2023-08-30 02:24:42,046 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 111 transitions, 654 flow [2023-08-30 02:24:42,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:42,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:42,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:42,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:24:42,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:42,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:42,046 INFO L85 PathProgramCache]: Analyzing trace with hash -970375638, now seen corresponding path program 1 times [2023-08-30 02:24:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835341128] [2023-08-30 02:24:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:42,083 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-30 02:24:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835341128] [2023-08-30 02:24:42,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835341128] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:42,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:42,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:24:42,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910415679] [2023-08-30 02:24:42,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:42,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:24:42,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:42,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:24:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:24:42,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-30 02:24:42,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 111 transitions, 654 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:42,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:42,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-30 02:24:42,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:42,848 INFO L130 PetriNetUnfolder]: 4698/8568 cut-off events. [2023-08-30 02:24:42,848 INFO L131 PetriNetUnfolder]: For 11767/11936 co-relation queries the response was YES. [2023-08-30 02:24:42,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26487 conditions, 8568 events. 4698/8568 cut-off events. For 11767/11936 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 65471 event pairs, 1098 based on Foata normal form. 225/8685 useless extension candidates. Maximal degree in co-relation 26468. Up to 4981 conditions per place. [2023-08-30 02:24:42,891 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 150 selfloop transitions, 51 changer transitions 0/211 dead transitions. [2023-08-30 02:24:42,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 211 transitions, 1489 flow [2023-08-30 02:24:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:24:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:24:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2023-08-30 02:24:42,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343465045592705 [2023-08-30 02:24:42,893 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2023-08-30 02:24:42,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2023-08-30 02:24:42,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:42,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2023-08-30 02:24:42,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:42,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:42,897 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:42,897 INFO L175 Difference]: Start difference. First operand has 80 places, 111 transitions, 654 flow. Second operand 7 states and 879 transitions. [2023-08-30 02:24:42,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 211 transitions, 1489 flow [2023-08-30 02:24:42,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 211 transitions, 1487 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 02:24:42,932 INFO L231 Difference]: Finished difference. Result has 88 places, 122 transitions, 844 flow [2023-08-30 02:24:42,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=844, PETRI_PLACES=88, PETRI_TRANSITIONS=122} [2023-08-30 02:24:42,933 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2023-08-30 02:24:42,933 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 122 transitions, 844 flow [2023-08-30 02:24:42,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:42,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:42,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:42,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:24:42,934 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:42,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:42,934 INFO L85 PathProgramCache]: Analyzing trace with hash -541846048, now seen corresponding path program 1 times [2023-08-30 02:24:42,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:42,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229054943] [2023-08-30 02:24:42,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:42,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:42,997 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-30 02:24:42,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:24:42,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229054943] [2023-08-30 02:24:42,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229054943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:42,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:42,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:24:42,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986738999] [2023-08-30 02:24:42,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:42,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:24:42,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:24:42,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:24:42,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:24:43,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-30 02:24:43,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 122 transitions, 844 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:43,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:43,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-30 02:24:43,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:43,766 INFO L130 PetriNetUnfolder]: 4717/8682 cut-off events. [2023-08-30 02:24:43,766 INFO L131 PetriNetUnfolder]: For 15193/15368 co-relation queries the response was YES. [2023-08-30 02:24:43,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28109 conditions, 8682 events. 4717/8682 cut-off events. For 15193/15368 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 66638 event pairs, 1385 based on Foata normal form. 225/8807 useless extension candidates. Maximal degree in co-relation 28087. Up to 4722 conditions per place. [2023-08-30 02:24:43,811 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 153 selfloop transitions, 53 changer transitions 0/218 dead transitions. [2023-08-30 02:24:43,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 218 transitions, 1678 flow [2023-08-30 02:24:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:24:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:24:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-08-30 02:24:43,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5313069908814589 [2023-08-30 02:24:43,824 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-08-30 02:24:43,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-08-30 02:24:43,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:43,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-08-30 02:24:43,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:43,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:43,829 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:43,829 INFO L175 Difference]: Start difference. First operand has 88 places, 122 transitions, 844 flow. Second operand 7 states and 874 transitions. [2023-08-30 02:24:43,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 218 transitions, 1678 flow [2023-08-30 02:24:43,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 218 transitions, 1657 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:24:43,871 INFO L231 Difference]: Finished difference. Result has 95 places, 133 transitions, 1020 flow [2023-08-30 02:24:43,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1020, PETRI_PLACES=95, PETRI_TRANSITIONS=133} [2023-08-30 02:24:43,872 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 23 predicate places. [2023-08-30 02:24:43,872 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 133 transitions, 1020 flow [2023-08-30 02:24:43,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:43,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:43,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:43,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:24:43,872 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:43,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash 177613271, now seen corresponding path program 1 times [2023-08-30 02:24:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:24:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473748330] [2023-08-30 02:24:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:24:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:24:43,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:24:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:24:43,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:24:43,918 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:24:43,919 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-08-30 02:24:43,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2023-08-30 02:24:43,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-08-30 02:24:43,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-08-30 02:24:43,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-08-30 02:24:43,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-08-30 02:24:43,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-08-30 02:24:43,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-08-30 02:24:43,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-08-30 02:24:43,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-08-30 02:24:43,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-08-30 02:24:43,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-08-30 02:24:43,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-08-30 02:24:43,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-08-30 02:24:43,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-08-30 02:24:43,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-08-30 02:24:43,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-08-30 02:24:43,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2023-08-30 02:24:43,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-08-30 02:24:43,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-08-30 02:24:43,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-08-30 02:24:43,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-08-30 02:24:43,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2023-08-30 02:24:43,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-08-30 02:24:43,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:24:43,926 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:24:43,930 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:24:43,930 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:24:43,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:24:43 BasicIcfg [2023-08-30 02:24:43,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:24:43,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:24:43,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:24:43,967 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:24:43,968 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:24:30" (3/4) ... [2023-08-30 02:24:43,969 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:24:43,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:24:43,970 INFO L158 Benchmark]: Toolchain (without parser) took 14645.36ms. Allocated memory was 67.1MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 42.7MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-08-30 02:24:43,970 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory was 28.3MB in the beginning and 28.3MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:24:43,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.79ms. Allocated memory is still 67.1MB. Free memory was 42.5MB in the beginning and 37.7MB in the end (delta: 4.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2023-08-30 02:24:43,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.00ms. Allocated memory is still 67.1MB. Free memory was 37.7MB in the beginning and 35.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:24:43,970 INFO L158 Benchmark]: Boogie Preprocessor took 14.81ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 33.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:24:43,970 INFO L158 Benchmark]: RCFGBuilder took 399.72ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 33.9MB in the beginning and 46.1MB in the end (delta: -12.2MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2023-08-30 02:24:43,971 INFO L158 Benchmark]: TraceAbstraction took 13906.71ms. Allocated memory was 81.8MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 45.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-08-30 02:24:43,971 INFO L158 Benchmark]: Witness Printer took 2.07ms. Allocated memory is still 3.7GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:24:43,972 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.15ms. Allocated memory is still 50.3MB. Free memory was 28.3MB in the beginning and 28.3MB in the end (delta: 54.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.79ms. Allocated memory is still 67.1MB. Free memory was 42.5MB in the beginning and 37.7MB in the end (delta: 4.8MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.00ms. Allocated memory is still 67.1MB. Free memory was 37.7MB in the beginning and 35.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.81ms. Allocated memory is still 67.1MB. Free memory was 35.5MB in the beginning and 33.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.72ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 33.9MB in the beginning and 46.1MB in the end (delta: -12.2MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * TraceAbstraction took 13906.71ms. Allocated memory was 81.8MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 45.4MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 2.07ms. Allocated memory is still 3.7GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 133 PlacesBefore, 72 PlacesAfterwards, 122 TransitionsBefore, 61 TransitionsAfterwards, 3246 CoEnabledTransitionPairs, 5 FixpointIterations, 40 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 105 TotalNumberOfCompositions, 11920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5357, independent: 5116, independent conditional: 0, independent unconditional: 5116, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1675, independent: 1640, independent conditional: 0, independent unconditional: 1640, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5357, independent: 3476, independent conditional: 0, independent unconditional: 3476, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 1675, unknown conditional: 0, unknown unconditional: 1675] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 421, Positive conditional cache size: 0, Positive unconditional cache size: 421, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 738]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 738. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-3, r=0, t1={8:0}, t2={7:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=-2, r=0, t1={8:0}, t2={7:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L724] 2 int l; [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=-1, r=1, t1={8:0}, t2={7:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=0, r=1, t1={8:0}, t2={7:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L724] 4 int l; [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l [L745] 2 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L730] 4 y = l VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] 4 reach_error() VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] - 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: -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: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 749]: 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: 750]: 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: 751]: 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: 752]: 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 7 procedures, 155 locations, 24 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: 13.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1621 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1081 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2484 IncrementalHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 131 mSDtfsCounter, 2484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1020occurred in iteration=15, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-30 02:24:43,994 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-atomic/read_write_lock-2.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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:24:45,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:24:45,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:24:45,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:24:45,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:24:45,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:24:45,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:24:45,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:24:45,770 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:24:45,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:24:45,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:24:45,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:24:45,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:24:45,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:24:45,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:24:45,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:24:45,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:24:45,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:24:45,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:24:45,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:24:45,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:24:45,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:24:45,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:24:45,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:24:45,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:24:45,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:24:45,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:24:45,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:24:45,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:24:45,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:24:45,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:24:45,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:24:45,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:24:45,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:24:45,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:24:45,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:24:45,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:24:45,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:24:45,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:24:45,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:24:45,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:24:45,801 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:24:45,825 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:24:45,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:24:45,826 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:24:45,826 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:24:45,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:24:45,826 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:24:45,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:24:45,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:24:45,827 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:24:45,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:24:45,827 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:24:45,828 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:24:45,829 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:24:45,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:24:45,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:24:45,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:24:45,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:24:45,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:24:45,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:24:45,829 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:24:45,829 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:24:45,829 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:24:45,829 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:24:45,830 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:24:45,830 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:24:45,830 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:24:45,830 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 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 -> TOGETHER [2023-08-30 02:24:46,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:24:46,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:24:46,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:24:46,082 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:24:46,082 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:24:46,083 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-08-30 02:24:47,062 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:24:47,269 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:24:47,276 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-08-30 02:24:47,283 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a8086b3/f2df024e222448e38d0acfd02b880b1c/FLAGc2b6955b6 [2023-08-30 02:24:47,292 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a8086b3/f2df024e222448e38d0acfd02b880b1c [2023-08-30 02:24:47,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:24:47,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:24:47,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:24:47,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:24:47,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:24:47,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6d5bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47, skipping insertion in model container [2023-08-30 02:24:47,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:24:47,342 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:24:47,443 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-30 02:24:47,551 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-atomic/read_write_lock-2.i[31244,31257] [2023-08-30 02:24:47,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:24:47,574 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:24:47,596 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-30 02:24:47,610 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-atomic/read_write_lock-2.i[31244,31257] [2023-08-30 02:24:47,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:24:47,658 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:24:47,659 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:24:47,659 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:24:47,663 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:24:47,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47 WrapperNode [2023-08-30 02:24:47,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:24:47,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:24:47,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:24:47,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:24:47,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,721 INFO L138 Inliner]: procedures = 177, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2023-08-30 02:24:47,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:24:47,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:24:47,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:24:47,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:24:47,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,755 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:24:47,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:24:47,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:24:47,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:24:47,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (1/1) ... [2023-08-30 02:24:47,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:24:47,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:24:47,787 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-30 02:24:47,813 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-30 02:24:47,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 02:24:47,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:24:47,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:24:47,822 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-08-30 02:24:47,823 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-08-30 02:24:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:24:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:24:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:24:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:24:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:24:47,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:24:47,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:24:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-08-30 02:24:47,824 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-08-30 02:24:47,825 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:24:47,963 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:24:47,964 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:24:48,201 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:24:48,244 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:24:48,244 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:24:48,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:24:48 BoogieIcfgContainer [2023-08-30 02:24:48,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:24:48,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:24:48,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:24:48,252 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:24:48,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:24:47" (1/3) ... [2023-08-30 02:24:48,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c65960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:24:48, skipping insertion in model container [2023-08-30 02:24:48,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:24:47" (2/3) ... [2023-08-30 02:24:48,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c65960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:24:48, skipping insertion in model container [2023-08-30 02:24:48,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:24:48" (3/3) ... [2023-08-30 02:24:48,254 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2023-08-30 02:24:48,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:24:48,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-30 02:24:48,266 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:24:48,355 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 02:24:48,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 294 flow [2023-08-30 02:24:48,436 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 02:24:48,436 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:24:48,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 127 events. 2/127 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-30 02:24:48,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 294 flow [2023-08-30 02:24:48,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 270 flow [2023-08-30 02:24:48,448 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:24:48,458 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 270 flow [2023-08-30 02:24:48,460 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 270 flow [2023-08-30 02:24:48,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 270 flow [2023-08-30 02:24:48,477 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-30 02:24:48,478 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 02:24:48,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 123 events. 2/123 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 161 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-30 02:24:48,482 INFO L119 LiptonReduction]: Number of co-enabled transitions 3246 [2023-08-30 02:24:56,369 INFO L134 LiptonReduction]: Checked pairs total: 11920 [2023-08-30 02:24:56,369 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-30 02:24:56,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:24:56,386 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;@21c90880, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:24:56,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-08-30 02:24:56,388 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 02:24:56,388 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:24:56,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:56,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:24:56,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:56,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash 445, now seen corresponding path program 1 times [2023-08-30 02:24:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:24:56,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314701107] [2023-08-30 02:24:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:56,402 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-30 02:24:56,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:24:56,404 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-30 02:24:56,411 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-30 02:24:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:56,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:24:56,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:24:56,462 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-30 02:24:56,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:24:56,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:24:56,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314701107] [2023-08-30 02:24:56,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314701107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:56,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:56,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:24:56,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199072852] [2023-08-30 02:24:56,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:56,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:24:56,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:24:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:24:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:24:56,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 235 [2023-08-30 02:24:56,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:56,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:56,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 235 [2023-08-30 02:24:56,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:57,110 INFO L130 PetriNetUnfolder]: 3680/5684 cut-off events. [2023-08-30 02:24:57,110 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2023-08-30 02:24:57,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11129 conditions, 5684 events. 3680/5684 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 37534 event pairs, 3680 based on Foata normal form. 427/4754 useless extension candidates. Maximal degree in co-relation 8689. Up to 5216 conditions per place. [2023-08-30 02:24:57,140 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 43 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2023-08-30 02:24:57,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 220 flow [2023-08-30 02:24:57,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:24:57,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:24:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 281 transitions. [2023-08-30 02:24:57,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.597872340425532 [2023-08-30 02:24:57,154 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 281 transitions. [2023-08-30 02:24:57,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 281 transitions. [2023-08-30 02:24:57,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:57,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 281 transitions. [2023-08-30 02:24:57,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 140.5) internal successors, (281), 2 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:57,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:57,166 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:57,167 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 146 flow. Second operand 2 states and 281 transitions. [2023-08-30 02:24:57,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 220 flow [2023-08-30 02:24:57,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 204 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 02:24:57,177 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 118 flow [2023-08-30 02:24:57,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-08-30 02:24:57,183 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-30 02:24:57,184 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 118 flow [2023-08-30 02:24:57,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:57,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:57,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:24:57,205 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-30 02:24:57,393 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-30 02:24:57,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:57,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:57,394 INFO L85 PathProgramCache]: Analyzing trace with hash 435539, now seen corresponding path program 1 times [2023-08-30 02:24:57,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:24:57,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017502595] [2023-08-30 02:24:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:57,394 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-30 02:24:57,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:24:57,395 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-30 02:24:57,398 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-30 02:24:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:57,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:24:57,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:24:57,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:24:57,563 INFO L321 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2023-08-30 02:24:57,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 35 [2023-08-30 02:24:57,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-08-30 02:24:57,640 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-30 02:24:57,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:24:57,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:24:57,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017502595] [2023-08-30 02:24:57,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017502595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:57,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:57,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:57,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706701109] [2023-08-30 02:24:57,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:57,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:57,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:24:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:57,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:57,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-08-30 02:24:57,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:57,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:57,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-08-30 02:24:57,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:58,282 INFO L130 PetriNetUnfolder]: 3508/5434 cut-off events. [2023-08-30 02:24:58,282 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:24:58,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10466 conditions, 5434 events. 3508/5434 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 35519 event pairs, 3508 based on Foata normal form. 0/4183 useless extension candidates. Maximal degree in co-relation 10463. Up to 4964 conditions per place. [2023-08-30 02:24:58,313 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 39 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-30 02:24:58,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 196 flow [2023-08-30 02:24:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-30 02:24:58,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375886524822695 [2023-08-30 02:24:58,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-30 02:24:58,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-30 02:24:58,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:58,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-30 02:24:58,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:58,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:58,323 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:58,323 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 118 flow. Second operand 3 states and 379 transitions. [2023-08-30 02:24:58,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 196 flow [2023-08-30 02:24:58,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:24:58,325 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 118 flow [2023-08-30 02:24:58,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-30 02:24:58,326 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-30 02:24:58,326 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 118 flow [2023-08-30 02:24:58,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:58,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:58,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 02:24:58,357 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-30 02:24:58,536 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-30 02:24:58,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:58,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash 435541, now seen corresponding path program 1 times [2023-08-30 02:24:58,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:24:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485254593] [2023-08-30 02:24:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:58,539 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-30 02:24:58,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:24:58,540 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-30 02:24:58,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:24:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:58,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 02:24:58,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:24:58,647 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2023-08-30 02:24:58,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 40 [2023-08-30 02:24:58,704 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-30 02:24:58,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:24:58,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:24:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485254593] [2023-08-30 02:24:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485254593] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:58,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214120056] [2023-08-30 02:24:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:58,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:24:58,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:58,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:58,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-30 02:24:58,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:58,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:58,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-30 02:24:58,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:24:59,208 INFO L130 PetriNetUnfolder]: 3336/5184 cut-off events. [2023-08-30 02:24:59,208 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:24:59,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9969 conditions, 5184 events. 3336/5184 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33583 event pairs, 3336 based on Foata normal form. 0/4039 useless extension candidates. Maximal degree in co-relation 9965. Up to 4714 conditions per place. [2023-08-30 02:24:59,264 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 37 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-30 02:24:59,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 192 flow [2023-08-30 02:24:59,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:24:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:24:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-30 02:24:59,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219858156028369 [2023-08-30 02:24:59,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-30 02:24:59,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-30 02:24:59,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:24:59,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-30 02:24:59,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:59,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:59,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:59,268 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 118 flow. Second operand 3 states and 368 transitions. [2023-08-30 02:24:59,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 192 flow [2023-08-30 02:24:59,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:24:59,269 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2023-08-30 02:24:59,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-30 02:24:59,269 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-08-30 02:24:59,270 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2023-08-30 02:24:59,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:59,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:24:59,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:24:59,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:24:59,477 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-30 02:24:59,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:24:59,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:24:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash 418563642, now seen corresponding path program 1 times [2023-08-30 02:24:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:24:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463685441] [2023-08-30 02:24:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:24:59,478 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-30 02:24:59,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:24:59,479 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-30 02:24:59,481 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-30 02:24:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:24:59,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 02:24:59,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:24:59,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:24:59,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:24:59,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:24:59,600 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-30 02:24:59,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-30 02:24:59,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-30 02:24:59,634 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-30 02:24:59,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:24:59,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:24:59,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463685441] [2023-08-30 02:24:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463685441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:24:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:24:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:24:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980330536] [2023-08-30 02:24:59,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:24:59,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:24:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:24:59,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:24:59,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:24:59,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-08-30 02:24:59,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:24:59,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:24:59,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-08-30 02:24:59,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:00,115 INFO L130 PetriNetUnfolder]: 3292/5107 cut-off events. [2023-08-30 02:25:00,115 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:25:00,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9818 conditions, 5107 events. 3292/5107 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33113 event pairs, 3292 based on Foata normal form. 0/3998 useless extension candidates. Maximal degree in co-relation 9814. Up to 4640 conditions per place. [2023-08-30 02:25:00,151 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-30 02:25:00,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 184 flow [2023-08-30 02:25:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:25:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:25:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-30 02:25:00,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2023-08-30 02:25:00,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-30 02:25:00,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-30 02:25:00,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:00,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-30 02:25:00,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:00,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:00,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:00,156 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 375 transitions. [2023-08-30 02:25:00,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 184 flow [2023-08-30 02:25:00,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:25:00,157 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2023-08-30 02:25:00,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-30 02:25:00,157 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2023-08-30 02:25:00,158 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2023-08-30 02:25:00,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:00,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:00,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 02:25:00,165 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-30 02:25:00,364 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-30 02:25:00,365 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:00,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:00,365 INFO L85 PathProgramCache]: Analyzing trace with hash 418563641, now seen corresponding path program 1 times [2023-08-30 02:25:00,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:00,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497680792] [2023-08-30 02:25:00,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:00,366 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-30 02:25:00,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:00,368 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-30 02:25:00,369 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-30 02:25:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:00,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-30 02:25:00,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:00,483 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2023-08-30 02:25:00,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 29 [2023-08-30 02:25:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:25:00,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:00,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:00,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497680792] [2023-08-30 02:25:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497680792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:00,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:00,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:25:00,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110146707] [2023-08-30 02:25:00,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:00,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:25:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:00,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:25:00,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:25:00,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-30 02:25:00,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:00,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:00,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-30 02:25:00,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:00,873 INFO L130 PetriNetUnfolder]: 3248/5030 cut-off events. [2023-08-30 02:25:00,873 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:25:00,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9667 conditions, 5030 events. 3248/5030 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32516 event pairs, 3248 based on Foata normal form. 0/3957 useless extension candidates. Maximal degree in co-relation 9663. Up to 4566 conditions per place. [2023-08-30 02:25:00,892 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 33 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-30 02:25:00,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 176 flow [2023-08-30 02:25:00,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:25:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:25:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-30 02:25:00,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2023-08-30 02:25:00,894 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-30 02:25:00,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-30 02:25:00,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:00,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-30 02:25:00,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:00,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:00,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:00,897 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 355 transitions. [2023-08-30 02:25:00,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 176 flow [2023-08-30 02:25:00,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:25:00,898 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2023-08-30 02:25:00,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-30 02:25:00,899 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -17 predicate places. [2023-08-30 02:25:00,899 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2023-08-30 02:25:00,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:00,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:00,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:00,908 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-30 02:25:01,108 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-30 02:25:01,109 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:01,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:01,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1487255018, now seen corresponding path program 1 times [2023-08-30 02:25:01,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:01,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443792153] [2023-08-30 02:25:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:01,109 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-30 02:25:01,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:01,110 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-30 02:25:01,112 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-30 02:25:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:01,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 02:25:01,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:01,268 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2023-08-30 02:25:01,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 50 [2023-08-30 02:25:01,305 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-30 02:25:01,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:01,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:01,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443792153] [2023-08-30 02:25:01,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443792153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:01,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:01,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:25:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860953171] [2023-08-30 02:25:01,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:01,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:25:01,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:01,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:25:01,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:25:01,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-30 02:25:01,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:01,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:01,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-30 02:25:01,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:01,684 INFO L130 PetriNetUnfolder]: 3148/4859 cut-off events. [2023-08-30 02:25:01,684 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:25:01,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9346 conditions, 4859 events. 3148/4859 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 31349 event pairs, 3148 based on Foata normal form. 0/3845 useless extension candidates. Maximal degree in co-relation 9342. Up to 4416 conditions per place. [2023-08-30 02:25:01,702 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 31 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-30 02:25:01,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 168 flow [2023-08-30 02:25:01,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:25:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:25:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-30 02:25:01,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500709219858156 [2023-08-30 02:25:01,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-30 02:25:01,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-30 02:25:01,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:01,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-30 02:25:01,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:01,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:01,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:01,706 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 353 transitions. [2023-08-30 02:25:01,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 168 flow [2023-08-30 02:25:01,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:25:01,707 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2023-08-30 02:25:01,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-30 02:25:01,708 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2023-08-30 02:25:01,708 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2023-08-30 02:25:01,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:01,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:01,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:01,717 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-30 02:25:01,915 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-30 02:25:01,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:01,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1487255019, now seen corresponding path program 1 times [2023-08-30 02:25:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:01,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93512562] [2023-08-30 02:25:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:01,916 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-30 02:25:01,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:01,917 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-30 02:25:01,919 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-30 02:25:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:01,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:25:01,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:02,046 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-30 02:25:02,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-30 02:25:02,073 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-30 02:25:02,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:02,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:02,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93512562] [2023-08-30 02:25:02,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93512562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:02,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:02,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:25:02,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610527421] [2023-08-30 02:25:02,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:02,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:25:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:25:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:25:02,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-08-30 02:25:02,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:02,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:02,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-08-30 02:25:02,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:02,362 INFO L130 PetriNetUnfolder]: 3048/4688 cut-off events. [2023-08-30 02:25:02,362 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-30 02:25:02,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9025 conditions, 4688 events. 3048/4688 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 30049 event pairs, 3048 based on Foata normal form. 0/3733 useless extension candidates. Maximal degree in co-relation 9021. Up to 4266 conditions per place. [2023-08-30 02:25:02,379 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-30 02:25:02,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 160 flow [2023-08-30 02:25:02,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:25:02,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:25:02,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-30 02:25:02,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234042553191489 [2023-08-30 02:25:02,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-30 02:25:02,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-30 02:25:02,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:02,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-30 02:25:02,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:02,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:02,383 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:02,384 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 369 transitions. [2023-08-30 02:25:02,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 160 flow [2023-08-30 02:25:02,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:25:02,385 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2023-08-30 02:25:02,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-30 02:25:02,385 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2023-08-30 02:25:02,385 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2023-08-30 02:25:02,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:02,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:02,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:02,393 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-30 02:25:02,592 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-30 02:25:02,593 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:02,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash 939144973, now seen corresponding path program 1 times [2023-08-30 02:25:02,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:02,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296287928] [2023-08-30 02:25:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:02,594 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-30 02:25:02,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:02,595 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-30 02:25:02,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:25:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:02,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:25:02,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:02,686 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-30 02:25:02,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:02,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:02,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296287928] [2023-08-30 02:25:02,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296287928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:02,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:02,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:25:02,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135332597] [2023-08-30 02:25:02,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:02,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:25:02,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:02,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:25:02,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:25:02,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-30 02:25:02,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:02,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:02,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-30 02:25:02,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:03,749 INFO L130 PetriNetUnfolder]: 12125/18416 cut-off events. [2023-08-30 02:25:03,749 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-30 02:25:03,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34957 conditions, 18416 events. 12125/18416 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 121053 event pairs, 3755 based on Foata normal form. 172/16666 useless extension candidates. Maximal degree in co-relation 34953. Up to 12167 conditions per place. [2023-08-30 02:25:03,815 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 127 selfloop transitions, 28 changer transitions 0/161 dead transitions. [2023-08-30 02:25:03,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 161 transitions, 653 flow [2023-08-30 02:25:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:25:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:25:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1227 transitions. [2023-08-30 02:25:03,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.522127659574468 [2023-08-30 02:25:03,818 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1227 transitions. [2023-08-30 02:25:03,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1227 transitions. [2023-08-30 02:25:03,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:03,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1227 transitions. [2023-08-30 02:25:03,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.7) internal successors, (1227), 10 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:03,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:03,822 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:03,823 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 10 states and 1227 transitions. [2023-08-30 02:25:03,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 161 transitions, 653 flow [2023-08-30 02:25:03,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 161 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:25:03,825 INFO L231 Difference]: Finished difference. Result has 62 places, 70 transitions, 243 flow [2023-08-30 02:25:03,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=243, PETRI_PLACES=62, PETRI_TRANSITIONS=70} [2023-08-30 02:25:03,825 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-30 02:25:03,825 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 70 transitions, 243 flow [2023-08-30 02:25:03,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:03,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:03,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:03,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 02:25:04,032 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-30 02:25:04,034 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:04,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash 972047959, now seen corresponding path program 1 times [2023-08-30 02:25:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540032678] [2023-08-30 02:25:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:04,035 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-30 02:25:04,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:04,036 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-30 02:25:04,038 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-30 02:25:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:04,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 02:25:04,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:04,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:25:04,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 02:25:04,179 INFO L321 Elim1Store]: treesize reduction 53, result has 25.4 percent of original size [2023-08-30 02:25:04,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 28 [2023-08-30 02:25:04,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 02:25:04,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 312 treesize of output 312 [2023-08-30 02:25:04,402 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-30 02:25:04,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:04,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:04,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540032678] [2023-08-30 02:25:04,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540032678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:04,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:04,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:25:04,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851259317] [2023-08-30 02:25:04,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:04,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:25:04,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:25:04,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:25:04,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 235 [2023-08-30 02:25:04,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 70 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:04,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:04,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 235 [2023-08-30 02:25:04,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:04,879 INFO L130 PetriNetUnfolder]: 5221/8184 cut-off events. [2023-08-30 02:25:04,879 INFO L131 PetriNetUnfolder]: For 1989/2289 co-relation queries the response was YES. [2023-08-30 02:25:04,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17497 conditions, 8184 events. 5221/8184 cut-off events. For 1989/2289 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 55874 event pairs, 4685 based on Foata normal form. 86/6888 useless extension candidates. Maximal degree in co-relation 17489. Up to 7218 conditions per place. [2023-08-30 02:25:04,916 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 31 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-30 02:25:04,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 307 flow [2023-08-30 02:25:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:25:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:25:04,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-30 02:25:04,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2023-08-30 02:25:04,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-30 02:25:04,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-30 02:25:04,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:04,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-30 02:25:04,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:04,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:04,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:04,920 INFO L175 Difference]: Start difference. First operand has 62 places, 70 transitions, 243 flow. Second operand 3 states and 370 transitions. [2023-08-30 02:25:04,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 307 flow [2023-08-30 02:25:04,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 307 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:25:04,924 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 245 flow [2023-08-30 02:25:04,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2023-08-30 02:25:04,925 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-08-30 02:25:04,925 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 245 flow [2023-08-30 02:25:04,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:04,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:04,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:04,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 (10)] Forceful destruction successful, exit code 0 [2023-08-30 02:25:05,133 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-30 02:25:05,133 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:05,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash 972047960, now seen corresponding path program 1 times [2023-08-30 02:25:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:05,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441360802] [2023-08-30 02:25:05,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:05,134 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-30 02:25:05,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:05,135 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-30 02:25:05,137 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-30 02:25:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:05,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-30 02:25:05,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:05,252 INFO L321 Elim1Store]: treesize reduction 93, result has 26.8 percent of original size [2023-08-30 02:25:05,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2023-08-30 02:25:05,347 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-30 02:25:05,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:05,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441360802] [2023-08-30 02:25:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441360802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:05,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:25:05,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608310965] [2023-08-30 02:25:05,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:05,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:25:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:05,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:25:05,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:25:05,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-30 02:25:05,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:05,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:05,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-30 02:25:05,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:05,844 INFO L130 PetriNetUnfolder]: 3640/5912 cut-off events. [2023-08-30 02:25:05,844 INFO L131 PetriNetUnfolder]: For 1497/1706 co-relation queries the response was YES. [2023-08-30 02:25:05,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12646 conditions, 5912 events. 3640/5912 cut-off events. For 1497/1706 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 39900 event pairs, 3240 based on Foata normal form. 56/5426 useless extension candidates. Maximal degree in co-relation 12637. Up to 5088 conditions per place. [2023-08-30 02:25:05,867 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 30 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-30 02:25:05,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 307 flow [2023-08-30 02:25:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:25:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:25:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-30 02:25:05,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595744680851064 [2023-08-30 02:25:05,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-30 02:25:05,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-30 02:25:05,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:05,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-30 02:25:05,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:05,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:05,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:05,871 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 245 flow. Second operand 3 states and 324 transitions. [2023-08-30 02:25:05,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 307 flow [2023-08-30 02:25:05,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:25:05,874 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 243 flow [2023-08-30 02:25:05,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2023-08-30 02:25:05,876 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-30 02:25:05,876 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 243 flow [2023-08-30 02:25:05,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:05,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:05,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:05,887 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-30 02:25:06,083 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-30 02:25:06,083 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:06,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash -322596182, now seen corresponding path program 1 times [2023-08-30 02:25:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:06,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658599579] [2023-08-30 02:25:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:06,084 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-30 02:25:06,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:06,085 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-30 02:25:06,087 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-30 02:25:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:06,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 02:25:06,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:25:06,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:06,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:06,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658599579] [2023-08-30 02:25:06,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658599579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:06,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:06,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:25:06,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333319516] [2023-08-30 02:25:06,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:06,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:25:06,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:06,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:25:06,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:25:06,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-08-30 02:25:06,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:06,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:06,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-08-30 02:25:06,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:06,431 INFO L130 PetriNetUnfolder]: 2817/4825 cut-off events. [2023-08-30 02:25:06,431 INFO L131 PetriNetUnfolder]: For 1389/1514 co-relation queries the response was YES. [2023-08-30 02:25:06,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10579 conditions, 4825 events. 2817/4825 cut-off events. For 1389/1514 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 34283 event pairs, 879 based on Foata normal form. 530/4962 useless extension candidates. Maximal degree in co-relation 10570. Up to 1925 conditions per place. [2023-08-30 02:25:06,450 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 48 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2023-08-30 02:25:06,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 407 flow [2023-08-30 02:25:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:25:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:25:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-30 02:25:06,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5560283687943263 [2023-08-30 02:25:06,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-30 02:25:06,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-30 02:25:06,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:06,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-30 02:25:06,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:06,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:06,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:06,454 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 243 flow. Second operand 3 states and 392 transitions. [2023-08-30 02:25:06,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 407 flow [2023-08-30 02:25:06,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:25:06,460 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 255 flow [2023-08-30 02:25:06,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2023-08-30 02:25:06,461 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-08-30 02:25:06,461 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 255 flow [2023-08-30 02:25:06,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:06,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:06,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:06,471 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-30 02:25:06,667 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-30 02:25:06,668 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:06,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -940144752, now seen corresponding path program 2 times [2023-08-30 02:25:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:06,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200827380] [2023-08-30 02:25:06,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:25:06,668 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-30 02:25:06,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:06,669 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-30 02:25:06,670 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-30 02:25:06,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:25:06,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:25:06,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:25:06,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:06,738 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-30 02:25:06,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:06,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:06,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200827380] [2023-08-30 02:25:06,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200827380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:06,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:06,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:25:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78029145] [2023-08-30 02:25:06,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:06,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:25:06,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:06,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:25:06,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:25:06,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-08-30 02:25:06,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:06,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:06,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-08-30 02:25:06,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:06,981 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:06,981 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:25:06,981 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:06,981 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:06,982 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:06,982 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:06,982 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-30 02:25:06,982 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:25:06,982 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:25:06,982 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-30 02:25:07,023 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,023 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,023 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,023 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,023 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,024 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,024 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,024 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,024 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,024 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,025 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,025 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,025 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,025 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,025 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,025 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,025 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,025 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,029 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 347#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,029 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,029 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,029 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,029 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 02:25:07,048 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 92#L731true, 23#L752-4true]) [2023-08-30 02:25:07,048 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-08-30 02:25:07,048 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-30 02:25:07,048 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-30 02:25:07,048 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-30 02:25:07,048 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), 92#L731true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,048 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,048 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,049 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,049 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,054 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 36#$Ultimate##0true, 34#L741true, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,054 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,054 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,054 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,054 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,061 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,061 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,062 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,062 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,062 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,062 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,062 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,062 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,062 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,062 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,069 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 145#true, 244#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,069 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,072 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,072 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,072 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 145#true, 244#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,073 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,073 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,073 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,073 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,073 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 110#L741true, 104#L753-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,074 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,074 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,074 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,074 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,074 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 110#L741true, 104#L753-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,074 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,074 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,074 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,075 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,075 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,075 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,075 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,075 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,075 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,076 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,076 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,076 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,076 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,076 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,081 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 104#L753-1true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,081 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,081 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,081 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,081 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,082 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,082 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,082 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,082 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,082 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 02:25:07,099 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), 92#L731true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,099 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,099 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,099 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,100 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,102 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 36#$Ultimate##0true, 34#L741true, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,102 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,102 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,102 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,102 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,104 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 81#L714-1true, 34#L741true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32)), 23#L752-4true]) [2023-08-30 02:25:07,104 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,104 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,104 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,104 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32)), 23#L752-4true]) [2023-08-30 02:25:07,105 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,105 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,105 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,106 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,106 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 36#$Ultimate##0true, 34#L741true, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,106 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,106 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,106 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,106 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,112 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,112 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,112 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,112 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,112 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,112 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,112 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,112 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,113 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,113 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,113 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,113 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,113 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,113 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,113 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,113 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,113 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,113 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,120 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 110#L741true, 145#true, 244#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,120 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,120 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,120 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,120 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,120 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 110#L741true, 145#true, 86#L753-2true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,120 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,120 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,120 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,120 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,121 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,121 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,121 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,121 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,121 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,121 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,121 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,121 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,121 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,121 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,122 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,122 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,122 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,122 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,122 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,122 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 104#L753-1true, 145#true, 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,122 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,122 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,122 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,122 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,123 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32)), 23#L752-4true]) [2023-08-30 02:25:07,123 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,123 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,123 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,123 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,123 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,125 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,125 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,125 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,125 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,131 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [145#true, 86#L753-2true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 347#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,131 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,131 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,131 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,131 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,132 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 104#L753-1true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,132 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,132 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,132 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,132 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 02:25:07,146 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [18#L754-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), 92#L731true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,146 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,146 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,146 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,146 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,148 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 81#L714-1true, 34#L741true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,148 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,148 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,148 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,149 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,150 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [145#true, 86#L753-2true, 36#$Ultimate##0true, 34#L741true, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,150 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,150 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,150 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,150 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,151 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,151 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,151 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,151 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 36#$Ultimate##0true, 34#L741true, 112#readerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,151 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,151 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,151 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,151 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,153 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 112#readerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,153 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,153 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,154 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,154 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,154 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 81#L714-1true, 34#L741true, 112#readerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32)), 23#L752-4true]) [2023-08-30 02:25:07,154 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,154 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,154 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,154 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,160 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,160 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,160 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,160 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,160 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,160 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,160 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,160 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,161 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 110#L741true, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,161 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,161 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 110#L741true, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,161 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,161 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,162 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,162 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,162 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,162 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,162 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,162 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,168 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 18#L754-1true, 110#L741true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,169 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,169 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,169 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,169 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 110#L741true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,169 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,169 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,169 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,169 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,170 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 145#true, 86#L753-2true, 244#true, 387#(= ~r~0 (_ bv0 32)), 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,170 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,170 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,170 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,171 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 145#true, 86#L753-2true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,171 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,171 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,171 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,171 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,171 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,171 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,172 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,172 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,172 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,172 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 104#L753-1true, 145#true, 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,172 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,172 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,172 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,172 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [18#L754-1true, 145#true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,175 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,176 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,176 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,176 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,176 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [145#true, 86#L753-2true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,177 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,177 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,177 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,177 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 02:25:07,184 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 34#L741true, 347#true, 15#writerEXITtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,184 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,184 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,184 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,184 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,187 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [34#L741true, 382#true, 145#true, 244#true, 86#L753-2true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,187 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,187 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,187 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,187 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,188 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 145#true, 244#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,188 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,188 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,188 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,188 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 112#readerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,189 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,189 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,189 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,189 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 81#L714-1true, 34#L741true, 112#readerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,189 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,189 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,190 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,190 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,190 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [18#L754-1true, 145#true, 36#$Ultimate##0true, 34#L741true, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,190 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,190 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,190 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,190 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,191 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [145#true, 86#L753-2true, 36#$Ultimate##0true, 34#L741true, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,191 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,191 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,191 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,191 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,198 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [110#L741true, 145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,198 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,198 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,198 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,198 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,198 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [110#L741true, 145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,198 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,198 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,198 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,199 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,199 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [18#L754-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,199 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,199 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,199 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,199 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,199 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [18#L754-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,199 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,199 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,199 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,199 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,200 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 104#L753-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 382#true, 347#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,200 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,200 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,200 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,200 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,200 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,200 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,201 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,201 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,201 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,205 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,205 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,205 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,205 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 382#true, 145#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,205 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,205 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,205 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,205 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 145#true, 86#L753-2true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,206 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,206 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,206 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,206 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 145#true, 86#L753-2true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,206 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,206 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,206 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,206 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,209 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [18#L754-1true, 145#true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,209 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,209 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,210 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,210 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 02:25:07,214 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 34#L741true, 347#true, 15#writerEXITtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,214 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,214 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,214 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,214 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,217 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 34#L741true, 112#readerEXITtrue, 347#true, 15#writerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-30 02:25:07,217 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,217 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,217 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,217 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,222 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [34#L741true, 18#L754-1true, 382#true, 145#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,222 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,222 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,223 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,223 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,223 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 18#L754-1true, 145#true, 244#true, 13#L744true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,223 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,223 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,223 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,223 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,223 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 112#readerEXITtrue, 145#true, 86#L753-2true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,223 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,224 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,224 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,224 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,224 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [34#L741true, 112#readerEXITtrue, 382#true, 145#true, 244#true, 86#L753-2true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,224 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,224 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,224 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,224 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,226 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [18#L754-1true, 145#true, 36#$Ultimate##0true, 34#L741true, 112#readerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,226 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,226 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,226 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,226 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,230 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [18#L754-1true, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,230 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,230 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,230 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,230 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,231 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [18#L754-1true, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,231 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,231 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,231 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,231 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,231 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [145#true, 86#L753-2true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,231 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,231 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,231 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,231 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,232 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 104#L753-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,232 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,232 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,232 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,232 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,235 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,235 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,235 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,235 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,235 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,235 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 18#L754-1true, 382#true, 145#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,235 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,235 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,235 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,236 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 02:25:07,239 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [145#true, 86#L753-2true, 34#L741true, 347#true, 15#writerEXITtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,239 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,239 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,239 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,239 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,240 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 34#L741true, 112#readerEXITtrue, 347#true, 15#writerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,240 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,240 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,240 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,240 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,255 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 112#readerEXITtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,255 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,256 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,256 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,256 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,256 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [34#L741true, 112#readerEXITtrue, 18#L754-1true, 382#true, 145#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-30 02:25:07,256 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,256 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,256 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,257 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,261 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [18#L754-1true, 145#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,262 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,262 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,262 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,262 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,262 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [145#true, 86#L753-2true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,262 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,262 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,263 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,263 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 02:25:07,266 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [18#L754-1true, 145#true, 34#L741true, 347#true, 15#writerEXITtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,266 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,266 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,267 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,267 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,267 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [145#true, 86#L753-2true, 34#L741true, 112#readerEXITtrue, 382#true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,267 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,267 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,267 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,267 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,277 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [18#L754-1true, 145#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,277 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,277 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,277 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,277 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 02:25:07,279 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [18#L754-1true, 145#true, 34#L741true, 112#readerEXITtrue, 347#true, 15#writerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-30 02:25:07,279 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 02:25:07,279 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:25:07,279 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:25:07,279 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 02:25:07,299 INFO L130 PetriNetUnfolder]: 4255/7273 cut-off events. [2023-08-30 02:25:07,299 INFO L131 PetriNetUnfolder]: For 5397/5563 co-relation queries the response was YES. [2023-08-30 02:25:07,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18247 conditions, 7273 events. 4255/7273 cut-off events. For 5397/5563 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 54927 event pairs, 1047 based on Foata normal form. 208/6879 useless extension candidates. Maximal degree in co-relation 18237. Up to 3282 conditions per place. [2023-08-30 02:25:07,331 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 72 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2023-08-30 02:25:07,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 576 flow [2023-08-30 02:25:07,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:25:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:25:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-30 02:25:07,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5680851063829787 [2023-08-30 02:25:07,333 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-30 02:25:07,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-30 02:25:07,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:07,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-30 02:25:07,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:07,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:07,336 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:07,336 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 255 flow. Second operand 4 states and 534 transitions. [2023-08-30 02:25:07,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 576 flow [2023-08-30 02:25:07,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 118 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:25:07,349 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 330 flow [2023-08-30 02:25:07,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2023-08-30 02:25:07,350 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-08-30 02:25:07,350 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 330 flow [2023-08-30 02:25:07,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:07,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:07,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:07,359 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-30 02:25:07,560 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-30 02:25:07,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:07,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1105522908, now seen corresponding path program 1 times [2023-08-30 02:25:07,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:07,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505311407] [2023-08-30 02:25:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:07,561 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-30 02:25:07,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:07,562 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-30 02:25:07,564 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-30 02:25:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:07,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:25:07,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:07,653 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-30 02:25:07,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:07,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505311407] [2023-08-30 02:25:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505311407] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:07,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:07,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:25:07,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328204626] [2023-08-30 02:25:07,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:07,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:25:07,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:07,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:25:07,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:25:07,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-30 02:25:07,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:07,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:07,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-30 02:25:07,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:08,763 INFO L130 PetriNetUnfolder]: 9862/16710 cut-off events. [2023-08-30 02:25:08,764 INFO L131 PetriNetUnfolder]: For 13038/13051 co-relation queries the response was YES. [2023-08-30 02:25:08,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43164 conditions, 16710 events. 9862/16710 cut-off events. For 13038/13051 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 134048 event pairs, 2689 based on Foata normal form. 431/16830 useless extension candidates. Maximal degree in co-relation 43153. Up to 5750 conditions per place. [2023-08-30 02:25:08,828 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 203 selfloop transitions, 25 changer transitions 0/236 dead transitions. [2023-08-30 02:25:08,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 236 transitions, 1397 flow [2023-08-30 02:25:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:25:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:25:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1140 transitions. [2023-08-30 02:25:08,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2023-08-30 02:25:08,833 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1140 transitions. [2023-08-30 02:25:08,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1140 transitions. [2023-08-30 02:25:08,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:08,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1140 transitions. [2023-08-30 02:25:08,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.66666666666667) internal successors, (1140), 9 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:08,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:08,837 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:08,837 INFO L175 Difference]: Start difference. First operand has 66 places, 78 transitions, 330 flow. Second operand 9 states and 1140 transitions. [2023-08-30 02:25:08,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 236 transitions, 1397 flow [2023-08-30 02:25:08,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 236 transitions, 1381 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-30 02:25:08,886 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 438 flow [2023-08-30 02:25:08,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=438, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2023-08-30 02:25:08,887 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 6 predicate places. [2023-08-30 02:25:08,887 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 438 flow [2023-08-30 02:25:08,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:08,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:08,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:08,895 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-30 02:25:09,088 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-30 02:25:09,089 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:09,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1564325353, now seen corresponding path program 1 times [2023-08-30 02:25:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:09,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82533227] [2023-08-30 02:25:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:09,090 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-30 02:25:09,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:09,091 INFO L229 MonitoredProcess]: Starting monitored process 15 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-30 02:25:09,092 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 (15)] Waiting until timeout for monitored process [2023-08-30 02:25:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:09,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:25:09,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:09,170 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-30 02:25:09,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:09,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:09,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82533227] [2023-08-30 02:25:09,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82533227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:09,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:09,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:25:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578904408] [2023-08-30 02:25:09,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:09,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:25:09,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:09,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:25:09,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:25:09,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-30 02:25:09,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 438 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:09,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:09,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-30 02:25:09,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:11,095 INFO L130 PetriNetUnfolder]: 18080/30253 cut-off events. [2023-08-30 02:25:11,096 INFO L131 PetriNetUnfolder]: For 42702/43459 co-relation queries the response was YES. [2023-08-30 02:25:11,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86582 conditions, 30253 events. 18080/30253 cut-off events. For 42702/43459 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 257892 event pairs, 3644 based on Foata normal form. 1459/31316 useless extension candidates. Maximal degree in co-relation 86566. Up to 14855 conditions per place. [2023-08-30 02:25:11,251 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 207 selfloop transitions, 87 changer transitions 0/306 dead transitions. [2023-08-30 02:25:11,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 306 transitions, 2115 flow [2023-08-30 02:25:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:25:11,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:25:11,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1133 transitions. [2023-08-30 02:25:11,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356973995271868 [2023-08-30 02:25:11,254 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1133 transitions. [2023-08-30 02:25:11,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1133 transitions. [2023-08-30 02:25:11,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:11,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1133 transitions. [2023-08-30 02:25:11,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.88888888888889) internal successors, (1133), 9 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:11,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:11,259 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:11,259 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 438 flow. Second operand 9 states and 1133 transitions. [2023-08-30 02:25:11,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 306 transitions, 2115 flow [2023-08-30 02:25:11,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 306 transitions, 2047 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 02:25:11,513 INFO L231 Difference]: Finished difference. Result has 89 places, 161 transitions, 1099 flow [2023-08-30 02:25:11,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1099, PETRI_PLACES=89, PETRI_TRANSITIONS=161} [2023-08-30 02:25:11,514 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 17 predicate places. [2023-08-30 02:25:11,514 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 161 transitions, 1099 flow [2023-08-30 02:25:11,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:11,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:11,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:11,521 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 (15)] Forceful destruction successful, exit code 0 [2023-08-30 02:25:11,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-30 02:25:11,716 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:11,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1149898361, now seen corresponding path program 1 times [2023-08-30 02:25:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018514510] [2023-08-30 02:25:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:11,717 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-30 02:25:11,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:11,717 INFO L229 MonitoredProcess]: Starting monitored process 16 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-30 02:25:11,719 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 (16)] Waiting until timeout for monitored process [2023-08-30 02:25:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:11,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:25:11,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:11,811 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-30 02:25:11,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:11,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:11,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018514510] [2023-08-30 02:25:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018514510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:11,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:25:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039511549] [2023-08-30 02:25:11,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:11,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:25:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:11,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:25:11,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:25:11,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-08-30 02:25:11,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 161 transitions, 1099 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:11,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:11,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-08-30 02:25:11,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:12,510 INFO L130 PetriNetUnfolder]: 3699/7175 cut-off events. [2023-08-30 02:25:12,511 INFO L131 PetriNetUnfolder]: For 9924/10341 co-relation queries the response was YES. [2023-08-30 02:25:12,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21551 conditions, 7175 events. 3699/7175 cut-off events. For 9924/10341 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 59631 event pairs, 954 based on Foata normal form. 445/7308 useless extension candidates. Maximal degree in co-relation 21531. Up to 3095 conditions per place. [2023-08-30 02:25:12,540 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 94 selfloop transitions, 13 changer transitions 0/191 dead transitions. [2023-08-30 02:25:12,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 191 transitions, 1300 flow [2023-08-30 02:25:12,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:25:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:25:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-30 02:25:12,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5574468085106383 [2023-08-30 02:25:12,542 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-30 02:25:12,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-30 02:25:12,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:12,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-30 02:25:12,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:12,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:12,546 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:12,546 INFO L175 Difference]: Start difference. First operand has 89 places, 161 transitions, 1099 flow. Second operand 5 states and 655 transitions. [2023-08-30 02:25:12,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 191 transitions, 1300 flow [2023-08-30 02:25:12,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 191 transitions, 1294 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-30 02:25:12,570 INFO L231 Difference]: Finished difference. Result has 94 places, 135 transitions, 887 flow [2023-08-30 02:25:12,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=887, PETRI_PLACES=94, PETRI_TRANSITIONS=135} [2023-08-30 02:25:12,571 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 22 predicate places. [2023-08-30 02:25:12,571 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 135 transitions, 887 flow [2023-08-30 02:25:12,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:12,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:12,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:12,578 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 (16)] Ended with exit code 0 [2023-08-30 02:25:12,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-30 02:25:12,778 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:12,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:12,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1563377597, now seen corresponding path program 1 times [2023-08-30 02:25:12,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:12,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999942498] [2023-08-30 02:25:12,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:12,779 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-30 02:25:12,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:12,780 INFO L229 MonitoredProcess]: Starting monitored process 17 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-30 02:25:12,780 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 (17)] Waiting until timeout for monitored process [2023-08-30 02:25:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:12,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:25:12,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:12,892 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-30 02:25:12,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:12,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:12,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999942498] [2023-08-30 02:25:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999942498] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:12,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:25:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144112852] [2023-08-30 02:25:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:25:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:25:12,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:25:12,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-30 02:25:12,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 135 transitions, 887 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:12,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:12,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-30 02:25:12,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:13,740 INFO L130 PetriNetUnfolder]: 5271/9753 cut-off events. [2023-08-30 02:25:13,741 INFO L131 PetriNetUnfolder]: For 15616/15870 co-relation queries the response was YES. [2023-08-30 02:25:13,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31333 conditions, 9753 events. 5271/9753 cut-off events. For 15616/15870 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 76738 event pairs, 2424 based on Foata normal form. 148/9807 useless extension candidates. Maximal degree in co-relation 31311. Up to 7696 conditions per place. [2023-08-30 02:25:13,784 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 138 selfloop transitions, 55 changer transitions 0/205 dead transitions. [2023-08-30 02:25:13,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 205 transitions, 1675 flow [2023-08-30 02:25:13,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:25:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:25:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 966 transitions. [2023-08-30 02:25:13,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138297872340426 [2023-08-30 02:25:13,787 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 966 transitions. [2023-08-30 02:25:13,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 966 transitions. [2023-08-30 02:25:13,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:13,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 966 transitions. [2023-08-30 02:25:13,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:13,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:13,791 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:13,791 INFO L175 Difference]: Start difference. First operand has 94 places, 135 transitions, 887 flow. Second operand 8 states and 966 transitions. [2023-08-30 02:25:13,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 205 transitions, 1675 flow [2023-08-30 02:25:13,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 205 transitions, 1622 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 02:25:13,828 INFO L231 Difference]: Finished difference. Result has 103 places, 146 transitions, 1103 flow [2023-08-30 02:25:13,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1103, PETRI_PLACES=103, PETRI_TRANSITIONS=146} [2023-08-30 02:25:13,829 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 31 predicate places. [2023-08-30 02:25:13,829 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 146 transitions, 1103 flow [2023-08-30 02:25:13,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:13,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:13,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:13,837 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 (17)] Forceful destruction successful, exit code 0 [2023-08-30 02:25:14,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-30 02:25:14,036 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:14,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:14,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1168617517, now seen corresponding path program 1 times [2023-08-30 02:25:14,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:14,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826138168] [2023-08-30 02:25:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:14,037 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-30 02:25:14,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:14,037 INFO L229 MonitoredProcess]: Starting monitored process 18 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-30 02:25:14,038 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 (18)] Waiting until timeout for monitored process [2023-08-30 02:25:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:14,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:25:14,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:14,131 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-30 02:25:14,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:14,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:14,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826138168] [2023-08-30 02:25:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826138168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:14,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:25:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95126241] [2023-08-30 02:25:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:14,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:25:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:14,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:25:14,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:25:14,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-30 02:25:14,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 146 transitions, 1103 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:14,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:14,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-30 02:25:14,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:15,060 INFO L130 PetriNetUnfolder]: 5338/9873 cut-off events. [2023-08-30 02:25:15,060 INFO L131 PetriNetUnfolder]: For 18434/18686 co-relation queries the response was YES. [2023-08-30 02:25:15,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32077 conditions, 9873 events. 5338/9873 cut-off events. For 18434/18686 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 78007 event pairs, 1775 based on Foata normal form. 248/9998 useless extension candidates. Maximal degree in co-relation 32050. Up to 5735 conditions per place. [2023-08-30 02:25:15,107 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 171 selfloop transitions, 80 changer transitions 0/266 dead transitions. [2023-08-30 02:25:15,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 266 transitions, 2213 flow [2023-08-30 02:25:15,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:25:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:25:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-08-30 02:25:15,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5361702127659574 [2023-08-30 02:25:15,110 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-08-30 02:25:15,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-08-30 02:25:15,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:15,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-08-30 02:25:15,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:15,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:15,114 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:15,114 INFO L175 Difference]: Start difference. First operand has 103 places, 146 transitions, 1103 flow. Second operand 7 states and 882 transitions. [2023-08-30 02:25:15,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 266 transitions, 2213 flow [2023-08-30 02:25:15,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 266 transitions, 2205 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-30 02:25:15,168 INFO L231 Difference]: Finished difference. Result has 113 places, 177 transitions, 1571 flow [2023-08-30 02:25:15,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1571, PETRI_PLACES=113, PETRI_TRANSITIONS=177} [2023-08-30 02:25:15,169 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 41 predicate places. [2023-08-30 02:25:15,169 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 177 transitions, 1571 flow [2023-08-30 02:25:15,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:15,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:15,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:15,178 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 (18)] Forceful destruction successful, exit code 0 [2023-08-30 02:25:15,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-30 02:25:15,374 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:15,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1086748892, now seen corresponding path program 1 times [2023-08-30 02:25:15,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:15,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043448484] [2023-08-30 02:25:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:15,375 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-30 02:25:15,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:15,376 INFO L229 MonitoredProcess]: Starting monitored process 19 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-30 02:25:15,377 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 (19)] Waiting until timeout for monitored process [2023-08-30 02:25:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:25:15,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:25:15,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:25:15,487 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-30 02:25:15,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:25:15,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:25:15,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043448484] [2023-08-30 02:25:15,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043448484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:25:15,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:25:15,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:25:15,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937999138] [2023-08-30 02:25:15,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:25:15,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:25:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:25:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:25:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:25:15,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-30 02:25:15,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 177 transitions, 1571 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:15,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:25:15,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-30 02:25:15,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:25:16,663 INFO L130 PetriNetUnfolder]: 5871/11044 cut-off events. [2023-08-30 02:25:16,663 INFO L131 PetriNetUnfolder]: For 23972/24268 co-relation queries the response was YES. [2023-08-30 02:25:16,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37557 conditions, 11044 events. 5871/11044 cut-off events. For 23972/24268 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 89541 event pairs, 1856 based on Foata normal form. 266/11237 useless extension candidates. Maximal degree in co-relation 37525. Up to 5055 conditions per place. [2023-08-30 02:25:16,727 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 225 selfloop transitions, 65 changer transitions 0/304 dead transitions. [2023-08-30 02:25:16,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 304 transitions, 2784 flow [2023-08-30 02:25:16,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:25:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:25:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1011 transitions. [2023-08-30 02:25:16,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5377659574468086 [2023-08-30 02:25:16,729 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1011 transitions. [2023-08-30 02:25:16,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1011 transitions. [2023-08-30 02:25:16,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:25:16,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1011 transitions. [2023-08-30 02:25:16,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:16,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:16,734 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:16,734 INFO L175 Difference]: Start difference. First operand has 113 places, 177 transitions, 1571 flow. Second operand 8 states and 1011 transitions. [2023-08-30 02:25:16,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 304 transitions, 2784 flow [2023-08-30 02:25:16,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 304 transitions, 2784 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:25:16,804 INFO L231 Difference]: Finished difference. Result has 124 places, 186 transitions, 1801 flow [2023-08-30 02:25:16,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1801, PETRI_PLACES=124, PETRI_TRANSITIONS=186} [2023-08-30 02:25:16,804 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 52 predicate places. [2023-08-30 02:25:16,804 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 186 transitions, 1801 flow [2023-08-30 02:25:16,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:25:16,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:25:16,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:16,812 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 (19)] Forceful destruction successful, exit code 0 [2023-08-30 02:25:17,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-30 02:25:17,013 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-30 02:25:17,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:25:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1529828392, now seen corresponding path program 1 times [2023-08-30 02:25:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:25:17,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632452631] [2023-08-30 02:25:17,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:25:17,014 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-30 02:25:17,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:25:17,014 INFO L229 MonitoredProcess]: Starting monitored process 20 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-30 02:25:17,017 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 (20)] Waiting until timeout for monitored process [2023-08-30 02:25:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:25:17,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:25:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:25:17,216 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:25:17,216 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:25:17,217 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-08-30 02:25:17,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2023-08-30 02:25:17,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-08-30 02:25:17,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-08-30 02:25:17,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-08-30 02:25:17,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-08-30 02:25:17,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-08-30 02:25:17,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-08-30 02:25:17,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-08-30 02:25:17,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-08-30 02:25:17,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-08-30 02:25:17,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-08-30 02:25:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-08-30 02:25:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-08-30 02:25:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-08-30 02:25:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-08-30 02:25:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-08-30 02:25:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2023-08-30 02:25:17,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-08-30 02:25:17,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-08-30 02:25:17,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-08-30 02:25:17,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-08-30 02:25:17,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2023-08-30 02:25:17,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-08-30 02:25:17,239 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 (20)] Forceful destruction successful, exit code 0 [2023-08-30 02:25:17,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-30 02:25:17,439 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:25:17,443 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:25:17,444 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:25:17,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:25:17 BasicIcfg [2023-08-30 02:25:17,478 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:25:17,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:25:17,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:25:17,478 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:25:17,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:24:48" (3/4) ... [2023-08-30 02:25:17,481 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:25:17,481 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:25:17,481 INFO L158 Benchmark]: Toolchain (without parser) took 30187.12ms. Allocated memory was 79.7MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 54.9MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 701.1MB. Max. memory is 16.1GB. [2023-08-30 02:25:17,482 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 79.7MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:25:17,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.72ms. Allocated memory is still 79.7MB. Free memory was 54.7MB in the beginning and 55.6MB in the end (delta: -922.9kB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2023-08-30 02:25:17,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.74ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 53.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:25:17,482 INFO L158 Benchmark]: Boogie Preprocessor took 42.33ms. Allocated memory is still 79.7MB. Free memory was 53.5MB in the beginning and 51.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:25:17,482 INFO L158 Benchmark]: RCFGBuilder took 480.37ms. Allocated memory was 79.7MB in the beginning and 111.1MB in the end (delta: 31.5MB). Free memory was 51.7MB in the beginning and 84.6MB in the end (delta: -32.9MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2023-08-30 02:25:17,483 INFO L158 Benchmark]: TraceAbstraction took 29230.92ms. Allocated memory was 111.1MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 84.1MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 699.7MB. Max. memory is 16.1GB. [2023-08-30 02:25:17,483 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 2.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:25:17,484 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.13ms. Allocated memory is still 79.7MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.72ms. Allocated memory is still 79.7MB. Free memory was 54.7MB in the beginning and 55.6MB in the end (delta: -922.9kB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.74ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 53.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.33ms. Allocated memory is still 79.7MB. Free memory was 53.5MB in the beginning and 51.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 480.37ms. Allocated memory was 79.7MB in the beginning and 111.1MB in the end (delta: 31.5MB). Free memory was 51.7MB in the beginning and 84.6MB in the end (delta: -32.9MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29230.92ms. Allocated memory was 111.1MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 84.1MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 699.7MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 2.9GB. Free memory was 2.1GB in the beginning and 2.1GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 134 PlacesBefore, 72 PlacesAfterwards, 123 TransitionsBefore, 61 TransitionsAfterwards, 3246 CoEnabledTransitionPairs, 5 FixpointIterations, 39 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 104 TotalNumberOfCompositions, 11920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4744, independent: 4503, independent conditional: 0, independent unconditional: 4503, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1607, independent: 1570, independent conditional: 0, independent unconditional: 1570, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4744, independent: 2933, independent conditional: 0, independent unconditional: 2933, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 1607, unknown conditional: 0, unknown unconditional: 1607] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 338, Positive conditional cache size: 0, Positive unconditional cache size: 338, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 738]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 738. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-1, r=0, t1={7:0}, t2={-2147483637:0}, t3={15:0}, t4={11:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=0, r=0, t1={7:0}, t2={-2147483637:0}, t3={15:0}, t4={11:0}, w=0, x=0, y=0] [L724] 2 int l; [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=1, r=1, t1={7:0}, t2={-2147483637:0}, t3={15:0}, t4={11:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=2, r=1, t1={7:0}, t2={-2147483637:0}, t3={15:0}, t4={11:0}, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L724] 4 int l; [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l [L745] 2 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L730] 4 y = l VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] 4 reach_error() VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] - 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: -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: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 749]: 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: 750]: 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: 751]: 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: 752]: 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 7 procedures, 156 locations, 24 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: 29.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1983 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1422 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3168 IncrementalHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 116 mSDtfsCounter, 3168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1801occurred in iteration=18, InterpolantAutomatonStates: 89, 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.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 154 ConstructedInterpolants, 14 QuantifiedInterpolants, 866 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1554 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 02:25:17,501 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