./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS --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 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:18:05,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:18:05,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:18:05,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:18:05,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:18:05,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:18:05,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:18:05,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:18:05,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:18:05,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:18:05,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:18:05,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:18:05,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:18:05,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:18:05,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:18:05,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:18:05,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:18:05,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:18:05,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:18:05,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:18:05,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:18:05,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:18:05,828 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:18:05,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:18:05,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:18:05,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:18:05,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:18:05,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:18:05,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:18:05,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:18:05,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:18:05,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:18:05,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:18:05,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:18:05,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:18:05,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:18:05,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:18:05,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:18:05,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:18:05,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:18:05,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:18:05,859 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 02:18:05,883 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:18:05,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:18:05,884 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:18:05,884 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:18:05,885 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:18:05,885 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:18:05,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:18:05,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:18:05,886 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:18:05,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:18:05,886 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:18:05,886 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:18:05,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:18:05,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:18:05,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:18:05,887 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:18:05,887 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:18:05,887 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:18:05,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:18:05,888 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:18:05,888 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:18:05,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:18:05,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:18:05,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:18:05,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:18:05,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:18:05,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:18:05,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:18:05,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:18:05,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:18:05,890 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:18:05,890 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:18:05,890 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:18:05,890 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS 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 [2022-11-23 02:18:06,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:18:06,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:18:06,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:18:06,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:18:06,186 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:18:06,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-23 02:18:09,302 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:18:09,552 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:18:09,552 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-23 02:18:09,566 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/data/2bb733008/4d46ee7911854b26a38b6e43bbb246ad/FLAG47c60641c [2022-11-23 02:18:09,587 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/data/2bb733008/4d46ee7911854b26a38b6e43bbb246ad [2022-11-23 02:18:09,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:18:09,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:18:09,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:18:09,595 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:18:09,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:18:09,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:09" (1/1) ... [2022-11-23 02:18:09,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28479783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:09, skipping insertion in model container [2022-11-23 02:18:09,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:09" (1/1) ... [2022-11-23 02:18:09,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:18:09,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:18:09,895 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-23 02:18:10,102 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-23 02:18:10,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:18:10,134 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:18:10,159 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-23 02:18:10,194 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-23 02:18:10,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:18:10,242 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:18:10,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10 WrapperNode [2022-11-23 02:18:10,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:18:10,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:18:10,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:18:10,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:18:10,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,315 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-11-23 02:18:10,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:18:10,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:18:10,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:18:10,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:18:10,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,360 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:18:10,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:18:10,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:18:10,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:18:10,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (1/1) ... [2022-11-23 02:18:10,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:18:10,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:18:10,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:18:10,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:18:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 02:18:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:18:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:18:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:18:10,473 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-23 02:18:10,473 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-23 02:18:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:18:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:18:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:18:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:18:10,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:18:10,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:18:10,475 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-23 02:18:10,476 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-23 02:18:10,477 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:18:10,605 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:18:10,607 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:18:10,874 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:18:10,928 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:18:10,928 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:18:10,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:10 BoogieIcfgContainer [2022-11-23 02:18:10,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:18:10,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:18:10,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:18:10,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:18:10,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:09" (1/3) ... [2022-11-23 02:18:10,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48697bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:10, skipping insertion in model container [2022-11-23 02:18:10,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:10" (2/3) ... [2022-11-23 02:18:10,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48697bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:10, skipping insertion in model container [2022-11-23 02:18:10,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:10" (3/3) ... [2022-11-23 02:18:10,942 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-11-23 02:18:10,969 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:18:10,969 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-23 02:18:10,970 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:18:11,099 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-23 02:18:11,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 300 flow [2022-11-23 02:18:11,206 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-11-23 02:18:11,207 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 02:18:11,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 130 events. 2/130 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/109 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-11-23 02:18:11,215 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 300 flow [2022-11-23 02:18:11,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 274 flow [2022-11-23 02:18:11,225 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:18:11,241 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 274 flow [2022-11-23 02:18:11,257 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 274 flow [2022-11-23 02:18:11,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 274 flow [2022-11-23 02:18:11,323 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-11-23 02:18:11,328 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 02:18:11,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 125 events. 2/125 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/105 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2022-11-23 02:18:11,368 INFO L119 LiptonReduction]: Number of co-enabled transitions 3246 [2022-11-23 02:18:16,685 INFO L134 LiptonReduction]: Checked pairs total: 17532 [2022-11-23 02:18:16,686 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-11-23 02:18:16,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:18:16,724 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;@30c6f665, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:18:16,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-11-23 02:18:16,730 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-23 02:18:16,731 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:18:16,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:16,732 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 02:18:16,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:16,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash 466, now seen corresponding path program 1 times [2022-11-23 02:18:16,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:16,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172794808] [2022-11-23 02:18:16,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:16,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:16,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172794808] [2022-11-23 02:18:16,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172794808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:16,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:16,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 02:18:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900759611] [2022-11-23 02:18:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:16,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:18:16,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:16,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:18:16,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:18:16,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 250 [2022-11-23 02:18:16,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 138 flow. Second operand has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:16,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:16,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 250 [2022-11-23 02:18:16,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:17,800 INFO L130 PetriNetUnfolder]: 3680/5888 cut-off events. [2022-11-23 02:18:17,800 INFO L131 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2022-11-23 02:18:17,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11333 conditions, 5888 events. 3680/5888 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 39817 event pairs, 3680 based on Foata normal form. 0/4852 useless extension candidates. Maximal degree in co-relation 8893. Up to 5216 conditions per place. [2022-11-23 02:18:17,856 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 43 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2022-11-23 02:18:17,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 53 transitions, 216 flow [2022-11-23 02:18:17,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:18:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 02:18:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-11-23 02:18:17,876 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.574 [2022-11-23 02:18:17,877 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-11-23 02:18:17,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-11-23 02:18:17,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:17,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-11-23 02:18:17,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:17,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:17,901 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:17,903 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 138 flow. Second operand 2 states and 287 transitions. [2022-11-23 02:18:17,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 53 transitions, 216 flow [2022-11-23 02:18:17,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 200 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-23 02:18:17,919 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 114 flow [2022-11-23 02:18:17,921 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-11-23 02:18:17,960 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2022-11-23 02:18:17,960 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 114 flow [2022-11-23 02:18:17,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:17,960 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:17,960 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 02:18:17,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:18:17,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:17,961 INFO L85 PathProgramCache]: Analyzing trace with hash 457269, now seen corresponding path program 1 times [2022-11-23 02:18:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:17,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13228221] [2022-11-23 02:18:17,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:17,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:18,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:18,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13228221] [2022-11-23 02:18:18,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13228221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:18,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:18,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217675788] [2022-11-23 02:18:18,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:18,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:18,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:18,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:18,441 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2022-11-23 02:18:18,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 114 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) [2022-11-23 02:18:18,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:18,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2022-11-23 02:18:18,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:19,125 INFO L130 PetriNetUnfolder]: 3508/5638 cut-off events. [2022-11-23 02:18:19,125 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:19,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10670 conditions, 5638 events. 3508/5638 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 38089 event pairs, 3508 based on Foata normal form. 0/4708 useless extension candidates. Maximal degree in co-relation 10667. Up to 4964 conditions per place. [2022-11-23 02:18:19,170 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 39 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2022-11-23 02:18:19,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 192 flow [2022-11-23 02:18:19,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2022-11-23 02:18:19,174 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-11-23 02:18:19,174 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2022-11-23 02:18:19,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2022-11-23 02:18:19,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:19,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2022-11-23 02:18:19,176 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) [2022-11-23 02:18:19,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:19,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:19,183 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 114 flow. Second operand 3 states and 370 transitions. [2022-11-23 02:18:19,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 192 flow [2022-11-23 02:18:19,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:18:19,186 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2022-11-23 02:18:19,187 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, 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} [2022-11-23 02:18:19,189 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2022-11-23 02:18:19,190 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2022-11-23 02:18:19,191 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) [2022-11-23 02:18:19,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:19,191 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 02:18:19,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:18:19,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 457270, now seen corresponding path program 1 times [2022-11-23 02:18:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:19,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698411458] [2022-11-23 02:18:19,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:19,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:19,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:19,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698411458] [2022-11-23 02:18:19,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698411458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:19,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:19,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:19,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881031794] [2022-11-23 02:18:19,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:19,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:19,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:19,455 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 250 [2022-11-23 02:18:19,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 114 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) [2022-11-23 02:18:19,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:19,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 250 [2022-11-23 02:18:19,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:20,040 INFO L130 PetriNetUnfolder]: 3336/5388 cut-off events. [2022-11-23 02:18:20,040 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:20,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10173 conditions, 5388 events. 3336/5388 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 36341 event pairs, 3336 based on Foata normal form. 0/4564 useless extension candidates. Maximal degree in co-relation 10169. Up to 4714 conditions per place. [2022-11-23 02:18:20,076 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 37 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-11-23 02:18:20,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 188 flow [2022-11-23 02:18:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2022-11-23 02:18:20,078 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5146666666666667 [2022-11-23 02:18:20,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2022-11-23 02:18:20,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2022-11-23 02:18:20,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:20,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2022-11-23 02:18:20,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:20,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:20,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:20,082 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 386 transitions. [2022-11-23 02:18:20,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 188 flow [2022-11-23 02:18:20,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:20,084 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2022-11-23 02:18:20,084 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, 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} [2022-11-23 02:18:20,085 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -11 predicate places. [2022-11-23 02:18:20,085 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2022-11-23 02:18:20,086 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) [2022-11-23 02:18:20,086 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:20,086 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:18:20,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:18:20,087 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:20,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:20,087 INFO L85 PathProgramCache]: Analyzing trace with hash 439444824, now seen corresponding path program 1 times [2022-11-23 02:18:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33569890] [2022-11-23 02:18:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:20,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33569890] [2022-11-23 02:18:20,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33569890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:20,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:20,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892080165] [2022-11-23 02:18:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:20,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:20,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:20,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:20,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:20,300 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2022-11-23 02:18:20,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:20,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:20,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2022-11-23 02:18:20,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:20,945 INFO L130 PetriNetUnfolder]: 3292/5302 cut-off events. [2022-11-23 02:18:20,946 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:20,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10013 conditions, 5302 events. 3292/5302 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 35659 event pairs, 3292 based on Foata normal form. 0/4508 useless extension candidates. Maximal degree in co-relation 10009. Up to 4640 conditions per place. [2022-11-23 02:18:20,989 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-11-23 02:18:20,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 180 flow [2022-11-23 02:18:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-11-23 02:18:20,992 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.488 [2022-11-23 02:18:20,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-11-23 02:18:20,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-11-23 02:18:20,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:20,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-11-23 02:18:20,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:20,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:20,998 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:20,998 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 366 transitions. [2022-11-23 02:18:20,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 180 flow [2022-11-23 02:18:20,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:21,000 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2022-11-23 02:18:21,000 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, 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} [2022-11-23 02:18:21,002 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2022-11-23 02:18:21,002 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2022-11-23 02:18:21,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:21,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:21,003 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:18:21,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:18:21,003 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:21,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash 439444825, now seen corresponding path program 1 times [2022-11-23 02:18:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:21,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623845265] [2022-11-23 02:18:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:21,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:21,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623845265] [2022-11-23 02:18:21,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623845265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:21,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:21,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020416358] [2022-11-23 02:18:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:21,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:21,280 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 250 [2022-11-23 02:18:21,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:21,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:21,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 250 [2022-11-23 02:18:21,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:21,856 INFO L130 PetriNetUnfolder]: 3248/5216 cut-off events. [2022-11-23 02:18:21,856 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:21,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9853 conditions, 5216 events. 3248/5216 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 35027 event pairs, 3248 based on Foata normal form. 0/4452 useless extension candidates. Maximal degree in co-relation 9849. Up to 4566 conditions per place. [2022-11-23 02:18:21,887 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 33 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-23 02:18:21,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 172 flow [2022-11-23 02:18:21,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-11-23 02:18:21,889 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5093333333333333 [2022-11-23 02:18:21,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-11-23 02:18:21,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-11-23 02:18:21,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:21,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-11-23 02:18:21,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:21,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:21,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:21,893 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 382 transitions. [2022-11-23 02:18:21,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 172 flow [2022-11-23 02:18:21,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:21,895 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2022-11-23 02:18:21,895 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, 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} [2022-11-23 02:18:21,896 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2022-11-23 02:18:21,896 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2022-11-23 02:18:21,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:21,897 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:21,897 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:21,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:18:21,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:21,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1399693237, now seen corresponding path program 1 times [2022-11-23 02:18:21,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:21,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336592717] [2022-11-23 02:18:21,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:21,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:21,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:21,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336592717] [2022-11-23 02:18:21,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336592717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:21,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:21,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369778383] [2022-11-23 02:18:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:21,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:21,999 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2022-11-23 02:18:21,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:22,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:22,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2022-11-23 02:18:22,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:22,609 INFO L130 PetriNetUnfolder]: 3148/5054 cut-off events. [2022-11-23 02:18:22,610 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:22,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9541 conditions, 5054 events. 3148/5054 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 33906 event pairs, 3148 based on Foata normal form. 0/4352 useless extension candidates. Maximal degree in co-relation 9537. Up to 4416 conditions per place. [2022-11-23 02:18:22,647 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 31 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-11-23 02:18:22,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 164 flow [2022-11-23 02:18:22,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2022-11-23 02:18:22,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4826666666666667 [2022-11-23 02:18:22,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2022-11-23 02:18:22,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2022-11-23 02:18:22,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:22,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2022-11-23 02:18:22,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:22,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:22,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:22,654 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 362 transitions. [2022-11-23 02:18:22,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 164 flow [2022-11-23 02:18:22,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:22,656 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2022-11-23 02:18:22,657 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, 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} [2022-11-23 02:18:22,658 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -17 predicate places. [2022-11-23 02:18:22,658 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2022-11-23 02:18:22,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:22,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:22,659 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:22,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 02:18:22,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1399693238, now seen corresponding path program 1 times [2022-11-23 02:18:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:22,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910265319] [2022-11-23 02:18:22,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:22,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:22,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910265319] [2022-11-23 02:18:22,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910265319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:22,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:22,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:22,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487677911] [2022-11-23 02:18:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:22,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:22,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:22,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:22,789 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 250 [2022-11-23 02:18:22,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 98 flow. Second operand has 3 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) [2022-11-23 02:18:22,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:22,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 250 [2022-11-23 02:18:22,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:23,286 INFO L130 PetriNetUnfolder]: 3048/4892 cut-off events. [2022-11-23 02:18:23,286 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:23,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9229 conditions, 4892 events. 3048/4892 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 32642 event pairs, 3048 based on Foata normal form. 0/4252 useless extension candidates. Maximal degree in co-relation 9225. Up to 4266 conditions per place. [2022-11-23 02:18:23,318 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 29 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-11-23 02:18:23,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 156 flow [2022-11-23 02:18:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2022-11-23 02:18:23,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.504 [2022-11-23 02:18:23,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2022-11-23 02:18:23,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2022-11-23 02:18:23,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:23,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2022-11-23 02:18:23,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:23,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:23,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:23,325 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 3 states and 378 transitions. [2022-11-23 02:18:23,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 156 flow [2022-11-23 02:18:23,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:23,326 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 94 flow [2022-11-23 02:18:23,327 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-11-23 02:18:23,327 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -19 predicate places. [2022-11-23 02:18:23,327 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 94 flow [2022-11-23 02:18:23,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-11-23 02:18:23,328 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:23,328 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:23,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:18:23,328 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:23,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:23,329 INFO L85 PathProgramCache]: Analyzing trace with hash 780446453, now seen corresponding path program 1 times [2022-11-23 02:18:23,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:23,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955729335] [2022-11-23 02:18:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:23,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:23,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955729335] [2022-11-23 02:18:23,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955729335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:23,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:23,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:18:23,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27782089] [2022-11-23 02:18:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:23,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:18:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:18:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:18:23,648 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2022-11-23 02:18:23,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:23,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:23,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2022-11-23 02:18:23,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:24,095 INFO L130 PetriNetUnfolder]: 2388/3863 cut-off events. [2022-11-23 02:18:24,095 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:24,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7315 conditions, 3863 events. 2388/3863 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 24913 event pairs, 2388 based on Foata normal form. 0/3469 useless extension candidates. Maximal degree in co-relation 7311. Up to 3381 conditions per place. [2022-11-23 02:18:24,125 INFO L137 encePairwiseOnDemand]: 247/250 looper letters, 28 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-11-23 02:18:24,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 152 flow [2022-11-23 02:18:24,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2022-11-23 02:18:24,128 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2022-11-23 02:18:24,128 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2022-11-23 02:18:24,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2022-11-23 02:18:24,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:24,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2022-11-23 02:18:24,130 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) [2022-11-23 02:18:24,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:24,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:24,132 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 94 flow. Second operand 3 states and 355 transitions. [2022-11-23 02:18:24,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 152 flow [2022-11-23 02:18:24,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:24,136 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 92 flow [2022-11-23 02:18:24,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-11-23 02:18:24,139 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2022-11-23 02:18:24,140 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 92 flow [2022-11-23 02:18:24,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:24,140 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:24,141 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:24,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:18:24,141 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash 780446454, now seen corresponding path program 1 times [2022-11-23 02:18:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:24,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841109141] [2022-11-23 02:18:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:24,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:24,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841109141] [2022-11-23 02:18:24,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841109141] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:24,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:24,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:18:24,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362248385] [2022-11-23 02:18:24,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:24,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:18:24,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:24,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:18:24,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:18:24,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 250 [2022-11-23 02:18:24,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:24,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:24,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 250 [2022-11-23 02:18:24,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:24,744 INFO L130 PetriNetUnfolder]: 1728/2834 cut-off events. [2022-11-23 02:18:24,744 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:24,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5401 conditions, 2834 events. 1728/2834 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 17685 event pairs, 1728 based on Foata normal form. 0/2686 useless extension candidates. Maximal degree in co-relation 5397. Up to 2496 conditions per place. [2022-11-23 02:18:24,761 INFO L137 encePairwiseOnDemand]: 247/250 looper letters, 27 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-11-23 02:18:24,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 148 flow [2022-11-23 02:18:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-11-23 02:18:24,763 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.428 [2022-11-23 02:18:24,763 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-11-23 02:18:24,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-11-23 02:18:24,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:24,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-11-23 02:18:24,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:24,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:24,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:24,767 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 92 flow. Second operand 3 states and 321 transitions. [2022-11-23 02:18:24,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 148 flow [2022-11-23 02:18:24,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:24,769 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 90 flow [2022-11-23 02:18:24,769 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-11-23 02:18:24,770 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2022-11-23 02:18:24,770 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 90 flow [2022-11-23 02:18:24,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:24,773 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:24,773 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:24,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 02:18:24,774 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash 744774827, now seen corresponding path program 1 times [2022-11-23 02:18:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:24,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531293426] [2022-11-23 02:18:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:24,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531293426] [2022-11-23 02:18:24,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531293426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:24,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:24,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:18:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845764378] [2022-11-23 02:18:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:24,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:18:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:18:24,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:18:24,886 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-11-23 02:18:24,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:24,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:24,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-11-23 02:18:24,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:26,360 INFO L130 PetriNetUnfolder]: 11095/16758 cut-off events. [2022-11-23 02:18:26,360 INFO L131 PetriNetUnfolder]: For 419/419 co-relation queries the response was YES. [2022-11-23 02:18:26,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32569 conditions, 16758 events. 11095/16758 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 108662 event pairs, 1883 based on Foata normal form. 440/17122 useless extension candidates. Maximal degree in co-relation 32565. Up to 7827 conditions per place. [2022-11-23 02:18:26,457 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 142 selfloop transitions, 26 changer transitions 0/172 dead transitions. [2022-11-23 02:18:26,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 172 transitions, 719 flow [2022-11-23 02:18:26,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:18:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:18:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1160 transitions. [2022-11-23 02:18:26,462 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2022-11-23 02:18:26,462 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1160 transitions. [2022-11-23 02:18:26,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1160 transitions. [2022-11-23 02:18:26,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:26,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1160 transitions. [2022-11-23 02:18:26,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.88888888888889) internal successors, (1160), 9 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:26,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:26,472 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:26,473 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 90 flow. Second operand 9 states and 1160 transitions. [2022-11-23 02:18:26,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 172 transitions, 719 flow [2022-11-23 02:18:26,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 172 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:26,479 INFO L231 Difference]: Finished difference. Result has 57 places, 64 transitions, 227 flow [2022-11-23 02:18:26,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=227, PETRI_PLACES=57, PETRI_TRANSITIONS=64} [2022-11-23 02:18:26,480 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -11 predicate places. [2022-11-23 02:18:26,480 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 64 transitions, 227 flow [2022-11-23 02:18:26,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:26,481 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:26,481 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:26,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 02:18:26,482 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:26,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash 942261340, now seen corresponding path program 1 times [2022-11-23 02:18:26,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:26,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220245391] [2022-11-23 02:18:26,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:26,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:26,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:26,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220245391] [2022-11-23 02:18:26,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220245391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:26,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:26,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:18:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342641622] [2022-11-23 02:18:26,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:26,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:26,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:26,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:26,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:26,548 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 250 [2022-11-23 02:18:26,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 64 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:26,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:26,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 250 [2022-11-23 02:18:26,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:27,393 INFO L130 PetriNetUnfolder]: 4871/8150 cut-off events. [2022-11-23 02:18:27,393 INFO L131 PetriNetUnfolder]: For 2444/2674 co-relation queries the response was YES. [2022-11-23 02:18:27,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18495 conditions, 8150 events. 4871/8150 cut-off events. For 2444/2674 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 60843 event pairs, 1300 based on Foata normal form. 867/8643 useless extension candidates. Maximal degree in co-relation 18487. Up to 3347 conditions per place. [2022-11-23 02:18:27,471 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 48 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2022-11-23 02:18:27,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 391 flow [2022-11-23 02:18:27,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2022-11-23 02:18:27,473 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5346666666666666 [2022-11-23 02:18:27,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2022-11-23 02:18:27,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2022-11-23 02:18:27,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:27,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2022-11-23 02:18:27,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:27,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:27,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:27,478 INFO L175 Difference]: Start difference. First operand has 57 places, 64 transitions, 227 flow. Second operand 3 states and 401 transitions. [2022-11-23 02:18:27,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 391 flow [2022-11-23 02:18:27,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 391 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:18:27,499 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 243 flow [2022-11-23 02:18:27,499 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=60, PETRI_TRANSITIONS=64} [2022-11-23 02:18:27,500 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2022-11-23 02:18:27,500 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 243 flow [2022-11-23 02:18:27,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:27,501 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:27,501 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:27,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 02:18:27,501 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:27,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash 759357656, now seen corresponding path program 2 times [2022-11-23 02:18:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:27,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657268800] [2022-11-23 02:18:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:27,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:27,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657268800] [2022-11-23 02:18:27,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657268800] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:27,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:27,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:18:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852037201] [2022-11-23 02:18:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:27,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:18:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:18:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:18:27,587 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 250 [2022-11-23 02:18:27,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 64 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:27,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:27,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 250 [2022-11-23 02:18:27,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:28,087 INFO L130 PetriNetUnfolder]: 1767/3696 cut-off events. [2022-11-23 02:18:28,088 INFO L131 PetriNetUnfolder]: For 2906/2997 co-relation queries the response was YES. [2022-11-23 02:18:28,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8928 conditions, 3696 events. 1767/3696 cut-off events. For 2906/2997 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 29442 event pairs, 445 based on Foata normal form. 379/3903 useless extension candidates. Maximal degree in co-relation 8918. Up to 1190 conditions per place. [2022-11-23 02:18:28,116 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 71 selfloop transitions, 9 changer transitions 0/112 dead transitions. [2022-11-23 02:18:28,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 112 transitions, 556 flow [2022-11-23 02:18:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:18:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:18:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2022-11-23 02:18:28,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.543 [2022-11-23 02:18:28,120 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2022-11-23 02:18:28,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2022-11-23 02:18:28,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:28,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2022-11-23 02:18:28,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 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) [2022-11-23 02:18:28,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:28,125 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:28,125 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 243 flow. Second operand 4 states and 543 transitions. [2022-11-23 02:18:28,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 112 transitions, 556 flow [2022-11-23 02:18:28,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 112 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:28,137 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 309 flow [2022-11-23 02:18:28,137 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=64, PETRI_TRANSITIONS=72} [2022-11-23 02:18:28,138 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2022-11-23 02:18:28,138 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 309 flow [2022-11-23 02:18:28,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:28,138 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:28,139 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:28,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 02:18:28,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1226107087, now seen corresponding path program 1 times [2022-11-23 02:18:28,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:28,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686729838] [2022-11-23 02:18:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:28,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:28,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686729838] [2022-11-23 02:18:28,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686729838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:28,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:28,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:18:28,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100641004] [2022-11-23 02:18:28,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:28,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:18:28,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:28,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:18:28,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:18:28,239 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-11-23 02:18:28,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 72 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:28,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:28,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-11-23 02:18:28,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:29,155 INFO L130 PetriNetUnfolder]: 3273/6109 cut-off events. [2022-11-23 02:18:29,155 INFO L131 PetriNetUnfolder]: For 5673/5847 co-relation queries the response was YES. [2022-11-23 02:18:29,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17174 conditions, 6109 events. 3273/6109 cut-off events. For 5673/5847 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 44792 event pairs, 523 based on Foata normal form. 418/6493 useless extension candidates. Maximal degree in co-relation 17162. Up to 2621 conditions per place. [2022-11-23 02:18:29,205 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 175 selfloop transitions, 47 changer transitions 0/228 dead transitions. [2022-11-23 02:18:29,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 228 transitions, 1411 flow [2022-11-23 02:18:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:18:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:18:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1153 transitions. [2022-11-23 02:18:29,210 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5124444444444445 [2022-11-23 02:18:29,210 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1153 transitions. [2022-11-23 02:18:29,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1153 transitions. [2022-11-23 02:18:29,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:29,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1153 transitions. [2022-11-23 02:18:29,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.11111111111111) internal successors, (1153), 9 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:29,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:29,220 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 250.0) internal successors, (2500), 10 states have internal predecessors, (2500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:29,221 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 309 flow. Second operand 9 states and 1153 transitions. [2022-11-23 02:18:29,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 228 transitions, 1411 flow [2022-11-23 02:18:29,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 228 transitions, 1411 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:18:29,237 INFO L231 Difference]: Finished difference. Result has 78 places, 109 transitions, 650 flow [2022-11-23 02:18:29,238 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=650, PETRI_PLACES=78, PETRI_TRANSITIONS=109} [2022-11-23 02:18:29,238 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2022-11-23 02:18:29,239 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 109 transitions, 650 flow [2022-11-23 02:18:29,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:29,239 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:29,240 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:29,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 02:18:29,240 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1822399055, now seen corresponding path program 1 times [2022-11-23 02:18:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:29,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138256617] [2022-11-23 02:18:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:29,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138256617] [2022-11-23 02:18:29,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138256617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:29,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:29,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:18:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010944823] [2022-11-23 02:18:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:29,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:18:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:29,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:18:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:18:29,342 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-11-23 02:18:29,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 109 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:29,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:29,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-11-23 02:18:29,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:30,156 INFO L130 PetriNetUnfolder]: 3179/6029 cut-off events. [2022-11-23 02:18:30,157 INFO L131 PetriNetUnfolder]: For 8699/8787 co-relation queries the response was YES. [2022-11-23 02:18:30,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19838 conditions, 6029 events. 3179/6029 cut-off events. For 8699/8787 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 44627 event pairs, 738 based on Foata normal form. 134/6136 useless extension candidates. Maximal degree in co-relation 19819. Up to 3261 conditions per place. [2022-11-23 02:18:30,198 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 156 selfloop transitions, 51 changer transitions 0/213 dead transitions. [2022-11-23 02:18:30,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 213 transitions, 1525 flow [2022-11-23 02:18:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:18:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:18:30,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 907 transitions. [2022-11-23 02:18:30,201 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5182857142857142 [2022-11-23 02:18:30,202 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 907 transitions. [2022-11-23 02:18:30,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 907 transitions. [2022-11-23 02:18:30,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:30,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 907 transitions. [2022-11-23 02:18:30,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:30,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:30,208 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:30,209 INFO L175 Difference]: Start difference. First operand has 78 places, 109 transitions, 650 flow. Second operand 7 states and 907 transitions. [2022-11-23 02:18:30,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 213 transitions, 1525 flow [2022-11-23 02:18:30,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 213 transitions, 1523 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-23 02:18:30,257 INFO L231 Difference]: Finished difference. Result has 86 places, 120 transitions, 840 flow [2022-11-23 02:18:30,257 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=840, PETRI_PLACES=86, PETRI_TRANSITIONS=120} [2022-11-23 02:18:30,258 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 18 predicate places. [2022-11-23 02:18:30,259 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 120 transitions, 840 flow [2022-11-23 02:18:30,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:30,259 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:30,259 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:30,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 02:18:30,260 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:30,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash -232656009, now seen corresponding path program 1 times [2022-11-23 02:18:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:30,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758678242] [2022-11-23 02:18:30,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:30,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758678242] [2022-11-23 02:18:30,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758678242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:30,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:30,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:18:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079823713] [2022-11-23 02:18:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:30,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:18:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:30,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:18:30,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:18:30,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-11-23 02:18:30,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 120 transitions, 840 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:30,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:30,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-11-23 02:18:30,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:31,184 INFO L130 PetriNetUnfolder]: 3189/6040 cut-off events. [2022-11-23 02:18:31,185 INFO L131 PetriNetUnfolder]: For 11476/11609 co-relation queries the response was YES. [2022-11-23 02:18:31,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20960 conditions, 6040 events. 3189/6040 cut-off events. For 11476/11609 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 44550 event pairs, 750 based on Foata normal form. 183/6157 useless extension candidates. Maximal degree in co-relation 20938. Up to 3416 conditions per place. [2022-11-23 02:18:31,242 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 159 selfloop transitions, 53 changer transitions 0/220 dead transitions. [2022-11-23 02:18:31,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 220 transitions, 1726 flow [2022-11-23 02:18:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:18:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:18:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2022-11-23 02:18:31,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5154285714285715 [2022-11-23 02:18:31,246 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2022-11-23 02:18:31,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2022-11-23 02:18:31,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:31,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2022-11-23 02:18:31,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:31,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:31,252 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 250.0) internal successors, (2000), 8 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:31,253 INFO L175 Difference]: Start difference. First operand has 86 places, 120 transitions, 840 flow. Second operand 7 states and 902 transitions. [2022-11-23 02:18:31,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 220 transitions, 1726 flow [2022-11-23 02:18:31,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 220 transitions, 1705 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-23 02:18:31,310 INFO L231 Difference]: Finished difference. Result has 93 places, 131 transitions, 1016 flow [2022-11-23 02:18:31,311 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1016, PETRI_PLACES=93, PETRI_TRANSITIONS=131} [2022-11-23 02:18:31,312 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 25 predicate places. [2022-11-23 02:18:31,312 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 131 transitions, 1016 flow [2022-11-23 02:18:31,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:31,313 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:31,313 INFO L209 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] [2022-11-23 02:18:31,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 02:18:31,313 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:31,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1295315935, now seen corresponding path program 1 times [2022-11-23 02:18:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:31,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767725574] [2022-11-23 02:18:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:18:31,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:18:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:18:31,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:18:31,400 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:18:31,402 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2022-11-23 02:18:31,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2022-11-23 02:18:31,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2022-11-23 02:18:31,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2022-11-23 02:18:31,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2022-11-23 02:18:31,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2022-11-23 02:18:31,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2022-11-23 02:18:31,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2022-11-23 02:18:31,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2022-11-23 02:18:31,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2022-11-23 02:18:31,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2022-11-23 02:18:31,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2022-11-23 02:18:31,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2022-11-23 02:18:31,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2022-11-23 02:18:31,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2022-11-23 02:18:31,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2022-11-23 02:18:31,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2022-11-23 02:18:31,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2022-11-23 02:18:31,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2022-11-23 02:18:31,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2022-11-23 02:18:31,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2022-11-23 02:18:31,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2022-11-23 02:18:31,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2022-11-23 02:18:31,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2022-11-23 02:18:31,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 02:18:31,411 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:31,418 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:18:31,418 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:18:31,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:18:31 BasicIcfg [2022-11-23 02:18:31,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:18:31,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:18:31,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:18:31,494 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:18:31,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:10" (3/4) ... [2022-11-23 02:18:31,497 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 02:18:31,498 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:18:31,498 INFO L158 Benchmark]: Toolchain (without parser) took 21905.82ms. Allocated memory was 153.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 113.2MB in the beginning and 830.8MB in the end (delta: -717.7MB). Peak memory consumption was 649.9MB. Max. memory is 16.1GB. [2022-11-23 02:18:31,499 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 119.5MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:18:31,499 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.29ms. Allocated memory is still 153.1MB. Free memory was 112.6MB in the beginning and 92.9MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-23 02:18:31,499 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.12ms. Allocated memory is still 153.1MB. Free memory was 92.3MB in the beginning and 90.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:18:31,500 INFO L158 Benchmark]: Boogie Preprocessor took 48.00ms. Allocated memory is still 153.1MB. Free memory was 90.1MB in the beginning and 88.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:18:31,500 INFO L158 Benchmark]: RCFGBuilder took 566.94ms. Allocated memory is still 153.1MB. Free memory was 88.7MB in the beginning and 70.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 02:18:31,500 INFO L158 Benchmark]: TraceAbstraction took 20558.12ms. Allocated memory was 153.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 69.8MB in the beginning and 830.8MB in the end (delta: -761.0MB). Peak memory consumption was 605.9MB. Max. memory is 16.1GB. [2022-11-23 02:18:31,501 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 1.5GB. Free memory is still 830.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:18:31,503 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 119.5MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 649.29ms. Allocated memory is still 153.1MB. Free memory was 112.6MB in the beginning and 92.9MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.12ms. Allocated memory is still 153.1MB. Free memory was 92.3MB in the beginning and 90.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.00ms. Allocated memory is still 153.1MB. Free memory was 90.1MB in the beginning and 88.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.94ms. Allocated memory is still 153.1MB. Free memory was 88.7MB in the beginning and 70.7MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20558.12ms. Allocated memory was 153.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 69.8MB in the beginning and 830.8MB in the end (delta: -761.0MB). Peak memory consumption was 605.9MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 1.5GB. Free memory is still 830.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 136 PlacesBefore, 68 PlacesAfterwards, 125 TransitionsBefore, 57 TransitionsAfterwards, 3246 CoEnabledTransitionPairs, 9 FixpointIterations, 39 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 116 TotalNumberOfCompositions, 17532 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9085, independent: 8706, independent conditional: 0, independent unconditional: 8706, dependent: 379, dependent conditional: 0, dependent unconditional: 379, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2403, independent: 2344, independent conditional: 0, independent unconditional: 2344, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2403, independent: 2287, independent conditional: 0, independent unconditional: 2287, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9085, independent: 6362, independent conditional: 0, independent unconditional: 6362, dependent: 320, dependent conditional: 0, dependent unconditional: 320, unknown: 2403, unknown conditional: 0, unknown unconditional: 2403] , Statistics on independence cache: Total cache size (in pairs): 629, Positive cache size: 596, Positive conditional cache size: 0, Positive unconditional cache size: 596, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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={7:0}, t2={6:0}, t3={5:0}, t4={8: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={7:0}, t2={6:0}, t3={5:0}, t4={8: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 [#in~arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [#in~arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [#in~arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [#in~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 [#in~arg={0:0}, arg={0:0}, l=0, lx=0, ly=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={6:0}, t3={5:0}, t4={8:0}, 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={7:0}, t2={6:0}, t3={5:0}, t4={8: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 [#in~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; [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 [#in~arg={0:0}, \result={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 [#in~arg={0:0}, \result={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [#in~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 [#in~arg={0:0}, \result={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, 159 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: 20.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1652 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1155 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2344 IncrementalHoareTripleChecker+Invalid, 2457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 74 mSDtfsCounter, 2344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1016occurred 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 518 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 [2022-11-23 02:18:31,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS --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 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:18:34,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:18:34,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:18:34,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:18:34,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:18:34,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:18:34,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:18:34,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:18:34,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:18:34,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:18:34,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:18:34,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:18:34,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:18:34,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:18:34,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:18:34,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:18:34,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:18:34,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:18:34,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:18:34,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:18:34,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:18:34,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:18:34,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:18:34,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:18:34,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:18:34,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:18:34,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:18:34,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:18:34,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:18:34,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:18:34,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:18:34,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:18:34,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:18:34,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:18:34,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:18:34,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:18:34,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:18:34,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:18:34,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:18:34,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:18:34,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:18:34,308 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-23 02:18:34,350 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:18:34,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:18:34,352 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:18:34,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:18:34,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:18:34,353 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:18:34,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:18:34,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:18:34,355 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:18:34,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:18:34,356 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:18:34,357 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:18:34,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:18:34,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:18:34,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:18:34,357 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:18:34,358 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:18:34,358 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:18:34,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:18:34,358 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:18:34,358 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 02:18:34,359 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 02:18:34,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:18:34,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:18:34,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:18:34,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:18:34,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:18:34,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:18:34,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:18:34,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:18:34,361 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-23 02:18:34,361 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 02:18:34,361 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:18:34,362 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:18:34,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:18:34,362 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-23 02:18:34,362 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS 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 [2022-11-23 02:18:34,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:18:34,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:18:34,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:18:34,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:18:34,808 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:18:34,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-23 02:18:37,850 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:18:38,173 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:18:38,174 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-23 02:18:38,186 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/data/ab62f7540/768e1311dae4440699fcac82d349c0c2/FLAGa8437edd7 [2022-11-23 02:18:38,209 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/data/ab62f7540/768e1311dae4440699fcac82d349c0c2 [2022-11-23 02:18:38,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:18:38,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:18:38,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:18:38,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:18:38,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:18:38,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:38,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d571838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38, skipping insertion in model container [2022-11-23 02:18:38,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:38,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:18:38,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:18:38,520 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-23 02:18:38,688 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-23 02:18:38,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:18:38,724 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:18:38,753 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-23 02:18:38,822 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-23 02:18:38,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:18:38,901 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:18:38,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38 WrapperNode [2022-11-23 02:18:38,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:18:38,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:18:38,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:18:38,903 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:18:38,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:38,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:38,981 INFO L138 Inliner]: procedures = 177, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2022-11-23 02:18:38,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:18:38,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:18:38,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:18:38,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:18:38,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:38,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:39,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:39,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:39,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:39,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:39,035 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:39,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:39,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:18:39,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:18:39,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:18:39,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:18:39,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (1/1) ... [2022-11-23 02:18:39,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:18:39,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:18:39,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:18:39,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:18:39,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-23 02:18:39,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 02:18:39,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:18:39,146 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-23 02:18:39,146 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-23 02:18:39,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 02:18:39,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:18:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 02:18:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 02:18:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 02:18:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:18:39,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:18:39,148 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-23 02:18:39,148 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-23 02:18:39,149 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 02:18:39,322 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:18:39,324 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:18:39,690 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:18:39,768 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:18:39,775 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 02:18:39,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:39 BoogieIcfgContainer [2022-11-23 02:18:39,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:18:39,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:18:39,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:18:39,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:18:39,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:38" (1/3) ... [2022-11-23 02:18:39,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b78cf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:39, skipping insertion in model container [2022-11-23 02:18:39,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:38" (2/3) ... [2022-11-23 02:18:39,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b78cf9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:39, skipping insertion in model container [2022-11-23 02:18:39,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:39" (3/3) ... [2022-11-23 02:18:39,790 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-11-23 02:18:39,808 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:18:39,808 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-23 02:18:39,809 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 02:18:39,939 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-23 02:18:39,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 302 flow [2022-11-23 02:18:40,075 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-23 02:18:40,076 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 02:18:40,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 131 events. 2/131 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/110 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-11-23 02:18:40,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 302 flow [2022-11-23 02:18:40,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 276 flow [2022-11-23 02:18:40,095 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 02:18:40,119 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 276 flow [2022-11-23 02:18:40,124 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 276 flow [2022-11-23 02:18:40,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 276 flow [2022-11-23 02:18:40,179 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-23 02:18:40,180 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-23 02:18:40,183 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 161 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-11-23 02:18:40,186 INFO L119 LiptonReduction]: Number of co-enabled transitions 3246 [2022-11-23 02:18:54,215 INFO L134 LiptonReduction]: Checked pairs total: 17532 [2022-11-23 02:18:54,216 INFO L136 LiptonReduction]: Total number of compositions: 121 [2022-11-23 02:18:54,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:18:54,238 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;@3da00e59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:18:54,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-11-23 02:18:54,241 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-23 02:18:54,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 02:18:54,241 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:54,242 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-23 02:18:54,242 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash 472, now seen corresponding path program 1 times [2022-11-23 02:18:54,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:54,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894090343] [2022-11-23 02:18:54,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:54,268 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 [2022-11-23 02:18:54,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:54,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:18:54,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:18:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:54,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 02:18:54,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:54,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:54,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:54,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894090343] [2022-11-23 02:18:54,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894090343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:54,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:54,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 02:18:54,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014854624] [2022-11-23 02:18:54,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:54,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 02:18:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:54,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 02:18:54,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 02:18:54,419 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 256 [2022-11-23 02:18:54,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 138 flow. Second operand has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:54,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:54,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 256 [2022-11-23 02:18:54,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:55,493 INFO L130 PetriNetUnfolder]: 3680/5888 cut-off events. [2022-11-23 02:18:55,493 INFO L131 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2022-11-23 02:18:55,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11333 conditions, 5888 events. 3680/5888 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 39995 event pairs, 3680 based on Foata normal form. 0/4852 useless extension candidates. Maximal degree in co-relation 8893. Up to 5216 conditions per place. [2022-11-23 02:18:55,540 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 43 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2022-11-23 02:18:55,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 53 transitions, 216 flow [2022-11-23 02:18:55,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 02:18:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-23 02:18:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2022-11-23 02:18:55,560 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.564453125 [2022-11-23 02:18:55,561 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2022-11-23 02:18:55,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2022-11-23 02:18:55,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:55,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2022-11-23 02:18:55,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:55,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:55,580 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:55,583 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 138 flow. Second operand 2 states and 289 transitions. [2022-11-23 02:18:55,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 53 transitions, 216 flow [2022-11-23 02:18:55,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 200 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-23 02:18:55,598 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 114 flow [2022-11-23 02:18:55,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2022-11-23 02:18:55,605 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2022-11-23 02:18:55,608 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 114 flow [2022-11-23 02:18:55,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:55,609 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:55,609 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 02:18:55,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:18:55,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:55,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash 465021, now seen corresponding path program 1 times [2022-11-23 02:18:55,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:55,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101525909] [2022-11-23 02:18:55,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:55,842 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 [2022-11-23 02:18:55,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:55,867 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:18:55,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:18:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:55,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-23 02:18:55,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:56,151 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-23 02:18:56,152 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 [2022-11-23 02:18:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:56,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:56,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:56,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101525909] [2022-11-23 02:18:56,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101525909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:56,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:56,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270231237] [2022-11-23 02:18:56,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:56,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:56,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:56,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:56,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:56,502 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-11-23 02:18:56,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:56,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:56,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-11-23 02:18:56,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:57,284 INFO L130 PetriNetUnfolder]: 3508/5638 cut-off events. [2022-11-23 02:18:57,284 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:57,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10670 conditions, 5638 events. 3508/5638 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 38095 event pairs, 3508 based on Foata normal form. 0/4708 useless extension candidates. Maximal degree in co-relation 10667. Up to 4964 conditions per place. [2022-11-23 02:18:57,322 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 39 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2022-11-23 02:18:57,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 192 flow [2022-11-23 02:18:57,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-11-23 02:18:57,325 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2022-11-23 02:18:57,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-11-23 02:18:57,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-11-23 02:18:57,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:57,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-11-23 02:18:57,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:57,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:57,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:57,333 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 114 flow. Second operand 3 states and 382 transitions. [2022-11-23 02:18:57,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 192 flow [2022-11-23 02:18:57,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:18:57,335 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2022-11-23 02:18:57,335 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, 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} [2022-11-23 02:18:57,336 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2022-11-23 02:18:57,337 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2022-11-23 02:18:57,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:57,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:57,338 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-23 02:18:57,399 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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)] Ended with exit code 0 [2022-11-23 02:18:57,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:57,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:57,584 INFO L85 PathProgramCache]: Analyzing trace with hash 465020, now seen corresponding path program 1 times [2022-11-23 02:18:57,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:57,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375767152] [2022-11-23 02:18:57,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:57,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:57,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:57,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:18:57,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:18:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:57,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 02:18:57,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:57,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:18:57,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:18:57,791 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-23 02:18:57,792 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 3 case distinctions, treesize of input 15 treesize of output 32 [2022-11-23 02:18:57,814 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 14 treesize of output 12 [2022-11-23 02:18:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:57,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:57,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:57,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375767152] [2022-11-23 02:18:57,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375767152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:57,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:57,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:57,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724360568] [2022-11-23 02:18:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:57,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:57,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:57,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:57,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2022-11-23 02:18:57,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:57,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:57,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2022-11-23 02:18:57,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:18:58,731 INFO L130 PetriNetUnfolder]: 3336/5388 cut-off events. [2022-11-23 02:18:58,731 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:18:58,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10173 conditions, 5388 events. 3336/5388 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 36354 event pairs, 3336 based on Foata normal form. 0/4564 useless extension candidates. Maximal degree in co-relation 10169. Up to 4714 conditions per place. [2022-11-23 02:18:58,766 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 37 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-11-23 02:18:58,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 188 flow [2022-11-23 02:18:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:18:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-11-23 02:18:58,768 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5065104166666666 [2022-11-23 02:18:58,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-11-23 02:18:58,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-11-23 02:18:58,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:18:58,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-11-23 02:18:58,770 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) [2022-11-23 02:18:58,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:58,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:58,773 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 389 transitions. [2022-11-23 02:18:58,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 188 flow [2022-11-23 02:18:58,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:18:58,775 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2022-11-23 02:18:58,775 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, 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} [2022-11-23 02:18:58,776 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -11 predicate places. [2022-11-23 02:18:58,776 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2022-11-23 02:18:58,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:58,777 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:18:58,777 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:18:58,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:18:58,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:18:58,988 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:18:58,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:58,989 INFO L85 PathProgramCache]: Analyzing trace with hash 446896481, now seen corresponding path program 1 times [2022-11-23 02:18:58,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:18:58,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435342361] [2022-11-23 02:18:58,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:58,990 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 [2022-11-23 02:18:58,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:18:58,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:18:59,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:18:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:59,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:18:59,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:59,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:18:59,234 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-23 02:18:59,234 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 2 case distinctions, treesize of input 15 treesize of output 38 [2022-11-23 02:18:59,262 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 178 treesize of output 174 [2022-11-23 02:18:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:59,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:18:59,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:18:59,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435342361] [2022-11-23 02:18:59,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435342361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:59,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:59,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:18:59,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718756500] [2022-11-23 02:18:59,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:59,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:59,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:18:59,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:59,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:59,462 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2022-11-23 02:18:59,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 110 flow. Second operand has 3 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) [2022-11-23 02:18:59,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:18:59,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2022-11-23 02:18:59,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:00,208 INFO L130 PetriNetUnfolder]: 3292/5302 cut-off events. [2022-11-23 02:19:00,208 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:19:00,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10013 conditions, 5302 events. 3292/5302 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 35623 event pairs, 3292 based on Foata normal form. 0/4508 useless extension candidates. Maximal degree in co-relation 10009. Up to 4640 conditions per place. [2022-11-23 02:19:00,249 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-11-23 02:19:00,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 180 flow [2022-11-23 02:19:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:19:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:19:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-11-23 02:19:00,252 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.50390625 [2022-11-23 02:19:00,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-11-23 02:19:00,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-11-23 02:19:00,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:00,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-11-23 02:19:00,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:00,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:00,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:00,257 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 387 transitions. [2022-11-23 02:19:00,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 180 flow [2022-11-23 02:19:00,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:19:00,260 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2022-11-23 02:19:00,260 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, 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} [2022-11-23 02:19:00,261 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2022-11-23 02:19:00,261 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2022-11-23 02:19:00,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-11-23 02:19:00,261 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:00,262 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 02:19:00,277 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:00,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:00,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:00,472 INFO L85 PathProgramCache]: Analyzing trace with hash 446896482, now seen corresponding path program 1 times [2022-11-23 02:19:00,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:00,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856706813] [2022-11-23 02:19:00,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:00,481 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 [2022-11-23 02:19:00,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:00,483 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:00,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:00,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 02:19:00,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:00,687 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-23 02:19:00,687 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 [2022-11-23 02:19:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:00,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:00,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:00,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856706813] [2022-11-23 02:19:00,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856706813] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:00,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:00,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:19:00,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073244400] [2022-11-23 02:19:00,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:00,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:19:00,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:00,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:19:00,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:19:00,819 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2022-11-23 02:19:00,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:00,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:00,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2022-11-23 02:19:00,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:01,372 INFO L130 PetriNetUnfolder]: 3248/5216 cut-off events. [2022-11-23 02:19:01,372 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:19:01,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9853 conditions, 5216 events. 3248/5216 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 35148 event pairs, 3248 based on Foata normal form. 0/4452 useless extension candidates. Maximal degree in co-relation 9849. Up to 4566 conditions per place. [2022-11-23 02:19:01,412 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 33 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-23 02:19:01,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 172 flow [2022-11-23 02:19:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:19:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:19:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-11-23 02:19:01,415 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4778645833333333 [2022-11-23 02:19:01,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2022-11-23 02:19:01,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2022-11-23 02:19:01,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:01,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2022-11-23 02:19:01,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:01,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:01,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:01,420 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 367 transitions. [2022-11-23 02:19:01,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 172 flow [2022-11-23 02:19:01,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:19:01,422 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2022-11-23 02:19:01,422 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, 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} [2022-11-23 02:19:01,423 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2022-11-23 02:19:01,423 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2022-11-23 02:19:01,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:01,424 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:01,424 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:01,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:01,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:01,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -29198905, now seen corresponding path program 1 times [2022-11-23 02:19:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:01,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785705241] [2022-11-23 02:19:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:01,637 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 [2022-11-23 02:19:01,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:01,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:01,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:01,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 02:19:01,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:01,862 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-23 02:19:01,862 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 [2022-11-23 02:19:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:01,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:01,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:01,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785705241] [2022-11-23 02:19:01,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785705241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:01,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:01,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:19:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742514342] [2022-11-23 02:19:01,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:01,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:19:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:01,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:19:01,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:19:02,030 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2022-11-23 02:19:02,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 102 flow. Second operand has 3 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) [2022-11-23 02:19:02,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:02,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2022-11-23 02:19:02,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:02,542 INFO L130 PetriNetUnfolder]: 3148/5054 cut-off events. [2022-11-23 02:19:02,542 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:19:02,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9541 conditions, 5054 events. 3148/5054 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 33834 event pairs, 3148 based on Foata normal form. 0/4352 useless extension candidates. Maximal degree in co-relation 9537. Up to 4416 conditions per place. [2022-11-23 02:19:02,576 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 31 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-11-23 02:19:02,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 164 flow [2022-11-23 02:19:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:19:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:19:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-11-23 02:19:02,579 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4986979166666667 [2022-11-23 02:19:02,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2022-11-23 02:19:02,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2022-11-23 02:19:02,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:02,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2022-11-23 02:19:02,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:02,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:02,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:02,584 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 383 transitions. [2022-11-23 02:19:02,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 164 flow [2022-11-23 02:19:02,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:19:02,585 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2022-11-23 02:19:02,585 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, 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} [2022-11-23 02:19:02,586 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -17 predicate places. [2022-11-23 02:19:02,586 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2022-11-23 02:19:02,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-11-23 02:19:02,587 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:02,587 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:02,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:02,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:02,799 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash -29198903, now seen corresponding path program 1 times [2022-11-23 02:19:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:02,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890115596] [2022-11-23 02:19:02,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:02,800 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 [2022-11-23 02:19:02,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:02,802 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:02,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:02,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 02:19:02,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:02,995 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-23 02:19:02,995 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 [2022-11-23 02:19:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:03,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:03,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:03,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890115596] [2022-11-23 02:19:03,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890115596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:03,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:03,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 02:19:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398550532] [2022-11-23 02:19:03,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:03,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:19:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:03,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:19:03,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:19:03,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2022-11-23 02:19:03,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:03,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:03,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2022-11-23 02:19:03,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:03,602 INFO L130 PetriNetUnfolder]: 3048/4892 cut-off events. [2022-11-23 02:19:03,603 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:19:03,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9229 conditions, 4892 events. 3048/4892 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 32631 event pairs, 3048 based on Foata normal form. 0/4252 useless extension candidates. Maximal degree in co-relation 9225. Up to 4266 conditions per place. [2022-11-23 02:19:03,634 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 29 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-11-23 02:19:03,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 156 flow [2022-11-23 02:19:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:19:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:19:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-11-23 02:19:03,636 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47265625 [2022-11-23 02:19:03,637 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2022-11-23 02:19:03,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2022-11-23 02:19:03,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:03,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2022-11-23 02:19:03,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:03,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:03,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:03,641 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 3 states and 363 transitions. [2022-11-23 02:19:03,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 156 flow [2022-11-23 02:19:03,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:19:03,642 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 94 flow [2022-11-23 02:19:03,643 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2022-11-23 02:19:03,643 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -19 predicate places. [2022-11-23 02:19:03,643 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 94 flow [2022-11-23 02:19:03,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:03,644 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:03,644 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:03,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:03,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:03,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:03,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:03,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2004634698, now seen corresponding path program 1 times [2022-11-23 02:19:03,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:03,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143144772] [2022-11-23 02:19:03,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:03,858 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 [2022-11-23 02:19:03,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:03,859 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:03,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:03,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 02:19:03,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:04,077 INFO L321 Elim1Store]: treesize reduction 87, result has 31.5 percent of original size [2022-11-23 02:19:04,077 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 47 [2022-11-23 02:19:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:04,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:04,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:04,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143144772] [2022-11-23 02:19:04,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143144772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:04,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:04,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:19:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152927143] [2022-11-23 02:19:04,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:04,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:19:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:04,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:19:04,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:19:04,595 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 256 [2022-11-23 02:19:04,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:04,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:04,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 256 [2022-11-23 02:19:04,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:05,053 INFO L130 PetriNetUnfolder]: 2388/3863 cut-off events. [2022-11-23 02:19:05,053 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:19:05,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7315 conditions, 3863 events. 2388/3863 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 24865 event pairs, 2388 based on Foata normal form. 0/3469 useless extension candidates. Maximal degree in co-relation 7311. Up to 3381 conditions per place. [2022-11-23 02:19:05,080 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 28 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-11-23 02:19:05,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 152 flow [2022-11-23 02:19:05,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:19:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:19:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-11-23 02:19:05,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4388020833333333 [2022-11-23 02:19:05,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-11-23 02:19:05,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-11-23 02:19:05,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:05,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-11-23 02:19:05,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:05,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:05,087 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:05,087 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 94 flow. Second operand 3 states and 337 transitions. [2022-11-23 02:19:05,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 152 flow [2022-11-23 02:19:05,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:19:05,089 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 92 flow [2022-11-23 02:19:05,090 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-11-23 02:19:05,090 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2022-11-23 02:19:05,091 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 92 flow [2022-11-23 02:19:05,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:05,091 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:05,091 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:05,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:05,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:05,309 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:05,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2004634699, now seen corresponding path program 1 times [2022-11-23 02:19:05,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:05,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912148669] [2022-11-23 02:19:05,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:05,311 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 [2022-11-23 02:19:05,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:05,312 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:05,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:05,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-23 02:19:05,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:05,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:05,563 INFO L321 Elim1Store]: treesize reduction 59, result has 34.4 percent of original size [2022-11-23 02:19:05,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 36 [2022-11-23 02:19:05,580 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 10 treesize of output 8 [2022-11-23 02:19:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:05,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:05,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:05,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912148669] [2022-11-23 02:19:05,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912148669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:05,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:05,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:19:05,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697721169] [2022-11-23 02:19:05,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:05,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:19:05,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:19:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:19:06,232 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2022-11-23 02:19:06,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:06,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:06,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2022-11-23 02:19:06,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:06,660 INFO L130 PetriNetUnfolder]: 1728/2834 cut-off events. [2022-11-23 02:19:06,661 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-23 02:19:06,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5401 conditions, 2834 events. 1728/2834 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 17675 event pairs, 1728 based on Foata normal form. 0/2686 useless extension candidates. Maximal degree in co-relation 5397. Up to 2496 conditions per place. [2022-11-23 02:19:06,680 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 27 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-11-23 02:19:06,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 148 flow [2022-11-23 02:19:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:19:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:19:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2022-11-23 02:19:06,683 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-11-23 02:19:06,683 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2022-11-23 02:19:06,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2022-11-23 02:19:06,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:06,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2022-11-23 02:19:06,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:06,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:06,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:06,687 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 92 flow. Second operand 3 states and 360 transitions. [2022-11-23 02:19:06,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 148 flow [2022-11-23 02:19:06,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:19:06,689 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 90 flow [2022-11-23 02:19:06,690 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2022-11-23 02:19:06,690 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2022-11-23 02:19:06,690 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 90 flow [2022-11-23 02:19:06,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:06,691 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:06,691 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:06,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:06,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:06,903 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:06,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1970799540, now seen corresponding path program 1 times [2022-11-23 02:19:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:06,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374874933] [2022-11-23 02:19:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:06,905 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 [2022-11-23 02:19:06,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:06,906 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:06,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:07,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:19:07,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:07,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:07,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:07,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374874933] [2022-11-23 02:19:07,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374874933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:07,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:07,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:19:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161774105] [2022-11-23 02:19:07,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:07,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:19:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:07,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:19:07,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:19:07,132 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-23 02:19:07,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 90 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:07,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:07,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-23 02:19:07,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:08,321 INFO L130 PetriNetUnfolder]: 6485/9608 cut-off events. [2022-11-23 02:19:08,321 INFO L131 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-11-23 02:19:08,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18765 conditions, 9608 events. 6485/9608 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 54042 event pairs, 2347 based on Foata normal form. 92/9644 useless extension candidates. Maximal degree in co-relation 18761. Up to 6919 conditions per place. [2022-11-23 02:19:08,370 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 109 selfloop transitions, 28 changer transitions 0/141 dead transitions. [2022-11-23 02:19:08,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 141 transitions, 577 flow [2022-11-23 02:19:08,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 02:19:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-23 02:19:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1249 transitions. [2022-11-23 02:19:08,374 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.487890625 [2022-11-23 02:19:08,374 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1249 transitions. [2022-11-23 02:19:08,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1249 transitions. [2022-11-23 02:19:08,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:08,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1249 transitions. [2022-11-23 02:19:08,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.9) internal successors, (1249), 10 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:08,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 256.0) internal successors, (2816), 11 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:08,383 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 256.0) internal successors, (2816), 11 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:08,383 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 90 flow. Second operand 10 states and 1249 transitions. [2022-11-23 02:19:08,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 141 transitions, 577 flow [2022-11-23 02:19:08,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 141 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:19:08,390 INFO L231 Difference]: Finished difference. Result has 58 places, 66 transitions, 235 flow [2022-11-23 02:19:08,391 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=235, PETRI_PLACES=58, PETRI_TRANSITIONS=66} [2022-11-23 02:19:08,392 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2022-11-23 02:19:08,393 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 66 transitions, 235 flow [2022-11-23 02:19:08,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:08,393 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:08,393 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:08,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:08,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:08,610 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:08,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1792499806, now seen corresponding path program 1 times [2022-11-23 02:19:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:08,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854412243] [2022-11-23 02:19:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:08,611 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 [2022-11-23 02:19:08,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:08,612 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:08,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:08,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 02:19:08,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:08,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:08,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:08,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854412243] [2022-11-23 02:19:08,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854412243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:08,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:08,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:19:08,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768985889] [2022-11-23 02:19:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:08,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:19:08,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:08,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:19:08,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:19:08,745 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-11-23 02:19:08,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 66 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:08,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:08,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-11-23 02:19:08,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:09,060 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 26#L752-4true, 309#true, 352#true, 149#true, 71#writerEXITtrue, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,060 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-23 02:19:09,060 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-23 02:19:09,060 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-23 02:19:09,060 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-23 02:19:09,083 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 26#L752-4true, 309#true, 35#L741true, 352#true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,084 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,084 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,084 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,084 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 104#L753-1true, 309#true, 352#true, 149#true, 71#writerEXITtrue, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,091 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,092 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,092 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,092 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,092 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 26#L752-4true, 309#true, 352#true, 149#true, 71#writerEXITtrue, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,092 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,092 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,093 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,093 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:09,120 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 26#L752-4true, 309#true, 80#L714-1true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,120 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-11-23 02:19:09,120 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-23 02:19:09,120 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-23 02:19:09,120 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-23 02:19:09,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 104#L753-1true, 309#true, 35#L741true, 352#true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,125 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,125 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,125 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,125 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,131 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [111#L741true, 26#L752-4true, 309#true, 35#L741true, 352#true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,131 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,131 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,132 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,132 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,139 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 85#L753-2true, 309#true, 35#L741true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,139 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,140 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,140 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,140 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,140 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 85#L753-2true, 309#true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,141 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,141 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,141 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,141 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,142 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 104#L753-1true, 309#true, 352#true, 149#true, 71#writerEXITtrue, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,142 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,142 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,142 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,142 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,143 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 26#L752-4true, 309#true, 352#true, 149#true, 71#writerEXITtrue, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,143 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,143 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,144 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,144 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:09,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 104#L753-1true, 309#true, 80#L714-1true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,164 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,165 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,165 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,165 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,168 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 26#L752-4true, 309#true, 35#L741true, 80#L714-1true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,169 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,169 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,169 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,169 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,170 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 26#L752-4true, 80#L714-1true, 309#true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,170 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,170 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,170 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,171 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:09,174 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [111#L741true, 104#L753-1true, 309#true, 35#L741true, 352#true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,174 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,174 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,174 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,174 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,177 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [113#readerEXITtrue, 26#L752-4true, 309#true, 35#L741true, 352#true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,177 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,177 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,178 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,178 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,184 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [111#L741true, 85#L753-2true, 309#true, 35#L741true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,184 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,184 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,184 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,184 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,185 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 85#L753-2true, 309#true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,185 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,185 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,185 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,185 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,186 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 35#L741true, 21#L754-1true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,186 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,186 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,186 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,186 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,187 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 21#L754-1true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,187 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,187 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,187 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,187 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,188 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 104#L753-1true, 309#true, 352#true, 149#true, 71#writerEXITtrue, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,188 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,188 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,188 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,189 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:09,202 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 104#L753-1true, 309#true, 35#L741true, 80#L714-1true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,202 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,202 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,202 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,202 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,204 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 85#L753-2true, 309#true, 80#L714-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,204 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,205 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,205 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,205 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 104#L753-1true, 80#L714-1true, 309#true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,205 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,206 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,206 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,206 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,208 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [111#L741true, 26#L752-4true, 80#L714-1true, 309#true, 35#L741true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,209 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,209 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,209 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,209 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,210 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 26#L752-4true, 309#true, 80#L714-1true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,210 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,210 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,210 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,211 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-23 02:19:09,213 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [113#readerEXITtrue, 104#L753-1true, 309#true, 35#L741true, 352#true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,213 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,214 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,214 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,214 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,220 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [111#L741true, 309#true, 35#L741true, 21#L754-1true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,220 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,220 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,221 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,221 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,221 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 309#true, 21#L754-1true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,221 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,221 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,222 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,222 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,222 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 85#L753-2true, 309#true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,223 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,223 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,223 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,223 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:09,232 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 85#L753-2true, 309#true, 35#L741true, 80#L714-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,232 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,232 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,233 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,233 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,233 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [111#L741true, 104#L753-1true, 80#L714-1true, 309#true, 35#L741true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,234 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,234 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,234 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,234 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,236 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 85#L753-2true, 80#L714-1true, 309#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,236 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,236 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,236 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,236 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,237 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 80#L714-1true, 309#true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,237 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,237 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,237 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,238 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,238 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 104#L753-1true, 80#L714-1true, 309#true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,238 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,238 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,238 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,239 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,241 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [113#readerEXITtrue, 26#L752-4true, 80#L714-1true, 309#true, 35#L741true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,241 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,241 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,241 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,242 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-23 02:19:09,243 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [113#readerEXITtrue, 85#L753-2true, 309#true, 35#L741true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,244 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,244 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,244 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,244 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,249 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][42], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 309#true, 21#L754-1true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,249 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,249 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,249 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,250 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:09,257 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [111#L741true, 85#L753-2true, 80#L714-1true, 309#true, 35#L741true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,257 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,257 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,258 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 35#L741true, 80#L714-1true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,258 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,259 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,259 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,259 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,259 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [113#readerEXITtrue, 104#L753-1true, 80#L714-1true, 309#true, 35#L741true, 71#writerEXITtrue, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,260 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,260 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,260 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,260 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,262 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 309#true, 80#L714-1true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,262 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,262 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,262 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,262 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,263 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 85#L753-2true, 80#L714-1true, 309#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,263 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,263 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,263 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,263 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-23 02:19:09,269 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][53], [113#readerEXITtrue, 309#true, 35#L741true, 21#L754-1true, 352#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,269 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:09,269 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:09,270 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:09,270 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:09,276 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [111#L741true, 309#true, 35#L741true, 80#L714-1true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,276 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,276 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,277 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,277 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,277 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [113#readerEXITtrue, 85#L753-2true, 80#L714-1true, 309#true, 35#L741true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,277 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,277 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,278 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,278 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,278 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][38], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 80#L714-1true, 309#true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,279 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,279 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,279 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,279 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-23 02:19:09,288 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][44], [113#readerEXITtrue, 35#L741true, 80#L714-1true, 309#true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 363#(= ~w~0 (_ bv1 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:09,288 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2022-11-23 02:19:09,288 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-11-23 02:19:09,288 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-11-23 02:19:09,289 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-11-23 02:19:09,303 INFO L130 PetriNetUnfolder]: 2854/4805 cut-off events. [2022-11-23 02:19:09,303 INFO L131 PetriNetUnfolder]: For 1490/1598 co-relation queries the response was YES. [2022-11-23 02:19:09,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10687 conditions, 4805 events. 2854/4805 cut-off events. For 1490/1598 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 32678 event pairs, 871 based on Foata normal form. 529/5065 useless extension candidates. Maximal degree in co-relation 10679. Up to 1964 conditions per place. [2022-11-23 02:19:09,339 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 48 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2022-11-23 02:19:09,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 399 flow [2022-11-23 02:19:09,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:19:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 02:19:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2022-11-23 02:19:09,341 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2022-11-23 02:19:09,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2022-11-23 02:19:09,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2022-11-23 02:19:09,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:09,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2022-11-23 02:19:09,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:09,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:09,345 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:09,345 INFO L175 Difference]: Start difference. First operand has 58 places, 66 transitions, 235 flow. Second operand 3 states and 404 transitions. [2022-11-23 02:19:09,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 399 flow [2022-11-23 02:19:09,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:19:09,357 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 251 flow [2022-11-23 02:19:09,357 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=58, 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=251, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2022-11-23 02:19:09,358 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2022-11-23 02:19:09,358 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 251 flow [2022-11-23 02:19:09,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:09,359 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:09,359 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:09,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:09,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:09,570 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:09,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2086987866, now seen corresponding path program 2 times [2022-11-23 02:19:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:09,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641478437] [2022-11-23 02:19:09,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:19:09,578 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 [2022-11-23 02:19:09,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:09,578 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:09,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:09,673 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 02:19:09,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:19:09,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:19:09,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:09,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:09,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:09,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641478437] [2022-11-23 02:19:09,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641478437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:09,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:09,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:19:09,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127242594] [2022-11-23 02:19:09,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:09,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 02:19:09,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:09,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 02:19:09,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 02:19:09,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-11-23 02:19:09,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:09,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:09,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-11-23 02:19:09,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:10,083 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [26#L752-4true, 80#L714-1true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 392#(= ~r~0 (_ bv0 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,083 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,084 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,084 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,084 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,084 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [26#L752-4true, 80#L714-1true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,084 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-23 02:19:10,084 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:10,084 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:10,084 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-23 02:19:10,127 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [104#L753-1true, 80#L714-1true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,127 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,128 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,128 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,128 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,128 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [104#L753-1true, 80#L714-1true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,128 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,128 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,129 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,129 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,130 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [111#L741true, 26#L752-4true, 80#L714-1true, 71#writerEXITtrue, 149#true, 363#(= ~w~0 (_ bv1 32)), 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,130 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,130 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,130 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,131 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,131 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [111#L741true, 26#L752-4true, 80#L714-1true, 71#writerEXITtrue, 149#true, 363#(= ~w~0 (_ bv1 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,131 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,131 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,131 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,131 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,142 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 26#L752-4true, 352#true, 387#true, 71#writerEXITtrue, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 126#writerENTRYtrue, Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,143 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,143 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,143 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,143 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-23 02:19:10,168 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [Black: 363#(= ~w~0 (_ bv1 32)), 26#L752-4true, 352#true, 91#L731true, 149#true, 71#writerEXITtrue, 17#writerEXITtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,168 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-23 02:19:10,169 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:10,169 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:10,169 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-23 02:19:10,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [Black: 363#(= ~w~0 (_ bv1 32)), 104#L753-1true, 91#L731true, 352#true, 149#true, 71#writerEXITtrue, 17#writerEXITtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 392#(= ~r~0 (_ bv0 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,169 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,170 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,170 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,170 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,176 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 26#L752-4true, 352#true, 387#true, 149#true, 71#writerEXITtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 126#writerENTRYtrue, Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,176 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,176 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,176 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,177 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,184 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [Black: 363#(= ~w~0 (_ bv1 32)), 26#L752-4true, 352#true, 149#true, 71#writerEXITtrue, 17#writerEXITtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,184 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,184 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,185 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,185 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,185 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [Black: 363#(= ~w~0 (_ bv1 32)), 26#L752-4true, 352#true, 149#true, 71#writerEXITtrue, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,185 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,185 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,186 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,186 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,195 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 85#L753-2true, 309#true, 35#L741true, 80#L714-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,195 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,195 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,196 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,196 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,196 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 85#L753-2true, 309#true, 80#L714-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,196 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,196 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,196 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,197 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,197 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [111#L741true, 104#L753-1true, 80#L714-1true, 71#writerEXITtrue, 149#true, 363#(= ~w~0 (_ bv1 32)), 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,197 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,198 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,198 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,198 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,198 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [111#L741true, 104#L753-1true, 80#L714-1true, 71#writerEXITtrue, 149#true, 363#(= ~w~0 (_ bv1 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,198 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,198 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,199 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,199 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,199 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [113#readerEXITtrue, 26#L752-4true, 80#L714-1true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,200 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,200 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,200 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,200 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,201 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, 26#L752-4true, 80#L714-1true, 387#true, 71#writerEXITtrue, 149#true, 363#(= ~w~0 (_ bv1 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,201 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,201 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,201 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,201 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,208 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 104#L753-1true, 352#true, 387#true, 71#writerEXITtrue, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 126#writerENTRYtrue, Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,208 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,208 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,209 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,209 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-23 02:19:10,228 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [Black: 363#(= ~w~0 (_ bv1 32)), 91#L731true, 352#true, 149#true, 17#writerEXITtrue, 85#L753-2true, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,228 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,228 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,228 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,228 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,232 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 104#L753-1true, 387#true, 352#true, 149#true, 71#writerEXITtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,233 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,233 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,233 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,233 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,238 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, 26#L752-4true, 80#L714-1true, 387#true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,239 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,239 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,239 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,239 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,241 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [113#readerEXITtrue, 26#L752-4true, 80#L714-1true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,241 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,241 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,241 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,241 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,246 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [Black: 363#(= ~w~0 (_ bv1 32)), 104#L753-1true, 352#true, 149#true, 71#writerEXITtrue, 17#writerEXITtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,246 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,246 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,246 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,246 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,247 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [Black: 363#(= ~w~0 (_ bv1 32)), 104#L753-1true, 352#true, 149#true, 71#writerEXITtrue, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,247 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,247 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,247 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,247 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,248 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [111#L741true, Black: 363#(= ~w~0 (_ bv1 32)), 26#L752-4true, 352#true, 149#true, 71#writerEXITtrue, 17#writerEXITtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,248 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,248 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,248 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,248 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,249 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [111#L741true, Black: 363#(= ~w~0 (_ bv1 32)), 26#L752-4true, 352#true, 149#true, 71#writerEXITtrue, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,249 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,249 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,249 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,249 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,258 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [111#L741true, 85#L753-2true, 309#true, 35#L741true, 80#L714-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,258 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,259 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 85#L753-2true, 309#true, 80#L714-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,259 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,259 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,259 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,259 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,260 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 35#L741true, 80#L714-1true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,260 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,260 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,260 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,260 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,260 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 80#L714-1true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,261 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,261 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,261 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,261 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,262 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [113#readerEXITtrue, 104#L753-1true, 80#L714-1true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,262 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,262 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,262 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,262 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,263 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, 104#L753-1true, 80#L714-1true, 387#true, 71#writerEXITtrue, 149#true, 363#(= ~w~0 (_ bv1 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,263 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,263 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,263 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,263 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,267 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 387#true, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 85#L753-2true, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 126#writerENTRYtrue, Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,268 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,268 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,268 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,268 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-23 02:19:10,279 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [Black: 363#(= ~w~0 (_ bv1 32)), 91#L731true, 352#true, 149#true, 17#writerEXITtrue, 309#true, 35#L741true, 21#L754-1true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 392#(= ~r~0 (_ bv0 32)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,279 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,279 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,279 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,279 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,283 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, 104#L753-1true, 80#L714-1true, 387#true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,283 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,283 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,283 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,283 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,285 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 387#true, 149#true, 85#L753-2true, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,285 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,285 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,285 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,285 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,287 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [113#readerEXITtrue, 104#L753-1true, 80#L714-1true, 149#true, 71#writerEXITtrue, 363#(= ~w~0 (_ bv1 32)), 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,287 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,287 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,288 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,288 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,295 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 149#true, 17#writerEXITtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 85#L753-2true, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,296 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,296 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,296 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,296 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,296 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 85#L753-2true, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,296 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,297 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,297 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,297 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,297 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [111#L741true, Black: 363#(= ~w~0 (_ bv1 32)), 104#L753-1true, 352#true, 149#true, 71#writerEXITtrue, 17#writerEXITtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,298 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,298 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,298 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,298 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,298 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [111#L741true, Black: 363#(= ~w~0 (_ bv1 32)), 104#L753-1true, 352#true, 149#true, 71#writerEXITtrue, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,298 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,299 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,299 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,299 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,299 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 26#L752-4true, 352#true, 387#true, 149#true, 71#writerEXITtrue, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,300 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,300 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,300 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,300 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,307 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [111#L741true, 309#true, 35#L741true, 80#L714-1true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,307 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,307 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,307 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,307 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,308 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 111#L741true, 309#true, 80#L714-1true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,308 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,308 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,308 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,308 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,309 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 85#L753-2true, 80#L714-1true, 309#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,309 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,309 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,309 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,309 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,310 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 85#L753-2true, 309#true, 80#L714-1true, 387#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,310 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,310 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,310 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,311 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,314 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 387#true, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 21#L754-1true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 126#writerENTRYtrue, Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,314 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,315 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,315 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,315 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-23 02:19:10,323 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 26#L752-4true, 352#true, 387#true, 149#true, 71#writerEXITtrue, 17#writerEXITtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,324 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,324 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,324 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,324 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,331 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, 85#L753-2true, 80#L714-1true, 309#true, 35#L741true, 387#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,332 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,332 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,332 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,332 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,333 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [113#readerEXITtrue, 85#L753-2true, 309#true, 35#L741true, 80#L714-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,334 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,334 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,334 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,334 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,335 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 387#true, 352#true, 149#true, 309#true, 35#L741true, 21#L754-1true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), 126#writerENTRYtrue, Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,336 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,336 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,336 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,336 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,341 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [111#L741true, Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 149#true, 17#writerEXITtrue, 85#L753-2true, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,342 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,342 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,342 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,342 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,342 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [111#L741true, Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 85#L753-2true, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,343 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,343 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,343 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,343 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,343 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 149#true, 17#writerEXITtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 35#L741true, 21#L754-1true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,344 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,344 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,344 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,344 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,344 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 309#true, 21#L754-1true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,345 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,345 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,345 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,345 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,345 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 104#L753-1true, 387#true, 352#true, 149#true, 71#writerEXITtrue, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,346 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,346 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,346 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,346 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,352 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 80#L714-1true, 309#true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,352 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,352 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,352 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,352 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 113#readerEXITtrue, 309#true, 80#L714-1true, 21#L754-1true, 387#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,353 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,353 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,353 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,353 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-23 02:19:10,358 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 104#L753-1true, 352#true, 387#true, 149#true, 71#writerEXITtrue, 17#writerEXITtrue, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,358 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,359 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,359 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,359 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,377 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, 309#true, 35#L741true, 80#L714-1true, 21#L754-1true, 387#true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,377 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,377 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,377 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,377 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,378 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [113#readerEXITtrue, 80#L714-1true, 309#true, 35#L741true, 21#L754-1true, 149#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 363#(= ~w~0 (_ bv1 32)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,378 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,379 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,379 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,379 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,384 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][85], [111#L741true, Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 149#true, 17#writerEXITtrue, 309#true, 35#L741true, 21#L754-1true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,385 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,385 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,385 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,385 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,385 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [111#L741true, Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 309#true, 21#L754-1true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), 392#(= ~r~0 (_ bv0 32)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,385 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,386 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,386 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,386 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,386 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 387#true, 352#true, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 85#L753-2true, 309#true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,387 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,387 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,387 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,387 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-23 02:19:10,392 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 387#true, 149#true, 17#writerEXITtrue, 85#L753-2true, 309#true, 35#L741true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,392 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,393 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,393 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,393 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,406 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_19| v_~x~0_28) (not (= |v_readerThread1of1ForFork0_~lx~0#1_19| |v_readerThread1of1ForFork0_~ly~0#1_19|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, ~x~0=v_~x~0_28} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_19|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_19|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][76], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 387#true, 352#true, 149#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 17#writerEXITtrue, 309#true, 21#L754-1true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,406 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,406 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,406 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,407 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-23 02:19:10,409 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L737-->L741: Formula: (and (= v_~r~0_71 (bvadd |v_readerThread1of1ForFork0_~l~0#1_33| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_33|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~r~0=v_~r~0_71} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][88], [113#readerEXITtrue, Black: 363#(= ~w~0 (_ bv1 32)), 352#true, 387#true, 149#true, 17#writerEXITtrue, 309#true, 35#L741true, 21#L754-1true, Black: 346#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0)), Black: 340#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0)), Black: 330#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|)), Black: 342#(and (= ~x~0 (_ bv0 32)) (= ~x~0 |readerThread1of1ForFork0_~l~0#1|) (= ~x~0 ~y~0) (= |readerThread1of1ForFork0_~ly~0#1| ~x~0))]) [2022-11-23 02:19:10,409 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-23 02:19:10,409 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-23 02:19:10,409 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-23 02:19:10,410 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-23 02:19:10,438 INFO L130 PetriNetUnfolder]: 3228/5565 cut-off events. [2022-11-23 02:19:10,438 INFO L131 PetriNetUnfolder]: For 4153/4263 co-relation queries the response was YES. [2022-11-23 02:19:10,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14044 conditions, 5565 events. 3228/5565 cut-off events. For 4153/4263 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 40917 event pairs, 865 based on Foata normal form. 168/5173 useless extension candidates. Maximal degree in co-relation 14034. Up to 2637 conditions per place. [2022-11-23 02:19:10,483 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 69 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2022-11-23 02:19:10,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 114 transitions, 562 flow [2022-11-23 02:19:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 02:19:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 02:19:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-11-23 02:19:10,486 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5341796875 [2022-11-23 02:19:10,487 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2022-11-23 02:19:10,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2022-11-23 02:19:10,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:10,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2022-11-23 02:19:10,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:10,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:10,494 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:10,494 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 251 flow. Second operand 4 states and 547 transitions. [2022-11-23 02:19:10,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 114 transitions, 562 flow [2022-11-23 02:19:10,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 114 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-23 02:19:10,510 INFO L231 Difference]: Finished difference. Result has 64 places, 76 transitions, 326 flow [2022-11-23 02:19:10,511 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=64, PETRI_TRANSITIONS=76} [2022-11-23 02:19:10,511 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2022-11-23 02:19:10,511 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 76 transitions, 326 flow [2022-11-23 02:19:10,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:10,512 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:10,512 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:10,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:10,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:10,724 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:10,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1084930096, now seen corresponding path program 1 times [2022-11-23 02:19:10,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:10,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600386916] [2022-11-23 02:19:10,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:10,725 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 [2022-11-23 02:19:10,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:10,726 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:10,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:10,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:19:10,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:10,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:10,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:10,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600386916] [2022-11-23 02:19:10,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600386916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:10,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:10,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:19:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957576154] [2022-11-23 02:19:10,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:10,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:19:10,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:19:10,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:19:10,967 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-23 02:19:10,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 76 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:10,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:10,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-23 02:19:10,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:12,779 INFO L130 PetriNetUnfolder]: 8344/13853 cut-off events. [2022-11-23 02:19:12,779 INFO L131 PetriNetUnfolder]: For 11756/11768 co-relation queries the response was YES. [2022-11-23 02:19:12,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37120 conditions, 13853 events. 8344/13853 cut-off events. For 11756/11768 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 104967 event pairs, 2219 based on Foata normal form. 374/14071 useless extension candidates. Maximal degree in co-relation 37109. Up to 4913 conditions per place. [2022-11-23 02:19:12,846 INFO L137 encePairwiseOnDemand]: 248/256 looper letters, 214 selfloop transitions, 25 changer transitions 0/243 dead transitions. [2022-11-23 02:19:12,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 243 transitions, 1476 flow [2022-11-23 02:19:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:19:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:19:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1176 transitions. [2022-11-23 02:19:12,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2022-11-23 02:19:12,850 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1176 transitions. [2022-11-23 02:19:12,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1176 transitions. [2022-11-23 02:19:12,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:12,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1176 transitions. [2022-11-23 02:19:12,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.66666666666666) internal successors, (1176), 9 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:12,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:12,858 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:12,859 INFO L175 Difference]: Start difference. First operand has 64 places, 76 transitions, 326 flow. Second operand 9 states and 1176 transitions. [2022-11-23 02:19:12,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 243 transitions, 1476 flow [2022-11-23 02:19:12,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 243 transitions, 1460 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-11-23 02:19:12,922 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 434 flow [2022-11-23 02:19:12,923 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2022-11-23 02:19:12,923 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 8 predicate places. [2022-11-23 02:19:12,924 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 434 flow [2022-11-23 02:19:12,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:12,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:12,924 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:12,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:13,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:13,136 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1916084476, now seen corresponding path program 1 times [2022-11-23 02:19:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:13,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582177060] [2022-11-23 02:19:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:13,138 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 [2022-11-23 02:19:13,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:13,139 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:13,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:13,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:19:13,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:13,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:13,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:13,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582177060] [2022-11-23 02:19:13,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582177060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:13,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:13,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:19:13,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779804383] [2022-11-23 02:19:13,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:13,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:19:13,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:13,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:19:13,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:19:13,408 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-23 02:19:13,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:13,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:13,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-23 02:19:13,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:15,974 INFO L130 PetriNetUnfolder]: 16125/26173 cut-off events. [2022-11-23 02:19:15,974 INFO L131 PetriNetUnfolder]: For 39343/40059 co-relation queries the response was YES. [2022-11-23 02:19:16,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77769 conditions, 26173 events. 16125/26173 cut-off events. For 39343/40059 co-relation queries the response was YES. Maximal size of possible extension queue 1541. Compared 209799 event pairs, 3100 based on Foata normal form. 1418/27302 useless extension candidates. Maximal degree in co-relation 77753. Up to 12993 conditions per place. [2022-11-23 02:19:16,124 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 211 selfloop transitions, 87 changer transitions 0/306 dead transitions. [2022-11-23 02:19:16,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 306 transitions, 2133 flow [2022-11-23 02:19:16,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:19:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-23 02:19:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1169 transitions. [2022-11-23 02:19:16,130 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5073784722222222 [2022-11-23 02:19:16,131 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1169 transitions. [2022-11-23 02:19:16,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1169 transitions. [2022-11-23 02:19:16,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:16,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1169 transitions. [2022-11-23 02:19:16,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.88888888888889) internal successors, (1169), 9 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:16,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:16,141 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 256.0) internal successors, (2560), 10 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:16,141 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 434 flow. Second operand 9 states and 1169 transitions. [2022-11-23 02:19:16,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 306 transitions, 2133 flow [2022-11-23 02:19:16,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 306 transitions, 2065 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-23 02:19:16,607 INFO L231 Difference]: Finished difference. Result has 87 places, 159 transitions, 1095 flow [2022-11-23 02:19:16,607 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1095, PETRI_PLACES=87, PETRI_TRANSITIONS=159} [2022-11-23 02:19:16,608 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2022-11-23 02:19:16,608 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 159 transitions, 1095 flow [2022-11-23 02:19:16,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:16,609 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:16,609 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:16,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:16,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:16,815 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:16,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:16,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1221088967, now seen corresponding path program 1 times [2022-11-23 02:19:16,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:16,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766540691] [2022-11-23 02:19:16,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:16,816 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 [2022-11-23 02:19:16,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:16,817 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:16,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:17,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:19:17,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:17,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:17,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766540691] [2022-11-23 02:19:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766540691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:17,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:17,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:19:17,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915566965] [2022-11-23 02:19:17,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:17,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:19:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:17,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:19:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:19:17,114 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-11-23 02:19:17,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 159 transitions, 1095 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:17,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:17,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-11-23 02:19:17,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:17,839 INFO L130 PetriNetUnfolder]: 2320/4893 cut-off events. [2022-11-23 02:19:17,839 INFO L131 PetriNetUnfolder]: For 7018/7301 co-relation queries the response was YES. [2022-11-23 02:19:17,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15388 conditions, 4893 events. 2320/4893 cut-off events. For 7018/7301 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 40832 event pairs, 633 based on Foata normal form. 380/5066 useless extension candidates. Maximal degree in co-relation 15368. Up to 1945 conditions per place. [2022-11-23 02:19:17,864 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 91 selfloop transitions, 13 changer transitions 0/187 dead transitions. [2022-11-23 02:19:17,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 187 transitions, 1286 flow [2022-11-23 02:19:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:19:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-23 02:19:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2022-11-23 02:19:17,867 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-11-23 02:19:17,867 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2022-11-23 02:19:17,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2022-11-23 02:19:17,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:17,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2022-11-23 02:19:17,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:17,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:17,872 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:17,872 INFO L175 Difference]: Start difference. First operand has 87 places, 159 transitions, 1095 flow. Second operand 5 states and 672 transitions. [2022-11-23 02:19:17,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 187 transitions, 1286 flow [2022-11-23 02:19:17,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 187 transitions, 1280 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-23 02:19:17,910 INFO L231 Difference]: Finished difference. Result has 92 places, 133 transitions, 883 flow [2022-11-23 02:19:17,910 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=883, PETRI_PLACES=92, PETRI_TRANSITIONS=133} [2022-11-23 02:19:17,911 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 24 predicate places. [2022-11-23 02:19:17,911 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 133 transitions, 883 flow [2022-11-23 02:19:17,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:17,911 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:17,912 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:17,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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)] Forceful destruction successful, exit code 0 [2022-11-23 02:19:18,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:18,123 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1075638878, now seen corresponding path program 1 times [2022-11-23 02:19:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:18,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890226525] [2022-11-23 02:19:18,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:18,124 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 [2022-11-23 02:19:18,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:18,125 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:18,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:18,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:19:18,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:18,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:18,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:18,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:18,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890226525] [2022-11-23 02:19:18,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890226525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:18,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:18,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:19:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804538401] [2022-11-23 02:19:18,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:18,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:19:18,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:18,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:19:18,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:19:18,393 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-23 02:19:18,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 133 transitions, 883 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:18,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:18,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-23 02:19:18,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:19,561 INFO L130 PetriNetUnfolder]: 3597/6768 cut-off events. [2022-11-23 02:19:19,562 INFO L131 PetriNetUnfolder]: For 11652/11796 co-relation queries the response was YES. [2022-11-23 02:19:19,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23553 conditions, 6768 events. 3597/6768 cut-off events. For 11652/11796 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 50900 event pairs, 1629 based on Foata normal form. 134/6842 useless extension candidates. Maximal degree in co-relation 23531. Up to 5619 conditions per place. [2022-11-23 02:19:19,605 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 148 selfloop transitions, 55 changer transitions 0/210 dead transitions. [2022-11-23 02:19:19,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 210 transitions, 1753 flow [2022-11-23 02:19:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:19:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:19:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 998 transitions. [2022-11-23 02:19:19,610 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4873046875 [2022-11-23 02:19:19,610 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 998 transitions. [2022-11-23 02:19:19,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 998 transitions. [2022-11-23 02:19:19,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:19,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 998 transitions. [2022-11-23 02:19:19,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.75) internal successors, (998), 8 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:19,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:19,619 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:19,619 INFO L175 Difference]: Start difference. First operand has 92 places, 133 transitions, 883 flow. Second operand 8 states and 998 transitions. [2022-11-23 02:19:19,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 210 transitions, 1753 flow [2022-11-23 02:19:19,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 210 transitions, 1690 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-11-23 02:19:19,679 INFO L231 Difference]: Finished difference. Result has 101 places, 144 transitions, 1099 flow [2022-11-23 02:19:19,679 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1099, PETRI_PLACES=101, PETRI_TRANSITIONS=144} [2022-11-23 02:19:19,680 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 33 predicate places. [2022-11-23 02:19:19,680 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 144 transitions, 1099 flow [2022-11-23 02:19:19,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:19,681 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:19,681 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:19,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:19,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:19,893 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:19,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:19,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1240572479, now seen corresponding path program 1 times [2022-11-23 02:19:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:19,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805009247] [2022-11-23 02:19:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:19,894 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 [2022-11-23 02:19:19,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:19,895 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:19,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:20,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:19:20,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:20,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:20,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:20,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805009247] [2022-11-23 02:19:20,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805009247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:20,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:20,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 02:19:20,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241766857] [2022-11-23 02:19:20,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:20,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 02:19:20,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:20,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 02:19:20,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 02:19:20,140 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-23 02:19:20,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 144 transitions, 1099 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:20,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:20,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-23 02:19:20,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:21,334 INFO L130 PetriNetUnfolder]: 3595/6862 cut-off events. [2022-11-23 02:19:21,334 INFO L131 PetriNetUnfolder]: For 14354/14551 co-relation queries the response was YES. [2022-11-23 02:19:21,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24012 conditions, 6862 events. 3595/6862 cut-off events. For 14354/14551 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 52522 event pairs, 960 based on Foata normal form. 217/6975 useless extension candidates. Maximal degree in co-relation 23985. Up to 4128 conditions per place. [2022-11-23 02:19:21,372 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 178 selfloop transitions, 80 changer transitions 0/268 dead transitions. [2022-11-23 02:19:21,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 268 transitions, 2262 flow [2022-11-23 02:19:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:19:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-23 02:19:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 910 transitions. [2022-11-23 02:19:21,375 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2022-11-23 02:19:21,375 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 910 transitions. [2022-11-23 02:19:21,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 910 transitions. [2022-11-23 02:19:21,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:21,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 910 transitions. [2022-11-23 02:19:21,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:21,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:21,381 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:21,381 INFO L175 Difference]: Start difference. First operand has 101 places, 144 transitions, 1099 flow. Second operand 7 states and 910 transitions. [2022-11-23 02:19:21,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 268 transitions, 2262 flow [2022-11-23 02:19:21,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 268 transitions, 2254 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-23 02:19:21,455 INFO L231 Difference]: Finished difference. Result has 111 places, 175 transitions, 1567 flow [2022-11-23 02:19:21,455 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1567, PETRI_PLACES=111, PETRI_TRANSITIONS=175} [2022-11-23 02:19:21,456 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2022-11-23 02:19:21,456 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 175 transitions, 1567 flow [2022-11-23 02:19:21,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:21,457 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:21,457 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:21,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:21,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:21,668 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:21,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash -635553890, now seen corresponding path program 1 times [2022-11-23 02:19:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:21,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208711299] [2022-11-23 02:19:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:21,669 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 [2022-11-23 02:19:21,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:21,671 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:21,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:21,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 02:19:21,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:19:21,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 02:19:21,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-23 02:19:21,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208711299] [2022-11-23 02:19:21,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208711299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:19:21,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:19:21,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:19:21,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441427741] [2022-11-23 02:19:21,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:19:21,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:19:21,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-23 02:19:21,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:19:21,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:19:21,926 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-23 02:19:21,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 175 transitions, 1567 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:21,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 02:19:21,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-23 02:19:21,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 02:19:23,348 INFO L130 PetriNetUnfolder]: 3834/7455 cut-off events. [2022-11-23 02:19:23,348 INFO L131 PetriNetUnfolder]: For 17756/17980 co-relation queries the response was YES. [2022-11-23 02:19:23,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27550 conditions, 7455 events. 3834/7455 cut-off events. For 17756/17980 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 58000 event pairs, 1035 based on Foata normal form. 202/7637 useless extension candidates. Maximal degree in co-relation 27518. Up to 3161 conditions per place. [2022-11-23 02:19:23,403 INFO L137 encePairwiseOnDemand]: 248/256 looper letters, 235 selfloop transitions, 65 changer transitions 0/309 dead transitions. [2022-11-23 02:19:23,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 309 transitions, 2852 flow [2022-11-23 02:19:23,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 02:19:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-23 02:19:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1043 transitions. [2022-11-23 02:19:23,407 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.50927734375 [2022-11-23 02:19:23,408 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1043 transitions. [2022-11-23 02:19:23,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1043 transitions. [2022-11-23 02:19:23,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:19:23,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1043 transitions. [2022-11-23 02:19:23,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.375) internal successors, (1043), 8 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:23,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:23,415 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 256.0) internal successors, (2304), 9 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:23,415 INFO L175 Difference]: Start difference. First operand has 111 places, 175 transitions, 1567 flow. Second operand 8 states and 1043 transitions. [2022-11-23 02:19:23,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 309 transitions, 2852 flow [2022-11-23 02:19:23,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 309 transitions, 2852 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-23 02:19:23,504 INFO L231 Difference]: Finished difference. Result has 122 places, 184 transitions, 1797 flow [2022-11-23 02:19:23,504 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=1567, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1797, PETRI_PLACES=122, PETRI_TRANSITIONS=184} [2022-11-23 02:19:23,504 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 54 predicate places. [2022-11-23 02:19:23,505 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 184 transitions, 1797 flow [2022-11-23 02:19:23,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:23,505 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 02:19:23,505 INFO L209 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] [2022-11-23 02:19:23,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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)] Ended with exit code 0 [2022-11-23 02:19:23,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:23,717 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2022-11-23 02:19:23,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:23,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1464843596, now seen corresponding path program 1 times [2022-11-23 02:19:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-23 02:19:23,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455503520] [2022-11-23 02:19:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:23,718 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 [2022-11-23 02:19:23,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat [2022-11-23 02:19:23,719 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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) [2022-11-23 02:19:23,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:19:23,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:19:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:19:23,984 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-23 02:19:23,985 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 02:19:23,986 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2022-11-23 02:19:23,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2022-11-23 02:19:23,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2022-11-23 02:19:23,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2022-11-23 02:19:23,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2022-11-23 02:19:23,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2022-11-23 02:19:23,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2022-11-23 02:19:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2022-11-23 02:19:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2022-11-23 02:19:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2022-11-23 02:19:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2022-11-23 02:19:23,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2022-11-23 02:19:23,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2022-11-23 02:19:23,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2022-11-23 02:19:23,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2022-11-23 02:19:23,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2022-11-23 02:19:23,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2022-11-23 02:19:23,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2022-11-23 02:19:23,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2022-11-23 02:19:23,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2022-11-23 02:19:23,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2022-11-23 02:19:23,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2022-11-23 02:19:23,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2022-11-23 02:19:23,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2022-11-23 02:19:24,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -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 [2022-11-23 02:19:24,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-23 02:19:24,201 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:24,207 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 02:19:24,207 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 02:19:24,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:19:24 BasicIcfg [2022-11-23 02:19:24,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 02:19:24,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 02:19:24,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 02:19:24,258 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 02:19:24,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:39" (3/4) ... [2022-11-23 02:19:24,278 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 02:19:24,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 02:19:24,279 INFO L158 Benchmark]: Toolchain (without parser) took 46059.10ms. Allocated memory was 71.3MB in the beginning and 2.1GB in the end (delta: 2.1GB). Free memory was 48.2MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 533.1MB. Max. memory is 16.1GB. [2022-11-23 02:19:24,279 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 71.3MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:19:24,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.85ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 47.9MB in the beginning and 62.4MB in the end (delta: -14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 02:19:24,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.21ms. Allocated memory is still 90.2MB. Free memory was 62.4MB in the beginning and 60.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:19:24,280 INFO L158 Benchmark]: Boogie Preprocessor took 65.02ms. Allocated memory is still 90.2MB. Free memory was 59.9MB in the beginning and 58.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 02:19:24,280 INFO L158 Benchmark]: RCFGBuilder took 729.05ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 66.9MB in the end (delta: -8.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2022-11-23 02:19:24,281 INFO L158 Benchmark]: TraceAbstraction took 44476.49ms. Allocated memory was 90.2MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 65.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 529.5MB. Max. memory is 16.1GB. [2022-11-23 02:19:24,281 INFO L158 Benchmark]: Witness Printer took 20.83ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 02:19:24,283 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.38ms. Allocated memory is still 71.3MB. Free memory was 48.5MB in the beginning and 48.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 678.85ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 47.9MB in the beginning and 62.4MB in the end (delta: -14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.21ms. Allocated memory is still 90.2MB. Free memory was 62.4MB in the beginning and 60.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.02ms. Allocated memory is still 90.2MB. Free memory was 59.9MB in the beginning and 58.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 729.05ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 66.9MB in the end (delta: -8.7MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 44476.49ms. Allocated memory was 90.2MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 65.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 529.5MB. Max. memory is 16.1GB. * Witness Printer took 20.83ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.6GB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.1s, 137 PlacesBefore, 68 PlacesAfterwards, 126 TransitionsBefore, 57 TransitionsAfterwards, 3246 CoEnabledTransitionPairs, 9 FixpointIterations, 44 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 121 TotalNumberOfCompositions, 17532 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8491, independent: 8112, independent conditional: 0, independent unconditional: 8112, dependent: 379, dependent conditional: 0, dependent unconditional: 379, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2361, independent: 2304, independent conditional: 0, independent unconditional: 2304, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2361, independent: 2248, independent conditional: 0, independent unconditional: 2248, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 113, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 327, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8491, independent: 5808, independent conditional: 0, independent unconditional: 5808, dependent: 322, dependent conditional: 0, dependent unconditional: 322, unknown: 2361, unknown conditional: 0, unknown unconditional: 2361] , Statistics on independence cache: Total cache size (in pairs): 593, Positive cache size: 560, Positive conditional cache size: 0, Positive unconditional cache size: 560, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, 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={134217731:0}, t2={134217735:0}, t3={134217729:0}, t4={-2013265917: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={134217731:0}, t2={134217735:0}, t3={134217729:0}, t4={-2013265917: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 [#in~arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [#in~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={134217731:0}, t2={134217735:0}, t3={134217729:0}, t4={-2013265917: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={134217731:0}, t2={134217735:0}, t3={134217729:0}, t4={-2013265917:0}, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [#in~arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [#in~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 [#in~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 [#in~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; [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 [#in~arg={0:0}, \result={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 [#in~arg={0:0}, \result={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [#in~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 [#in~arg={0:0}, \result={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, 160 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: 44.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2066 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1474 mSDsluCounter, 332 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3348 IncrementalHoareTripleChecker+Invalid, 3490 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 141 mSDtfsCounter, 3348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1797occurred 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.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 154 ConstructedInterpolants, 14 QuantifiedInterpolants, 794 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1554 ConjunctsInSsa, 111 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 [2022-11-23 02:19:24,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_255897ce-68af-4bbf-9eb7-0f535344640d/bin/uautomizer-QkZJyEgLgS/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