./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 38b53e6a 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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 15:36:26,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:36:26,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:36:26,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:36:26,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:36:26,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:36:26,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:36:26,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:36:26,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:36:26,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:36:26,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:36:26,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:36:26,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:36:26,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:36:26,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:36:26,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:36:26,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:36:26,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:36:26,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:36:26,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:36:26,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:36:26,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:36:26,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:36:26,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:36:26,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:36:26,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:36:26,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:36:26,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:36:26,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:36:26,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:36:26,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:36:26,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:36:26,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:36:26,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:36:26,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:36:26,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:36:26,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:36:26,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:36:26,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:36:26,900 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:36:26,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:36:26,902 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 15:36:26,951 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:36:26,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:36:26,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:36:26,954 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:36:26,955 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:36:26,955 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:36:26,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:36:26,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:36:26,957 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:36:26,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:36:26,959 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:36:26,959 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:36:26,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:36:26,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:36:26,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:36:26,961 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:36:26,961 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:36:26,961 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:36:26,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:36:26,962 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:36:26,962 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:36:26,963 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:36:26,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:36:26,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:36:26,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:36:26,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:36:26,965 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:36:26,965 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:36:26,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:36:26,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:36:26,966 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:36:26,967 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:36:26,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:36:26,968 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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R 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-25 15:36:27,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:36:27,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:36:27,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:36:27,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:36:27,420 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:36:27,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-25 15:36:30,997 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:36:31,356 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:36:31,357 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-25 15:36:31,373 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/data/e6a8d13bf/0021b11174714a32a95dc41e88b4ee4a/FLAGc55c620cf [2022-11-25 15:36:31,392 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/data/e6a8d13bf/0021b11174714a32a95dc41e88b4ee4a [2022-11-25 15:36:31,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:36:31,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:36:31,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:36:31,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:36:31,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:36:31,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:36:31" (1/1) ... [2022-11-25 15:36:31,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d4cf98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:31, skipping insertion in model container [2022-11-25 15:36:31,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:36:31" (1/1) ... [2022-11-25 15:36:31,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:36:31,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:36:31,696 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 15:36:31,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:31,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:31,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:31,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:31,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:31,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:31,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:31,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:31,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:31,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:31,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:31,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:31,980 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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-25 15:36:31,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:31,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:31,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:31,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:32,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:36:32,024 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:36:32,052 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 15:36:32,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:32,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:32,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:32,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:32,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:32,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:32,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:32,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:32,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:32,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:32,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:32,109 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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-25 15:36:32,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:32,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:32,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:36:32,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:36:32,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:36:32,175 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:36:32,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32 WrapperNode [2022-11-25 15:36:32,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:36:32,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:36:32,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:36:32,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:36:32,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,233 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-11-25 15:36:32,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:36:32,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:36:32,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:36:32,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:36:32,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,270 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:36:32,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:36:32,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:36:32,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:36:32,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (1/1) ... [2022-11-25 15:36:32,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:36:32,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:36:32,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:36:32,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:36:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:36:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:36:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:36:32,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:36:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-25 15:36:32,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-25 15:36:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:36:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:36:32,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:36:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:36:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:36:32,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:36:32,360 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-25 15:36:32,360 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-25 15:36:32,362 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:36:32,515 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:36:32,518 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:36:32,968 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:36:33,063 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:36:33,066 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:36:33,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:36:33 BoogieIcfgContainer [2022-11-25 15:36:33,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:36:33,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:36:33,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:36:33,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:36:33,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:36:31" (1/3) ... [2022-11-25 15:36:33,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182a3a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:36:33, skipping insertion in model container [2022-11-25 15:36:33,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:36:32" (2/3) ... [2022-11-25 15:36:33,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182a3a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:36:33, skipping insertion in model container [2022-11-25 15:36:33,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:36:33" (3/3) ... [2022-11-25 15:36:33,086 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-11-25 15:36:33,112 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:36:33,112 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-25 15:36:33,113 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:36:33,259 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-25 15:36:33,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 300 flow [2022-11-25 15:36:33,441 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-11-25 15:36:33,445 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 15:36:33,453 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-25 15:36:33,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 300 flow [2022-11-25 15:36:33,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 274 flow [2022-11-25 15:36:33,469 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:36:33,513 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 274 flow [2022-11-25 15:36:33,517 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 274 flow [2022-11-25 15:36:33,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 274 flow [2022-11-25 15:36:33,577 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-11-25 15:36:33,578 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 15:36:33,581 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-25 15:36:33,586 INFO L119 LiptonReduction]: Number of co-enabled transitions 3246 [2022-11-25 15:36:39,962 INFO L134 LiptonReduction]: Checked pairs total: 17532 [2022-11-25 15:36:39,963 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-11-25 15:36:39,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:36:40,005 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;@5a7a3372, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:36:40,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-11-25 15:36:40,013 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 15:36:40,013 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:36:40,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:40,015 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:36:40,015 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-25 15:36:40,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash 466, now seen corresponding path program 1 times [2022-11-25 15:36:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:40,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496933228] [2022-11-25 15:36:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:40,198 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-25 15:36:40,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:40,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496933228] [2022-11-25 15:36:40,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496933228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:40,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:40,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:36:40,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689613319] [2022-11-25 15:36:40,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:40,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:36:40,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:40,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:36:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:36:40,253 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 250 [2022-11-25 15:36:40,257 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-25 15:36:40,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:40,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 250 [2022-11-25 15:36:40,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:41,185 INFO L130 PetriNetUnfolder]: 3680/5888 cut-off events. [2022-11-25 15:36:41,185 INFO L131 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2022-11-25 15:36:41,205 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-25 15:36:41,250 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 43 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2022-11-25 15:36:41,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 53 transitions, 216 flow [2022-11-25 15:36:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:36:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:36:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-11-25 15:36:41,282 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.574 [2022-11-25 15:36:41,283 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-11-25 15:36:41,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-11-25 15:36:41,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:41,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-11-25 15:36:41,297 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-25 15:36:41,308 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-25 15:36:41,309 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-25 15:36:41,311 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 138 flow. Second operand 2 states and 287 transitions. [2022-11-25 15:36:41,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 53 transitions, 216 flow [2022-11-25 15:36:41,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 200 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-25 15:36:41,330 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 114 flow [2022-11-25 15:36:41,333 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-25 15:36:41,340 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2022-11-25 15:36:41,341 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 114 flow [2022-11-25 15:36:41,341 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-25 15:36:41,341 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:41,342 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:36:41,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:36:41,342 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-25 15:36:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash 457269, now seen corresponding path program 1 times [2022-11-25 15:36:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:41,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280646094] [2022-11-25 15:36:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:41,808 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-25 15:36:41,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:41,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280646094] [2022-11-25 15:36:41,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280646094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:41,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:41,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:36:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763954989] [2022-11-25 15:36:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:41,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:41,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:41,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:41,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:41,976 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2022-11-25 15:36:41,977 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-25 15:36:41,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:41,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2022-11-25 15:36:41,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:42,813 INFO L130 PetriNetUnfolder]: 3508/5638 cut-off events. [2022-11-25 15:36:42,814 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:36:42,827 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-25 15:36:42,867 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 39 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2022-11-25 15:36:42,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 192 flow [2022-11-25 15:36:42,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2022-11-25 15:36:42,872 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2022-11-25 15:36:42,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2022-11-25 15:36:42,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2022-11-25 15:36:42,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:42,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2022-11-25 15:36:42,875 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-25 15:36:42,880 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-25 15:36:42,881 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-25 15:36:42,881 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 114 flow. Second operand 3 states and 370 transitions. [2022-11-25 15:36:42,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 192 flow [2022-11-25 15:36:42,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:36:42,884 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2022-11-25 15:36:42,884 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-25 15:36:42,885 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2022-11-25 15:36:42,886 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2022-11-25 15:36:42,887 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-25 15:36:42,887 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:42,887 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:36:42,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:36:42,888 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-25 15:36:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 457270, now seen corresponding path program 1 times [2022-11-25 15:36:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:42,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108342665] [2022-11-25 15:36:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:42,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:43,176 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-25 15:36:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:43,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108342665] [2022-11-25 15:36:43,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108342665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:43,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:43,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:36:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748676205] [2022-11-25 15:36:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:43,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:43,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:43,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:43,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:43,246 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 250 [2022-11-25 15:36:43,246 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-25 15:36:43,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:43,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 250 [2022-11-25 15:36:43,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:43,959 INFO L130 PetriNetUnfolder]: 3336/5388 cut-off events. [2022-11-25 15:36:43,959 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:36:43,973 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-25 15:36:44,006 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 37 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-11-25 15:36:44,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 188 flow [2022-11-25 15:36:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2022-11-25 15:36:44,009 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5146666666666667 [2022-11-25 15:36:44,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2022-11-25 15:36:44,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2022-11-25 15:36:44,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:44,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2022-11-25 15:36:44,011 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-25 15:36:44,013 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-25 15:36:44,014 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-25 15:36:44,014 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 386 transitions. [2022-11-25 15:36:44,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 188 flow [2022-11-25 15:36:44,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:44,016 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2022-11-25 15:36:44,016 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-25 15:36:44,017 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -11 predicate places. [2022-11-25 15:36:44,017 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2022-11-25 15:36:44,018 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-25 15:36:44,018 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:44,018 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:36:44,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:36:44,018 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-25 15:36:44,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash 439444824, now seen corresponding path program 1 times [2022-11-25 15:36:44,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:44,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107360596] [2022-11-25 15:36:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:44,269 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-25 15:36:44,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:44,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107360596] [2022-11-25 15:36:44,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107360596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:44,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:44,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:36:44,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607087408] [2022-11-25 15:36:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:44,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:44,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:44,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2022-11-25 15:36:44,365 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-25 15:36:44,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:44,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2022-11-25 15:36:44,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:45,064 INFO L130 PetriNetUnfolder]: 3292/5302 cut-off events. [2022-11-25 15:36:45,065 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:36:45,078 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-25 15:36:45,161 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-11-25 15:36:45,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 180 flow [2022-11-25 15:36:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:45,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-11-25 15:36:45,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.488 [2022-11-25 15:36:45,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-11-25 15:36:45,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-11-25 15:36:45,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:45,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-11-25 15:36:45,165 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-25 15:36:45,167 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-25 15:36:45,167 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-25 15:36:45,167 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 366 transitions. [2022-11-25 15:36:45,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 180 flow [2022-11-25 15:36:45,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:45,169 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2022-11-25 15:36:45,169 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-25 15:36:45,170 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2022-11-25 15:36:45,170 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2022-11-25 15:36:45,171 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-25 15:36:45,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:45,171 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:36:45,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:36:45,171 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-25 15:36:45,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:45,172 INFO L85 PathProgramCache]: Analyzing trace with hash 439444825, now seen corresponding path program 1 times [2022-11-25 15:36:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:45,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746530797] [2022-11-25 15:36:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:45,362 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-25 15:36:45,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:45,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746530797] [2022-11-25 15:36:45,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746530797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:45,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:45,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:36:45,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802896660] [2022-11-25 15:36:45,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:45,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:45,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:45,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:45,433 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 250 [2022-11-25 15:36:45,434 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-25 15:36:45,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:45,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 250 [2022-11-25 15:36:45,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:46,050 INFO L130 PetriNetUnfolder]: 3248/5216 cut-off events. [2022-11-25 15:36:46,051 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:36:46,064 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-25 15:36:46,092 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 33 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-25 15:36:46,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 172 flow [2022-11-25 15:36:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-11-25 15:36:46,094 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5093333333333333 [2022-11-25 15:36:46,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-11-25 15:36:46,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-11-25 15:36:46,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:46,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-11-25 15:36:46,096 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-25 15:36:46,098 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-25 15:36:46,099 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-25 15:36:46,099 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 382 transitions. [2022-11-25 15:36:46,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 172 flow [2022-11-25 15:36:46,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:46,102 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2022-11-25 15:36:46,103 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-25 15:36:46,105 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2022-11-25 15:36:46,105 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2022-11-25 15:36:46,106 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-25 15:36:46,106 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:46,106 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:46,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:36:46,107 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-25 15:36:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1399693237, now seen corresponding path program 1 times [2022-11-25 15:36:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:46,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29314671] [2022-11-25 15:36:46,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:46,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:46,171 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-25 15:36:46,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:46,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29314671] [2022-11-25 15:36:46,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29314671] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:46,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:46,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:36:46,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594245510] [2022-11-25 15:36:46,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:46,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:46,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:46,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:46,254 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 250 [2022-11-25 15:36:46,255 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-25 15:36:46,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:46,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 250 [2022-11-25 15:36:46,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:46,830 INFO L130 PetriNetUnfolder]: 3148/5054 cut-off events. [2022-11-25 15:36:46,831 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:36:46,842 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-25 15:36:46,874 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 31 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-11-25 15:36:46,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 164 flow [2022-11-25 15:36:46,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:46,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2022-11-25 15:36:46,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4826666666666667 [2022-11-25 15:36:46,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2022-11-25 15:36:46,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2022-11-25 15:36:46,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:46,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2022-11-25 15:36:46,879 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-25 15:36:46,882 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-25 15:36:46,882 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-25 15:36:46,883 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 362 transitions. [2022-11-25 15:36:46,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 164 flow [2022-11-25 15:36:46,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:46,885 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2022-11-25 15:36:46,886 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-25 15:36:46,887 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -17 predicate places. [2022-11-25 15:36:46,887 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2022-11-25 15:36:46,888 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-25 15:36:46,888 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:46,888 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:46,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:36:46,889 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-25 15:36:46,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1399693238, now seen corresponding path program 1 times [2022-11-25 15:36:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:46,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095999184] [2022-11-25 15:36:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:46,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:46,988 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-25 15:36:46,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:46,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095999184] [2022-11-25 15:36:46,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095999184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:46,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:46,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:36:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33077274] [2022-11-25 15:36:46,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:46,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:46,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:46,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:46,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:47,059 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 250 [2022-11-25 15:36:47,060 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-25 15:36:47,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:47,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 250 [2022-11-25 15:36:47,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:47,694 INFO L130 PetriNetUnfolder]: 3048/4892 cut-off events. [2022-11-25 15:36:47,694 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:36:47,703 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-25 15:36:47,724 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 29 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-11-25 15:36:47,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 156 flow [2022-11-25 15:36:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2022-11-25 15:36:47,726 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.504 [2022-11-25 15:36:47,726 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2022-11-25 15:36:47,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2022-11-25 15:36:47,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:47,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2022-11-25 15:36:47,728 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-25 15:36:47,730 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-25 15:36:47,730 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-25 15:36:47,730 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 3 states and 378 transitions. [2022-11-25 15:36:47,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 156 flow [2022-11-25 15:36:47,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:47,732 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 94 flow [2022-11-25 15:36:47,732 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-25 15:36:47,733 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -19 predicate places. [2022-11-25 15:36:47,733 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 94 flow [2022-11-25 15:36:47,733 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-25 15:36:47,733 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:47,733 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:47,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:36:47,734 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-25 15:36:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 780446453, now seen corresponding path program 1 times [2022-11-25 15:36:47,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:47,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709113557] [2022-11-25 15:36:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:47,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:48,083 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-25 15:36:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:48,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709113557] [2022-11-25 15:36:48,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709113557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:48,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:48,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:36:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206533203] [2022-11-25 15:36:48,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:48,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:36:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:36:48,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:36:48,214 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 250 [2022-11-25 15:36:48,215 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-25 15:36:48,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:48,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 250 [2022-11-25 15:36:48,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:48,621 INFO L130 PetriNetUnfolder]: 2388/3863 cut-off events. [2022-11-25 15:36:48,621 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:36:48,632 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-25 15:36:48,653 INFO L137 encePairwiseOnDemand]: 247/250 looper letters, 28 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-11-25 15:36:48,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 152 flow [2022-11-25 15:36:48,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2022-11-25 15:36:48,656 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2022-11-25 15:36:48,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2022-11-25 15:36:48,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2022-11-25 15:36:48,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:48,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2022-11-25 15:36:48,658 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-25 15:36:48,660 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-25 15:36:48,661 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-25 15:36:48,661 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 94 flow. Second operand 3 states and 355 transitions. [2022-11-25 15:36:48,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 152 flow [2022-11-25 15:36:48,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:48,664 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 92 flow [2022-11-25 15:36:48,664 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-25 15:36:48,667 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2022-11-25 15:36:48,667 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 92 flow [2022-11-25 15:36:48,667 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-25 15:36:48,667 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:48,668 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:48,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:36:48,668 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-25 15:36:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash 780446454, now seen corresponding path program 1 times [2022-11-25 15:36:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:48,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901389229] [2022-11-25 15:36:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:48,868 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-25 15:36:48,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:48,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901389229] [2022-11-25 15:36:48,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901389229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:48,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:48,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:36:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044097596] [2022-11-25 15:36:48,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:48,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:36:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:48,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:36:48,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:36:49,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 250 [2022-11-25 15:36:49,058 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-25 15:36:49,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:49,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 250 [2022-11-25 15:36:49,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:49,394 INFO L130 PetriNetUnfolder]: 1728/2834 cut-off events. [2022-11-25 15:36:49,394 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:36:49,402 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-25 15:36:49,416 INFO L137 encePairwiseOnDemand]: 247/250 looper letters, 27 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-11-25 15:36:49,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 148 flow [2022-11-25 15:36:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-11-25 15:36:49,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.428 [2022-11-25 15:36:49,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-11-25 15:36:49,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-11-25 15:36:49,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:49,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-11-25 15:36:49,421 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-25 15:36:49,423 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-25 15:36:49,423 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-25 15:36:49,423 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 92 flow. Second operand 3 states and 321 transitions. [2022-11-25 15:36:49,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 148 flow [2022-11-25 15:36:49,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:49,425 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 90 flow [2022-11-25 15:36:49,425 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-25 15:36:49,427 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2022-11-25 15:36:49,427 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 90 flow [2022-11-25 15:36:49,430 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-25 15:36:49,430 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:49,430 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:49,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:36:49,432 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-25 15:36:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:49,433 INFO L85 PathProgramCache]: Analyzing trace with hash 744774827, now seen corresponding path program 1 times [2022-11-25 15:36:49,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:49,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365839455] [2022-11-25 15:36:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:49,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:49,522 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-25 15:36:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:49,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365839455] [2022-11-25 15:36:49,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365839455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:49,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:49,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:36:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797282166] [2022-11-25 15:36:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:49,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:36:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:49,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:36:49,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:36:49,574 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-11-25 15:36:49,575 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-25 15:36:49,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:49,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-11-25 15:36:49,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:51,375 INFO L130 PetriNetUnfolder]: 11095/16758 cut-off events. [2022-11-25 15:36:51,375 INFO L131 PetriNetUnfolder]: For 419/419 co-relation queries the response was YES. [2022-11-25 15:36:51,413 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-25 15:36:51,510 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 142 selfloop transitions, 26 changer transitions 0/172 dead transitions. [2022-11-25 15:36:51,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 172 transitions, 719 flow [2022-11-25 15:36:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:36:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:36:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1160 transitions. [2022-11-25 15:36:51,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5155555555555555 [2022-11-25 15:36:51,516 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1160 transitions. [2022-11-25 15:36:51,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1160 transitions. [2022-11-25 15:36:51,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:51,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1160 transitions. [2022-11-25 15:36:51,521 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-25 15:36:51,526 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-25 15:36:51,527 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-25 15:36:51,528 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 90 flow. Second operand 9 states and 1160 transitions. [2022-11-25 15:36:51,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 172 transitions, 719 flow [2022-11-25 15:36:51,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 172 transitions, 711 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:51,533 INFO L231 Difference]: Finished difference. Result has 57 places, 64 transitions, 227 flow [2022-11-25 15:36:51,533 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-25 15:36:51,534 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -11 predicate places. [2022-11-25 15:36:51,534 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 64 transitions, 227 flow [2022-11-25 15:36:51,535 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-25 15:36:51,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:51,535 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:51,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:36:51,536 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-25 15:36:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash 942261340, now seen corresponding path program 1 times [2022-11-25 15:36:51,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:51,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508695437] [2022-11-25 15:36:51,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:51,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:51,623 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-25 15:36:51,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:51,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508695437] [2022-11-25 15:36:51,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508695437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:51,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:51,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:36:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470357943] [2022-11-25 15:36:51,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:51,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:36:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:36:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:36:51,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 250 [2022-11-25 15:36:51,633 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-25 15:36:51,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:51,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 250 [2022-11-25 15:36:51,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:52,893 INFO L130 PetriNetUnfolder]: 4871/8150 cut-off events. [2022-11-25 15:36:52,894 INFO L131 PetriNetUnfolder]: For 2444/2674 co-relation queries the response was YES. [2022-11-25 15:36:52,930 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-25 15:36:52,969 INFO L137 encePairwiseOnDemand]: 244/250 looper letters, 48 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2022-11-25 15:36:52,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 391 flow [2022-11-25 15:36:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:36:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:36:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2022-11-25 15:36:52,972 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5346666666666666 [2022-11-25 15:36:52,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2022-11-25 15:36:52,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2022-11-25 15:36:52,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:52,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2022-11-25 15:36:52,975 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-25 15:36:52,977 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-25 15:36:52,978 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-25 15:36:52,978 INFO L175 Difference]: Start difference. First operand has 57 places, 64 transitions, 227 flow. Second operand 3 states and 401 transitions. [2022-11-25 15:36:52,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 391 flow [2022-11-25 15:36:53,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 391 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:36:53,002 INFO L231 Difference]: Finished difference. Result has 60 places, 64 transitions, 243 flow [2022-11-25 15:36:53,002 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-25 15:36:53,003 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -8 predicate places. [2022-11-25 15:36:53,003 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 64 transitions, 243 flow [2022-11-25 15:36:53,003 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-25 15:36:53,004 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:53,004 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:53,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:36:53,004 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-25 15:36:53,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:53,006 INFO L85 PathProgramCache]: Analyzing trace with hash 759357656, now seen corresponding path program 2 times [2022-11-25 15:36:53,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:53,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242024448] [2022-11-25 15:36:53,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:53,118 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-25 15:36:53,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:53,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242024448] [2022-11-25 15:36:53,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242024448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:53,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:53,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:36:53,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547828873] [2022-11-25 15:36:53,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:53,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:36:53,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:36:53,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:36:53,136 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 250 [2022-11-25 15:36:53,137 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-25 15:36:53,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:53,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 250 [2022-11-25 15:36:53,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:53,734 INFO L130 PetriNetUnfolder]: 1767/3696 cut-off events. [2022-11-25 15:36:53,734 INFO L131 PetriNetUnfolder]: For 2906/2997 co-relation queries the response was YES. [2022-11-25 15:36:53,750 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-25 15:36:53,766 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 71 selfloop transitions, 9 changer transitions 0/112 dead transitions. [2022-11-25 15:36:53,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 112 transitions, 556 flow [2022-11-25 15:36:53,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:36:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:36:53,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2022-11-25 15:36:53,769 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.543 [2022-11-25 15:36:53,769 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2022-11-25 15:36:53,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2022-11-25 15:36:53,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:53,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2022-11-25 15:36:53,772 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-25 15:36:53,774 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-25 15:36:53,775 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-25 15:36:53,775 INFO L175 Difference]: Start difference. First operand has 60 places, 64 transitions, 243 flow. Second operand 4 states and 543 transitions. [2022-11-25 15:36:53,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 112 transitions, 556 flow [2022-11-25 15:36:53,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 112 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:36:53,787 INFO L231 Difference]: Finished difference. Result has 64 places, 72 transitions, 309 flow [2022-11-25 15:36:53,788 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-25 15:36:53,789 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2022-11-25 15:36:53,789 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 72 transitions, 309 flow [2022-11-25 15:36:53,789 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-25 15:36:53,790 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:53,790 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:53,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:36:53,790 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-25 15:36:53,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1226107087, now seen corresponding path program 1 times [2022-11-25 15:36:53,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:53,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327116344] [2022-11-25 15:36:53,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:53,863 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-25 15:36:53,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:53,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327116344] [2022-11-25 15:36:53,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327116344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:53,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:53,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:36:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306125563] [2022-11-25 15:36:53,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:53,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:36:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:53,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:36:53,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:36:53,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-11-25 15:36:53,914 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-25 15:36:53,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:53,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-11-25 15:36:53,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:54,859 INFO L130 PetriNetUnfolder]: 3273/6109 cut-off events. [2022-11-25 15:36:54,860 INFO L131 PetriNetUnfolder]: For 5673/5847 co-relation queries the response was YES. [2022-11-25 15:36:54,888 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-25 15:36:54,914 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 175 selfloop transitions, 47 changer transitions 0/228 dead transitions. [2022-11-25 15:36:54,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 228 transitions, 1411 flow [2022-11-25 15:36:54,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:36:54,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:36:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1153 transitions. [2022-11-25 15:36:54,919 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5124444444444445 [2022-11-25 15:36:54,920 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1153 transitions. [2022-11-25 15:36:54,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1153 transitions. [2022-11-25 15:36:54,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:54,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1153 transitions. [2022-11-25 15:36:54,924 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-25 15:36:54,929 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-25 15:36:54,931 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-25 15:36:54,931 INFO L175 Difference]: Start difference. First operand has 64 places, 72 transitions, 309 flow. Second operand 9 states and 1153 transitions. [2022-11-25 15:36:54,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 228 transitions, 1411 flow [2022-11-25 15:36:54,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 228 transitions, 1411 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:36:54,956 INFO L231 Difference]: Finished difference. Result has 78 places, 109 transitions, 650 flow [2022-11-25 15:36:54,956 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-25 15:36:54,958 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2022-11-25 15:36:54,958 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 109 transitions, 650 flow [2022-11-25 15:36:54,959 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-25 15:36:54,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:54,959 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:54,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:36:54,960 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-25 15:36:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1822399055, now seen corresponding path program 1 times [2022-11-25 15:36:54,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:54,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944893440] [2022-11-25 15:36:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:55,032 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-25 15:36:55,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:55,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944893440] [2022-11-25 15:36:55,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944893440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:55,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:55,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:36:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584676965] [2022-11-25 15:36:55,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:55,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:36:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:55,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:36:55,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:36:55,081 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-11-25 15:36:55,083 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-25 15:36:55,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:55,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-11-25 15:36:55,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:56,029 INFO L130 PetriNetUnfolder]: 3179/6029 cut-off events. [2022-11-25 15:36:56,029 INFO L131 PetriNetUnfolder]: For 8699/8787 co-relation queries the response was YES. [2022-11-25 15:36:56,069 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-25 15:36:56,094 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 156 selfloop transitions, 51 changer transitions 0/213 dead transitions. [2022-11-25 15:36:56,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 213 transitions, 1525 flow [2022-11-25 15:36:56,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:36:56,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:36:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 907 transitions. [2022-11-25 15:36:56,098 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5182857142857142 [2022-11-25 15:36:56,098 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 907 transitions. [2022-11-25 15:36:56,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 907 transitions. [2022-11-25 15:36:56,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:56,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 907 transitions. [2022-11-25 15:36:56,102 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-25 15:36:56,105 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-25 15:36:56,106 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-25 15:36:56,107 INFO L175 Difference]: Start difference. First operand has 78 places, 109 transitions, 650 flow. Second operand 7 states and 907 transitions. [2022-11-25 15:36:56,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 213 transitions, 1525 flow [2022-11-25 15:36:56,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 213 transitions, 1523 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-25 15:36:56,159 INFO L231 Difference]: Finished difference. Result has 86 places, 120 transitions, 840 flow [2022-11-25 15:36:56,160 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-25 15:36:56,160 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 18 predicate places. [2022-11-25 15:36:56,161 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 120 transitions, 840 flow [2022-11-25 15:36:56,161 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-25 15:36:56,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:56,161 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:56,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:36:56,162 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-25 15:36:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:56,162 INFO L85 PathProgramCache]: Analyzing trace with hash -232656009, now seen corresponding path program 1 times [2022-11-25 15:36:56,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:56,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649943231] [2022-11-25 15:36:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:56,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:36:56,240 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-25 15:36:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:36:56,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649943231] [2022-11-25 15:36:56,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649943231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:36:56,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:36:56,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:36:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887039235] [2022-11-25 15:36:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:36:56,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:36:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:36:56,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:36:56,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:36:56,305 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 250 [2022-11-25 15:36:56,306 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-25 15:36:56,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:36:56,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 250 [2022-11-25 15:36:56,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:36:57,361 INFO L130 PetriNetUnfolder]: 3189/6040 cut-off events. [2022-11-25 15:36:57,361 INFO L131 PetriNetUnfolder]: For 11476/11609 co-relation queries the response was YES. [2022-11-25 15:36:57,382 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-25 15:36:57,407 INFO L137 encePairwiseOnDemand]: 241/250 looper letters, 159 selfloop transitions, 53 changer transitions 0/220 dead transitions. [2022-11-25 15:36:57,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 220 transitions, 1726 flow [2022-11-25 15:36:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:36:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:36:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2022-11-25 15:36:57,411 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5154285714285715 [2022-11-25 15:36:57,411 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2022-11-25 15:36:57,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2022-11-25 15:36:57,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:36:57,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2022-11-25 15:36:57,415 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-25 15:36:57,419 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-25 15:36:57,420 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-25 15:36:57,421 INFO L175 Difference]: Start difference. First operand has 86 places, 120 transitions, 840 flow. Second operand 7 states and 902 transitions. [2022-11-25 15:36:57,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 220 transitions, 1726 flow [2022-11-25 15:36:57,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 220 transitions, 1705 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:36:57,481 INFO L231 Difference]: Finished difference. Result has 93 places, 131 transitions, 1016 flow [2022-11-25 15:36:57,481 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-25 15:36:57,482 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 25 predicate places. [2022-11-25 15:36:57,482 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 131 transitions, 1016 flow [2022-11-25 15:36:57,483 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-25 15:36:57,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:36:57,483 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-25 15:36:57,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:36:57,484 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-25 15:36:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:36:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1295315935, now seen corresponding path program 1 times [2022-11-25 15:36:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:36:57,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518387266] [2022-11-25 15:36:57,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:36:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:36:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:57,528 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:36:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:36:57,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:36:57,595 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:36:57,598 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2022-11-25 15:36:57,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2022-11-25 15:36:57,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2022-11-25 15:36:57,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2022-11-25 15:36:57,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2022-11-25 15:36:57,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2022-11-25 15:36:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2022-11-25 15:36:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2022-11-25 15:36:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2022-11-25 15:36:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2022-11-25 15:36:57,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2022-11-25 15:36:57,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2022-11-25 15:36:57,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2022-11-25 15:36:57,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2022-11-25 15:36:57,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2022-11-25 15:36:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2022-11-25 15:36:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2022-11-25 15:36:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2022-11-25 15:36:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2022-11-25 15:36:57,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2022-11-25 15:36:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2022-11-25 15:36:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2022-11-25 15:36:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2022-11-25 15:36:57,609 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2022-11-25 15:36:57,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:36:57,610 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:36:57,618 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:36:57,618 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:36:57,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:36:57 BasicIcfg [2022-11-25 15:36:57,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:36:57,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:36:57,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:36:57,708 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:36:57,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:36:33" (3/4) ... [2022-11-25 15:36:57,712 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:36:57,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:36:57,713 INFO L158 Benchmark]: Toolchain (without parser) took 26315.93ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 830.5MB). Free memory was 126.5MB in the beginning and 724.1MB in the end (delta: -597.5MB). Peak memory consumption was 235.0MB. Max. memory is 16.1GB. [2022-11-25 15:36:57,714 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 142.6MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:36:57,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.88ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 105.1MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-25 15:36:57,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.58ms. Allocated memory is still 174.1MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:36:57,715 INFO L158 Benchmark]: Boogie Preprocessor took 41.16ms. Allocated memory is still 174.1MB. Free memory was 102.4MB in the beginning and 100.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:36:57,715 INFO L158 Benchmark]: RCFGBuilder took 799.01ms. Allocated memory is still 174.1MB. Free memory was 100.9MB in the beginning and 142.6MB in the end (delta: -41.8MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-11-25 15:36:57,716 INFO L158 Benchmark]: TraceAbstraction took 24629.71ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 830.5MB). Free memory was 141.6MB in the beginning and 724.1MB in the end (delta: -582.5MB). Peak memory consumption was 246.8MB. Max. memory is 16.1GB. [2022-11-25 15:36:57,716 INFO L158 Benchmark]: Witness Printer took 5.02ms. Allocated memory is still 1.0GB. Free memory is still 724.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:36:57,718 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.34ms. Allocated memory is still 142.6MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.88ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 105.1MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.58ms. Allocated memory is still 174.1MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.16ms. Allocated memory is still 174.1MB. Free memory was 102.4MB in the beginning and 100.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 799.01ms. Allocated memory is still 174.1MB. Free memory was 100.9MB in the beginning and 142.6MB in the end (delta: -41.8MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24629.71ms. Allocated memory was 174.1MB in the beginning and 1.0GB in the end (delta: 830.5MB). Free memory was 141.6MB in the beginning and 724.1MB in the end (delta: -582.5MB). Peak memory consumption was 246.8MB. Max. memory is 16.1GB. * Witness Printer took 5.02ms. Allocated memory is still 1.0GB. Free memory is still 724.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.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: 214, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 145, dependent conditional: 0, dependent unconditional: 145, 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 [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [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 [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 [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] 4 reach_error() VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 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: 24.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1652 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1155 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 2.2s 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.1s 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s 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-25 15:36:57,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R --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-38b53e6 [2022-11-25 15:37:00,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:37:00,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:37:00,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:37:00,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:37:00,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:37:00,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:37:00,674 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:37:00,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:37:00,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:37:00,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:37:00,687 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:37:00,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:37:00,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:37:00,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:37:00,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:37:00,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:37:00,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:37:00,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:37:00,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:37:00,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:37:00,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:37:00,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:37:00,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:37:00,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:37:00,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:37:00,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:37:00,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:37:00,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:37:00,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:37:00,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:37:00,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:37:00,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:37:00,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:37:00,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:37:00,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:37:00,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:37:00,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:37:00,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:37:00,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:37:00,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:37:00,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 15:37:00,790 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:37:00,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:37:00,795 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:37:00,795 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:37:00,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:37:00,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:37:00,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:37:00,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:37:00,799 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:37:00,799 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:37:00,800 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:37:00,801 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:37:00,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:37:00,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:37:00,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:37:00,802 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:37:00,802 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:37:00,802 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:37:00,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:37:00,803 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:37:00,803 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 15:37:00,804 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 15:37:00,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:37:00,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:37:00,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:37:00,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:37:00,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:37:00,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:37:00,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:37:00,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:37:00,806 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 15:37:00,806 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 15:37:00,807 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:37:00,807 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:37:00,808 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:37:00,808 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 15:37:00,808 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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R 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-25 15:37:01,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:37:01,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:37:01,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:37:01,262 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:37:01,262 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:37:01,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-25 15:37:04,960 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:37:05,406 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:37:05,409 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-11-25 15:37:05,443 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/data/dd954848a/e3349057ff66430497e51c68a3e6a2ac/FLAGb9457ef8a [2022-11-25 15:37:05,468 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/data/dd954848a/e3349057ff66430497e51c68a3e6a2ac [2022-11-25 15:37:05,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:37:05,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:37:05,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:37:05,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:37:05,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:37:05,485 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:37:05" (1/1) ... [2022-11-25 15:37:05,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bbd5bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:05, skipping insertion in model container [2022-11-25 15:37:05,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:37:05" (1/1) ... [2022-11-25 15:37:05,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:37:05,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:37:05,790 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 15:37:05,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:05,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:05,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:05,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:05,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:05,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:05,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:05,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:05,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:05,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:05,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:05,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:05,988 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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-25 15:37:05,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:05,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:05,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:05,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:06,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:37:06,039 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:37:06,072 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 15:37:06,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:06,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:06,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:06,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:06,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:06,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:06,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:06,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:06,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:06,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:06,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:06,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:06,135 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_f06adb74-9ec1-4714-9aad-edb9fd596c9b/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-11-25 15:37:06,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:06,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:06,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:37:06,137 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:37:06,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:37:06,193 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:37:06,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06 WrapperNode [2022-11-25 15:37:06,194 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:37:06,195 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:37:06,195 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:37:06,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:37:06,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,297 INFO L138 Inliner]: procedures = 177, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2022-11-25 15:37:06,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:37:06,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:37:06,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:37:06,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:37:06,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,354 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:37:06,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:37:06,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:37:06,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:37:06,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (1/1) ... [2022-11-25 15:37:06,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:37:06,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:37:06,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:37:06,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:37:06,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 15:37:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:37:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:37:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-11-25 15:37:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-11-25 15:37:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:37:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:37:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 15:37:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 15:37:06,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:37:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:37:06,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:37:06,476 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-11-25 15:37:06,476 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-11-25 15:37:06,478 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:37:06,655 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:37:06,657 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:37:07,180 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:37:07,268 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:37:07,272 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:37:07,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:07 BoogieIcfgContainer [2022-11-25 15:37:07,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:37:07,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:37:07,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:37:07,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:37:07,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:37:05" (1/3) ... [2022-11-25 15:37:07,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289b0457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:37:07, skipping insertion in model container [2022-11-25 15:37:07,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:37:06" (2/3) ... [2022-11-25 15:37:07,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@289b0457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:37:07, skipping insertion in model container [2022-11-25 15:37:07,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:07" (3/3) ... [2022-11-25 15:37:07,287 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-11-25 15:37:07,339 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:37:07,339 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-25 15:37:07,339 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:37:07,525 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-25 15:37:07,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 302 flow [2022-11-25 15:37:07,708 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-25 15:37:07,709 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 15:37:07,716 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-25 15:37:07,716 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 135 transitions, 302 flow [2022-11-25 15:37:07,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 276 flow [2022-11-25 15:37:07,735 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:37:07,763 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 276 flow [2022-11-25 15:37:07,777 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 276 flow [2022-11-25 15:37:07,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 276 flow [2022-11-25 15:37:07,839 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-25 15:37:07,842 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 15:37:07,847 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-25 15:37:07,850 INFO L119 LiptonReduction]: Number of co-enabled transitions 3246 [2022-11-25 15:37:23,651 INFO L134 LiptonReduction]: Checked pairs total: 17532 [2022-11-25 15:37:23,652 INFO L136 LiptonReduction]: Total number of compositions: 121 [2022-11-25 15:37:23,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:37:23,679 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;@636213ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:37:23,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-11-25 15:37:23,685 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 15:37:23,686 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:37:23,686 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:23,687 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:37:23,688 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-25 15:37:23,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:23,697 INFO L85 PathProgramCache]: Analyzing trace with hash 472, now seen corresponding path program 1 times [2022-11-25 15:37:23,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:23,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104502818] [2022-11-25 15:37:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:23,714 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-25 15:37:23,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:23,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:23,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:23,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 15:37:23,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:23,856 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-25 15:37:23,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:23,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104502818] [2022-11-25 15:37:23,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104502818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:23,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:23,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:37:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322816263] [2022-11-25 15:37:23,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:23,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:37:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:23,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:37:23,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:37:23,914 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 256 [2022-11-25 15:37:23,919 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-25 15:37:23,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:23,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 256 [2022-11-25 15:37:23,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:25,289 INFO L130 PetriNetUnfolder]: 3680/5888 cut-off events. [2022-11-25 15:37:25,289 INFO L131 PetriNetUnfolder]: For 273/273 co-relation queries the response was YES. [2022-11-25 15:37:25,311 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-25 15:37:25,362 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 43 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2022-11-25 15:37:25,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 53 transitions, 216 flow [2022-11-25 15:37:25,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:37:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:37:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2022-11-25 15:37:25,397 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.564453125 [2022-11-25 15:37:25,410 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2022-11-25 15:37:25,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2022-11-25 15:37:25,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:25,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2022-11-25 15:37:25,421 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-25 15:37:25,428 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-25 15:37:25,429 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-25 15:37:25,432 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 138 flow. Second operand 2 states and 289 transitions. [2022-11-25 15:37:25,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 53 transitions, 216 flow [2022-11-25 15:37:25,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 53 transitions, 200 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-25 15:37:25,453 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 114 flow [2022-11-25 15:37:25,456 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-25 15:37:25,461 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2022-11-25 15:37:25,461 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 114 flow [2022-11-25 15:37:25,462 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-25 15:37:25,462 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:25,462 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:37:25,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Ended with exit code 0 [2022-11-25 15:37:25,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:25,676 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-25 15:37:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash 465021, now seen corresponding path program 1 times [2022-11-25 15:37:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:25,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057743021] [2022-11-25 15:37:25,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:25,678 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-25 15:37:25,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:25,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:25,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:25,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 15:37:25,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:26,013 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-25 15:37:26,014 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-25 15:37:26,179 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-25 15:37:26,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:26,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:26,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057743021] [2022-11-25 15:37:26,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057743021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:26,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:26,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:37:26,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965928067] [2022-11-25 15:37:26,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:26,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:37:26,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:26,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:37:26,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:37:26,434 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2022-11-25 15:37:26,435 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-25 15:37:26,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:26,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2022-11-25 15:37:26,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:27,718 INFO L130 PetriNetUnfolder]: 3508/5638 cut-off events. [2022-11-25 15:37:27,719 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:37:27,769 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-25 15:37:27,819 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 39 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2022-11-25 15:37:27,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 51 transitions, 192 flow [2022-11-25 15:37:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2022-11-25 15:37:27,827 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4973958333333333 [2022-11-25 15:37:27,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2022-11-25 15:37:27,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2022-11-25 15:37:27,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:27,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2022-11-25 15:37:27,835 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-25 15:37:27,840 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-25 15:37:27,841 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-25 15:37:27,841 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 114 flow. Second operand 3 states and 382 transitions. [2022-11-25 15:37:27,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 51 transitions, 192 flow [2022-11-25 15:37:27,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:37:27,844 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2022-11-25 15:37:27,844 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-25 15:37:27,846 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -9 predicate places. [2022-11-25 15:37:27,846 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2022-11-25 15:37:27,847 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-25 15:37:27,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:27,847 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 15:37:27,870 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:28,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:28,061 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-25 15:37:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:28,062 INFO L85 PathProgramCache]: Analyzing trace with hash 465020, now seen corresponding path program 1 times [2022-11-25 15:37:28,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:28,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487515373] [2022-11-25 15:37:28,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:28,063 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-25 15:37:28,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:28,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:28,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:28,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:37:28,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:28,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:28,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:28,325 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2022-11-25 15:37:28,325 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-25 15:37:28,355 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-25 15:37:28,422 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-25 15:37:28,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:28,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:28,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487515373] [2022-11-25 15:37:28,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487515373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:28,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:28,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:37:28,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387435107] [2022-11-25 15:37:28,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:28,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:37:28,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:37:28,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:37:28,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2022-11-25 15:37:28,595 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-25 15:37:28,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:28,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2022-11-25 15:37:28,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:29,521 INFO L130 PetriNetUnfolder]: 3336/5388 cut-off events. [2022-11-25 15:37:29,522 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:37:29,533 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-25 15:37:29,565 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 37 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-11-25 15:37:29,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 188 flow [2022-11-25 15:37:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-11-25 15:37:29,569 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5065104166666666 [2022-11-25 15:37:29,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-11-25 15:37:29,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-11-25 15:37:29,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:29,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-11-25 15:37:29,571 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-25 15:37:29,573 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-25 15:37:29,574 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-25 15:37:29,575 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 389 transitions. [2022-11-25 15:37:29,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 188 flow [2022-11-25 15:37:29,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:29,577 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2022-11-25 15:37:29,578 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-25 15:37:29,579 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -11 predicate places. [2022-11-25 15:37:29,579 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2022-11-25 15:37:29,579 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-25 15:37:29,580 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:29,580 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:37:29,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:29,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:29,795 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-25 15:37:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:29,795 INFO L85 PathProgramCache]: Analyzing trace with hash 446896481, now seen corresponding path program 1 times [2022-11-25 15:37:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:29,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217992637] [2022-11-25 15:37:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:29,796 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-25 15:37:29,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:29,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:29,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:29,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:37:29,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:29,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:30,097 INFO L321 Elim1Store]: treesize reduction 62, result has 31.1 percent of original size [2022-11-25 15:37:30,097 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-25 15:37:30,137 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-25 15:37:30,208 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-25 15:37:30,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:30,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:30,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217992637] [2022-11-25 15:37:30,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217992637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:30,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:30,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:37:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049516053] [2022-11-25 15:37:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:30,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:37:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:30,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:37:30,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:37:30,360 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2022-11-25 15:37:30,361 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-25 15:37:30,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:30,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2022-11-25 15:37:30,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:31,072 INFO L130 PetriNetUnfolder]: 3292/5302 cut-off events. [2022-11-25 15:37:31,073 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:37:31,084 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-25 15:37:31,112 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2022-11-25 15:37:31,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 180 flow [2022-11-25 15:37:31,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2022-11-25 15:37:31,115 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.50390625 [2022-11-25 15:37:31,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2022-11-25 15:37:31,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2022-11-25 15:37:31,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:31,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2022-11-25 15:37:31,122 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-25 15:37:31,124 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-25 15:37:31,125 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-25 15:37:31,125 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 387 transitions. [2022-11-25 15:37:31,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 180 flow [2022-11-25 15:37:31,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:31,127 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2022-11-25 15:37:31,128 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-25 15:37:31,130 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -13 predicate places. [2022-11-25 15:37:31,130 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2022-11-25 15:37:31,131 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-25 15:37:31,131 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:31,132 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:37:31,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Ended with exit code 0 [2022-11-25 15:37:31,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:31,355 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-25 15:37:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash 446896482, now seen corresponding path program 1 times [2022-11-25 15:37:31,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:31,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697233795] [2022-11-25 15:37:31,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:31,357 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-25 15:37:31,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:31,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:31,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:31,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 15:37:31,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:31,559 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2022-11-25 15:37:31,560 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-25 15:37:31,604 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-25 15:37:31,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:31,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:31,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697233795] [2022-11-25 15:37:31,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697233795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:31,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:31,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:37:31,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393073632] [2022-11-25 15:37:31,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:31,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:37:31,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:31,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:37:31,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:37:31,726 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2022-11-25 15:37:31,726 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-25 15:37:31,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:31,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2022-11-25 15:37:31,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:32,423 INFO L130 PetriNetUnfolder]: 3248/5216 cut-off events. [2022-11-25 15:37:32,424 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:37:32,436 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-25 15:37:32,466 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 33 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-25 15:37:32,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 172 flow [2022-11-25 15:37:32,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-11-25 15:37:32,469 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4778645833333333 [2022-11-25 15:37:32,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2022-11-25 15:37:32,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2022-11-25 15:37:32,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:32,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2022-11-25 15:37:32,472 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-25 15:37:32,474 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-25 15:37:32,475 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-25 15:37:32,476 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 367 transitions. [2022-11-25 15:37:32,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 172 flow [2022-11-25 15:37:32,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:32,478 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2022-11-25 15:37:32,478 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-25 15:37:32,479 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -15 predicate places. [2022-11-25 15:37:32,480 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2022-11-25 15:37:32,480 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-25 15:37:32,480 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:32,481 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:32,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:32,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:32,695 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-25 15:37:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash -29198905, now seen corresponding path program 1 times [2022-11-25 15:37:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:32,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365617754] [2022-11-25 15:37:32,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:32,697 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-25 15:37:32,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:32,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:32,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:32,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:37:32,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:32,962 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-25 15:37:32,962 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-25 15:37:33,055 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-25 15:37:33,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:33,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:33,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365617754] [2022-11-25 15:37:33,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365617754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:33,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:33,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:37:33,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616532679] [2022-11-25 15:37:33,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:33,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:37:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:37:33,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:37:33,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 256 [2022-11-25 15:37:33,211 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-25 15:37:33,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:33,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 256 [2022-11-25 15:37:33,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:34,013 INFO L130 PetriNetUnfolder]: 3148/5054 cut-off events. [2022-11-25 15:37:34,014 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:37:34,030 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-25 15:37:34,065 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 31 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-11-25 15:37:34,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 164 flow [2022-11-25 15:37:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-11-25 15:37:34,069 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4986979166666667 [2022-11-25 15:37:34,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2022-11-25 15:37:34,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2022-11-25 15:37:34,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:34,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2022-11-25 15:37:34,072 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-25 15:37:34,074 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-25 15:37:34,075 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-25 15:37:34,076 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 383 transitions. [2022-11-25 15:37:34,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 164 flow [2022-11-25 15:37:34,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:34,079 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2022-11-25 15:37:34,080 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-25 15:37:34,083 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -17 predicate places. [2022-11-25 15:37:34,083 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2022-11-25 15:37:34,084 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-25 15:37:34,084 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:34,084 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:34,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:34,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:34,298 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-25 15:37:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash -29198903, now seen corresponding path program 1 times [2022-11-25 15:37:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:34,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842670447] [2022-11-25 15:37:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:34,299 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-25 15:37:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:34,307 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:34,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:34,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 15:37:34,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:34,556 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2022-11-25 15:37:34,557 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-25 15:37:34,594 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-25 15:37:34,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:34,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:34,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842670447] [2022-11-25 15:37:34,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842670447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:34,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:34,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:37:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038870624] [2022-11-25 15:37:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:34,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:37:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:34,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:37:34,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:37:34,714 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2022-11-25 15:37:34,715 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-25 15:37:34,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:34,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2022-11-25 15:37:34,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:35,287 INFO L130 PetriNetUnfolder]: 3048/4892 cut-off events. [2022-11-25 15:37:35,287 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:37:35,300 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-25 15:37:35,326 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 29 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-11-25 15:37:35,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 156 flow [2022-11-25 15:37:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-11-25 15:37:35,329 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47265625 [2022-11-25 15:37:35,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2022-11-25 15:37:35,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2022-11-25 15:37:35,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:35,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2022-11-25 15:37:35,331 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-25 15:37:35,333 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-25 15:37:35,333 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-25 15:37:35,334 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 3 states and 363 transitions. [2022-11-25 15:37:35,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 156 flow [2022-11-25 15:37:35,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:35,336 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 94 flow [2022-11-25 15:37:35,336 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-25 15:37:35,337 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -19 predicate places. [2022-11-25 15:37:35,337 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 94 flow [2022-11-25 15:37:35,337 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-25 15:37:35,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:35,338 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:35,352 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:35,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:35,552 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-25 15:37:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2004634698, now seen corresponding path program 1 times [2022-11-25 15:37:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:35,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373640307] [2022-11-25 15:37:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:35,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:35,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:35,558 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:35,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:35,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 15:37:35,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:35,824 INFO L321 Elim1Store]: treesize reduction 87, result has 31.5 percent of original size [2022-11-25 15:37:35,824 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-25 15:37:36,084 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-25 15:37:36,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:36,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:36,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373640307] [2022-11-25 15:37:36,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373640307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:36,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:36,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:37:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790290029] [2022-11-25 15:37:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:36,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:37:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:36,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:37:36,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:37:36,459 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 256 [2022-11-25 15:37:36,460 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-25 15:37:36,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:36,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 256 [2022-11-25 15:37:36,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:36,946 INFO L130 PetriNetUnfolder]: 2388/3863 cut-off events. [2022-11-25 15:37:36,946 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:37:36,959 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-25 15:37:36,978 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 28 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-11-25 15:37:36,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 152 flow [2022-11-25 15:37:36,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-11-25 15:37:36,981 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4388020833333333 [2022-11-25 15:37:36,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-11-25 15:37:36,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-11-25 15:37:36,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:36,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-11-25 15:37:36,983 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-25 15:37:36,985 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-25 15:37:36,986 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-25 15:37:36,986 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 94 flow. Second operand 3 states and 337 transitions. [2022-11-25 15:37:36,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 152 flow [2022-11-25 15:37:36,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:36,988 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 92 flow [2022-11-25 15:37:36,988 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-25 15:37:36,989 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -20 predicate places. [2022-11-25 15:37:36,989 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 92 flow [2022-11-25 15:37:36,990 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-25 15:37:36,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:36,990 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:37,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:37,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:37,206 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-25 15:37:37,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2004634699, now seen corresponding path program 1 times [2022-11-25 15:37:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:37,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395731763] [2022-11-25 15:37:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:37,207 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-25 15:37:37,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:37,214 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:37,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:37,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:37,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 15:37:37,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:37,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:37:37,495 INFO L321 Elim1Store]: treesize reduction 59, result has 34.4 percent of original size [2022-11-25 15:37:37,496 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-25 15:37:37,514 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-25 15:37:37,761 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-25 15:37:37,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:37,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:37,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395731763] [2022-11-25 15:37:37,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395731763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:37,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:37,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:37:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966670168] [2022-11-25 15:37:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:37,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:37:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:37:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:37:38,230 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2022-11-25 15:37:38,230 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-25 15:37:38,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:38,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2022-11-25 15:37:38,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:38,632 INFO L130 PetriNetUnfolder]: 1728/2834 cut-off events. [2022-11-25 15:37:38,632 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-11-25 15:37:38,639 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-25 15:37:38,652 INFO L137 encePairwiseOnDemand]: 253/256 looper letters, 27 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-11-25 15:37:38,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 148 flow [2022-11-25 15:37:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2022-11-25 15:37:38,655 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-11-25 15:37:38,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2022-11-25 15:37:38,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2022-11-25 15:37:38,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:38,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2022-11-25 15:37:38,657 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-25 15:37:38,658 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-25 15:37:38,659 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-25 15:37:38,659 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 92 flow. Second operand 3 states and 360 transitions. [2022-11-25 15:37:38,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 148 flow [2022-11-25 15:37:38,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:38,661 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 90 flow [2022-11-25 15:37:38,661 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-25 15:37:38,662 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -21 predicate places. [2022-11-25 15:37:38,662 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 90 flow [2022-11-25 15:37:38,663 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-25 15:37:38,663 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:38,663 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:38,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:38,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:38,876 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-25 15:37:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1970799540, now seen corresponding path program 1 times [2022-11-25 15:37:38,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:38,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017843834] [2022-11-25 15:37:38,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:38,878 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-25 15:37:38,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:38,879 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:38,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:38,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:37:38,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:39,056 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-25 15:37:39,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:39,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:39,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017843834] [2022-11-25 15:37:39,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017843834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:39,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:39,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:37:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557618057] [2022-11-25 15:37:39,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:39,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:37:39,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:39,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:37:39,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:37:39,140 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-25 15:37:39,141 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-25 15:37:39,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:39,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-25 15:37:39,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:40,326 INFO L130 PetriNetUnfolder]: 6485/9608 cut-off events. [2022-11-25 15:37:40,327 INFO L131 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-11-25 15:37:40,341 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-25 15:37:40,387 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 109 selfloop transitions, 28 changer transitions 0/141 dead transitions. [2022-11-25 15:37:40,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 141 transitions, 577 flow [2022-11-25 15:37:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:37:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 15:37:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1249 transitions. [2022-11-25 15:37:40,392 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.487890625 [2022-11-25 15:37:40,392 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1249 transitions. [2022-11-25 15:37:40,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1249 transitions. [2022-11-25 15:37:40,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:40,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1249 transitions. [2022-11-25 15:37:40,396 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-25 15:37:40,401 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-25 15:37:40,403 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-25 15:37:40,403 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 90 flow. Second operand 10 states and 1249 transitions. [2022-11-25 15:37:40,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 141 transitions, 577 flow [2022-11-25 15:37:40,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 141 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:40,407 INFO L231 Difference]: Finished difference. Result has 58 places, 66 transitions, 235 flow [2022-11-25 15:37:40,407 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-25 15:37:40,408 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2022-11-25 15:37:40,408 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 66 transitions, 235 flow [2022-11-25 15:37:40,409 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-25 15:37:40,409 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:40,409 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:40,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Ended with exit code 0 [2022-11-25 15:37:40,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:40,623 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-25 15:37:40,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1792499806, now seen corresponding path program 1 times [2022-11-25 15:37:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:40,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553148525] [2022-11-25 15:37:40,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:40,624 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-25 15:37:40,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:40,626 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:40,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:40,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:37:40,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:40,763 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-25 15:37:40,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:40,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:40,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553148525] [2022-11-25 15:37:40,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553148525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:40,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:40,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:37:40,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181034852] [2022-11-25 15:37:40,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:40,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:37:40,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:40,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:37:40,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:37:40,774 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-11-25 15:37:40,775 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-25 15:37:40,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:40,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-11-25 15:37:40,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:41,191 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-25 15:37:41,192 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 15:37:41,192 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:37:41,192 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:37:41,192 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 15:37:41,230 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-25 15:37:41,231 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,231 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,231 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,231 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,240 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-25 15:37:41,241 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,241 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,241 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,241 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,243 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-25 15:37:41,243 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,243 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,243 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,243 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:41,277 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-25 15:37:41,277 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-11-25 15:37:41,277 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 15:37:41,278 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 15:37:41,278 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 15:37:41,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][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-25 15:37:41,283 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,283 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,284 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,284 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,291 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-25 15:37:41,291 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,291 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,291 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,292 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,301 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-25 15:37:41,301 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,301 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,302 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,302 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,302 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-25 15:37:41,302 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,303 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,303 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,303 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,304 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-25 15:37:41,304 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,304 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,304 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,305 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,305 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-25 15:37:41,306 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,306 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,306 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,306 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:41,330 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-25 15:37:41,330 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,330 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,330 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,331 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,334 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-25 15:37:41,335 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,335 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,335 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,335 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,336 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-25 15:37:41,336 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,337 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,337 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,337 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:41,340 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-25 15:37:41,341 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,341 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,341 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,341 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,344 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-25 15:37:41,344 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,344 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,345 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,345 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,351 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-25 15:37:41,352 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,352 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,352 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,352 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,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][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-25 15:37:41,353 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,353 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,353 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,353 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,354 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-25 15:37:41,354 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,354 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,354 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,354 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,355 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-25 15:37:41,355 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,355 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,355 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,355 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,356 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-25 15:37:41,356 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,356 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,357 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,357 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:41,373 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-25 15:37:41,373 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,373 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,373 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,374 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,376 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-25 15:37:41,376 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,376 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,376 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,377 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,377 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-25 15:37:41,377 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,378 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,378 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,378 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,381 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-25 15:37:41,381 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,381 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,381 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,382 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,383 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-25 15:37:41,383 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,383 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,383 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,383 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is not cut-off event [2022-11-25 15:37:41,386 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-25 15:37:41,387 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,387 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,387 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,387 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,396 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-25 15:37:41,396 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,397 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,397 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,397 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,397 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-25 15:37:41,398 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,398 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,398 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,398 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,399 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-25 15:37:41,399 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,399 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,399 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,400 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:41,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][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-25 15:37:41,410 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,410 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,410 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,410 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,411 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-25 15:37:41,411 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,411 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,411 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,412 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,414 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-25 15:37:41,414 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,414 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,414 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,414 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,415 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-25 15:37:41,415 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,415 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,415 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,416 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,416 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-25 15:37:41,416 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,416 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,417 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,417 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,419 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-25 15:37:41,420 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,420 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,420 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,420 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is not cut-off event [2022-11-25 15:37:41,422 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-25 15:37:41,422 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,423 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,423 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,423 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,428 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-25 15:37:41,428 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,429 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,429 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,429 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:41,435 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-25 15:37:41,435 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,436 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,436 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,436 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,436 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-25 15:37:41,436 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,437 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,437 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,437 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,437 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-25 15:37:41,438 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,438 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,438 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,438 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,440 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-25 15:37:41,440 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,441 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,441 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,441 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,441 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-25 15:37:41,442 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,442 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,442 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,442 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is not cut-off event [2022-11-25 15:37:41,449 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-25 15:37:41,449 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:41,449 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:41,449 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:41,450 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:41,460 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-25 15:37:41,460 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,460 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,460 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,461 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,461 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-25 15:37:41,461 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,462 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,462 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,462 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,463 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-25 15:37:41,464 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,464 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,464 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,464 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-11-25 15:37:41,477 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-25 15:37:41,478 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is not cut-off event [2022-11-25 15:37:41,478 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-11-25 15:37:41,478 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-11-25 15:37:41,478 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is not cut-off event [2022-11-25 15:37:41,571 INFO L130 PetriNetUnfolder]: 2854/4805 cut-off events. [2022-11-25 15:37:41,572 INFO L131 PetriNetUnfolder]: For 1490/1598 co-relation queries the response was YES. [2022-11-25 15:37:41,588 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-25 15:37:41,612 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 48 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2022-11-25 15:37:41,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 399 flow [2022-11-25 15:37:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:37:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:37:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2022-11-25 15:37:41,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5260416666666666 [2022-11-25 15:37:41,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2022-11-25 15:37:41,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2022-11-25 15:37:41,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:41,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2022-11-25 15:37:41,618 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-25 15:37:41,620 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-25 15:37:41,621 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-25 15:37:41,621 INFO L175 Difference]: Start difference. First operand has 58 places, 66 transitions, 235 flow. Second operand 3 states and 404 transitions. [2022-11-25 15:37:41,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 399 flow [2022-11-25 15:37:41,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:37:41,640 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 251 flow [2022-11-25 15:37:41,640 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-25 15:37:41,641 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2022-11-25 15:37:41,641 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 251 flow [2022-11-25 15:37:41,641 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-25 15:37:41,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:41,642 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:41,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:41,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:41,855 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-25 15:37:41,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2086987866, now seen corresponding path program 2 times [2022-11-25 15:37:41,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:41,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517359450] [2022-11-25 15:37:41,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:37:41,857 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-25 15:37:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:41,858 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:41,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:41,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:37:41,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:37:41,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:37:41,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:42,016 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-25 15:37:42,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:42,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:42,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517359450] [2022-11-25 15:37:42,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517359450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:42,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:42,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:37:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380070901] [2022-11-25 15:37:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:42,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:37:42,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:42,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:37:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:37:42,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-11-25 15:37:42,035 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-25 15:37:42,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:42,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-11-25 15:37:42,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:42,469 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-25 15:37:42,469 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,470 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,470 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,470 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,470 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-25 15:37:42,471 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 15:37:42,471 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:42,471 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:42,471 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 15:37:42,556 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-25 15:37:42,556 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,557 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,557 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,557 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,557 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-25 15:37:42,558 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,558 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,558 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,558 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,560 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-25 15:37:42,560 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,560 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,560 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,561 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,561 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-25 15:37:42,561 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,561 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,562 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,562 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,574 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-25 15:37:42,574 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,574 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,574 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,574 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 15:37:42,599 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-25 15:37:42,599 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-25 15:37:42,599 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:42,599 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:42,600 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 15:37:42,600 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-25 15:37:42,600 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,600 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,600 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,600 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,606 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-25 15:37:42,607 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,607 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,607 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,607 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,612 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-25 15:37:42,612 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,612 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,612 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,612 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,612 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-25 15:37:42,612 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,613 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,613 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,613 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,622 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-25 15:37:42,622 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,622 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,622 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,622 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,622 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-25 15:37:42,623 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,623 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,623 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,623 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,623 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-25 15:37:42,623 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,623 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,624 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,624 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,624 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-25 15:37:42,624 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,624 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,624 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,624 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,625 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-25 15:37:42,625 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,625 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,625 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,625 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,626 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-25 15:37:42,626 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,626 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,627 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,638 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-25 15:37:42,638 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,638 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,638 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,639 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 15:37:42,654 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-25 15:37:42,655 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,655 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,655 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,655 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,657 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-25 15:37:42,658 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,658 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,658 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,658 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,663 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-25 15:37:42,663 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,663 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,663 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,663 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,665 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-25 15:37:42,665 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,665 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,665 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,666 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,670 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-25 15:37:42,671 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,671 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,671 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,671 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,671 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-25 15:37:42,672 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,672 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,672 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,672 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,673 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-25 15:37:42,673 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,673 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,673 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,673 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,674 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-25 15:37:42,674 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,674 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,674 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,674 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,681 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-25 15:37:42,681 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,682 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,682 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,682 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,682 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-25 15:37:42,682 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,682 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,682 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,682 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,683 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-25 15:37:42,683 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,683 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,683 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,683 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,683 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-25 15:37:42,683 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,683 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,683 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,684 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,684 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-25 15:37:42,684 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,684 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,684 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,684 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,685 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-25 15:37:42,685 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,685 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,685 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,685 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,689 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-25 15:37:42,689 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,690 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,690 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,690 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:37:42,699 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-25 15:37:42,700 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,700 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,700 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,700 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,703 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-25 15:37:42,703 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,703 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,703 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,703 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,705 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-25 15:37:42,706 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,706 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,706 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,706 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,708 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-25 15:37:42,708 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,709 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,709 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,709 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,717 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-25 15:37:42,718 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,718 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,718 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,718 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,718 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-25 15:37:42,719 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,719 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,719 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,719 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,720 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-25 15:37:42,720 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,720 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,720 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,721 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,721 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-25 15:37:42,721 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,721 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,721 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,721 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,722 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-25 15:37:42,722 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,722 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,722 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,722 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,728 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-25 15:37:42,729 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,729 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,729 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,729 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,729 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-25 15:37:42,729 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,729 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,729 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,729 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,730 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-25 15:37:42,730 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,730 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,730 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,730 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,731 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-25 15:37:42,731 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,731 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,731 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,731 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,735 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-25 15:37:42,736 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,736 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,736 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,736 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:37:42,750 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-25 15:37:42,751 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,751 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,751 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,751 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,761 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-25 15:37:42,761 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,762 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,762 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,762 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,764 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-25 15:37:42,764 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,764 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,765 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,765 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,767 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-25 15:37:42,767 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,767 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,767 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,767 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,774 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-25 15:37:42,775 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,775 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,776 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,776 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,776 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-25 15:37:42,776 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,776 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,777 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,777 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,777 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-25 15:37:42,778 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,778 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,778 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,778 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,779 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-25 15:37:42,779 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,779 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,779 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,779 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,780 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-25 15:37:42,780 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,780 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,781 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,781 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,788 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-25 15:37:42,788 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,788 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,788 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,789 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,789 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-25 15:37:42,789 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,790 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,790 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,790 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:37:42,796 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-25 15:37:42,796 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,796 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,796 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,796 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,817 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-25 15:37:42,818 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,818 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,818 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,818 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,819 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-25 15:37:42,819 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,819 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,820 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,820 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,826 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-25 15:37:42,826 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,826 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,826 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,827 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,827 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-25 15:37:42,827 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,827 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,829 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,829 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,830 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-25 15:37:42,830 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,831 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,831 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,831 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:37:42,837 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-25 15:37:42,837 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,837 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,838 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,838 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,853 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-25 15:37:42,854 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,854 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,854 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,854 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:37:42,857 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-25 15:37:42,857 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:37:42,857 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:37:42,858 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:37:42,858 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:37:42,897 INFO L130 PetriNetUnfolder]: 3228/5565 cut-off events. [2022-11-25 15:37:42,897 INFO L131 PetriNetUnfolder]: For 4153/4263 co-relation queries the response was YES. [2022-11-25 15:37:42,920 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-25 15:37:42,950 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 69 selfloop transitions, 11 changer transitions 0/114 dead transitions. [2022-11-25 15:37:42,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 114 transitions, 562 flow [2022-11-25 15:37:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:37:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:37:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-11-25 15:37:42,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5341796875 [2022-11-25 15:37:42,954 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2022-11-25 15:37:42,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2022-11-25 15:37:42,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:42,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2022-11-25 15:37:42,957 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-25 15:37:42,959 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-25 15:37:42,961 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-25 15:37:42,962 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 251 flow. Second operand 4 states and 547 transitions. [2022-11-25 15:37:42,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 114 transitions, 562 flow [2022-11-25 15:37:42,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 114 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:42,983 INFO L231 Difference]: Finished difference. Result has 64 places, 76 transitions, 326 flow [2022-11-25 15:37:42,984 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-25 15:37:42,986 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2022-11-25 15:37:42,986 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 76 transitions, 326 flow [2022-11-25 15:37:42,986 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-25 15:37:42,987 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:42,987 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:43,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:43,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:43,200 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-25 15:37:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1084930096, now seen corresponding path program 1 times [2022-11-25 15:37:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:43,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38121243] [2022-11-25 15:37:43,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:43,202 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-25 15:37:43,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:43,203 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:43,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:43,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:37:43,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:43,378 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-25 15:37:43,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:43,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:43,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38121243] [2022-11-25 15:37:43,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38121243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:43,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:43,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:37:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816815231] [2022-11-25 15:37:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:43,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:37:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:43,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:37:43,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:37:43,484 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-25 15:37:43,485 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-25 15:37:43,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:43,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-25 15:37:43,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:45,226 INFO L130 PetriNetUnfolder]: 8344/13853 cut-off events. [2022-11-25 15:37:45,226 INFO L131 PetriNetUnfolder]: For 11756/11768 co-relation queries the response was YES. [2022-11-25 15:37:45,272 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-25 15:37:45,334 INFO L137 encePairwiseOnDemand]: 248/256 looper letters, 214 selfloop transitions, 25 changer transitions 0/243 dead transitions. [2022-11-25 15:37:45,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 243 transitions, 1476 flow [2022-11-25 15:37:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:37:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:37:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1176 transitions. [2022-11-25 15:37:45,339 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2022-11-25 15:37:45,339 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1176 transitions. [2022-11-25 15:37:45,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1176 transitions. [2022-11-25 15:37:45,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:45,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1176 transitions. [2022-11-25 15:37:45,344 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-25 15:37:45,348 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-25 15:37:45,349 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-25 15:37:45,350 INFO L175 Difference]: Start difference. First operand has 64 places, 76 transitions, 326 flow. Second operand 9 states and 1176 transitions. [2022-11-25 15:37:45,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 243 transitions, 1476 flow [2022-11-25 15:37:45,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 243 transitions, 1460 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-11-25 15:37:45,430 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 434 flow [2022-11-25 15:37:45,431 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-25 15:37:45,432 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 8 predicate places. [2022-11-25 15:37:45,432 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 434 flow [2022-11-25 15:37:45,433 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-25 15:37:45,433 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:45,433 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:45,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:45,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:45,645 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-25 15:37:45,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1916084476, now seen corresponding path program 1 times [2022-11-25 15:37:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:45,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799134571] [2022-11-25 15:37:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:45,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:45,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:45,649 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:45,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:45,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:37:45,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:45,817 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-25 15:37:45,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:45,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:45,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799134571] [2022-11-25 15:37:45,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799134571] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:45,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:45,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:37:45,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171507180] [2022-11-25 15:37:45,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:45,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:37:45,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:45,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:37:45,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:37:45,891 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-25 15:37:45,892 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-25 15:37:45,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:45,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-25 15:37:45,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:48,684 INFO L130 PetriNetUnfolder]: 16125/26173 cut-off events. [2022-11-25 15:37:48,684 INFO L131 PetriNetUnfolder]: For 39343/40059 co-relation queries the response was YES. [2022-11-25 15:37:48,788 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-25 15:37:48,906 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 211 selfloop transitions, 87 changer transitions 0/306 dead transitions. [2022-11-25 15:37:48,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 306 transitions, 2133 flow [2022-11-25 15:37:48,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:37:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:37:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1169 transitions. [2022-11-25 15:37:48,911 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5073784722222222 [2022-11-25 15:37:48,911 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1169 transitions. [2022-11-25 15:37:48,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1169 transitions. [2022-11-25 15:37:48,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:48,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1169 transitions. [2022-11-25 15:37:48,916 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-25 15:37:48,921 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-25 15:37:48,922 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-25 15:37:48,922 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 434 flow. Second operand 9 states and 1169 transitions. [2022-11-25 15:37:48,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 306 transitions, 2133 flow [2022-11-25 15:37:49,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 306 transitions, 2065 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-25 15:37:49,262 INFO L231 Difference]: Finished difference. Result has 87 places, 159 transitions, 1095 flow [2022-11-25 15:37:49,262 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-25 15:37:49,263 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2022-11-25 15:37:49,263 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 159 transitions, 1095 flow [2022-11-25 15:37:49,263 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-25 15:37:49,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:49,264 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:49,273 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:49,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:49,465 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-25 15:37:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:49,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1221088967, now seen corresponding path program 1 times [2022-11-25 15:37:49,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:49,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864079593] [2022-11-25 15:37:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:49,466 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-25 15:37:49,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:49,467 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:49,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:49,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:37:49,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:49,662 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-25 15:37:49,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:49,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:49,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864079593] [2022-11-25 15:37:49,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864079593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:49,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:49,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:37:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188366416] [2022-11-25 15:37:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:49,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:37:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:49,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:37:49,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:37:49,695 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-11-25 15:37:49,696 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-25 15:37:49,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:49,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-11-25 15:37:49,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:50,805 INFO L130 PetriNetUnfolder]: 2320/4893 cut-off events. [2022-11-25 15:37:50,806 INFO L131 PetriNetUnfolder]: For 7018/7301 co-relation queries the response was YES. [2022-11-25 15:37:50,838 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-25 15:37:50,855 INFO L137 encePairwiseOnDemand]: 249/256 looper letters, 91 selfloop transitions, 13 changer transitions 0/187 dead transitions. [2022-11-25 15:37:50,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 187 transitions, 1286 flow [2022-11-25 15:37:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:37:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:37:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2022-11-25 15:37:50,859 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-11-25 15:37:50,859 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2022-11-25 15:37:50,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2022-11-25 15:37:50,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:50,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2022-11-25 15:37:50,863 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-25 15:37:50,867 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-25 15:37:50,868 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-25 15:37:50,868 INFO L175 Difference]: Start difference. First operand has 87 places, 159 transitions, 1095 flow. Second operand 5 states and 672 transitions. [2022-11-25 15:37:50,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 187 transitions, 1286 flow [2022-11-25 15:37:50,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 187 transitions, 1280 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-25 15:37:50,912 INFO L231 Difference]: Finished difference. Result has 92 places, 133 transitions, 883 flow [2022-11-25 15:37:50,913 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-25 15:37:50,913 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 24 predicate places. [2022-11-25 15:37:50,913 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 133 transitions, 883 flow [2022-11-25 15:37:50,914 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-25 15:37:50,914 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:50,914 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:50,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:51,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:51,128 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-25 15:37:51,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:51,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1075638878, now seen corresponding path program 1 times [2022-11-25 15:37:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:51,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131501583] [2022-11-25 15:37:51,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:51,129 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-25 15:37:51,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:51,131 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:51,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:51,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:37:51,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:37:51,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:51,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:51,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131501583] [2022-11-25 15:37:51,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131501583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:51,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:51,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:37:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872475227] [2022-11-25 15:37:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:51,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:37:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:51,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:37:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:37:51,457 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-25 15:37:51,458 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-25 15:37:51,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:51,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-25 15:37:51,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:53,050 INFO L130 PetriNetUnfolder]: 3597/6768 cut-off events. [2022-11-25 15:37:53,050 INFO L131 PetriNetUnfolder]: For 11652/11796 co-relation queries the response was YES. [2022-11-25 15:37:53,071 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-25 15:37:53,089 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 148 selfloop transitions, 55 changer transitions 0/210 dead transitions. [2022-11-25 15:37:53,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 210 transitions, 1753 flow [2022-11-25 15:37:53,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:37:53,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:37:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 998 transitions. [2022-11-25 15:37:53,095 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4873046875 [2022-11-25 15:37:53,095 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 998 transitions. [2022-11-25 15:37:53,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 998 transitions. [2022-11-25 15:37:53,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:53,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 998 transitions. [2022-11-25 15:37:53,098 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-25 15:37:53,102 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-25 15:37:53,103 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-25 15:37:53,103 INFO L175 Difference]: Start difference. First operand has 92 places, 133 transitions, 883 flow. Second operand 8 states and 998 transitions. [2022-11-25 15:37:53,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 210 transitions, 1753 flow [2022-11-25 15:37:53,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 210 transitions, 1690 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-11-25 15:37:53,159 INFO L231 Difference]: Finished difference. Result has 101 places, 144 transitions, 1099 flow [2022-11-25 15:37:53,159 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-25 15:37:53,159 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 33 predicate places. [2022-11-25 15:37:53,160 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 144 transitions, 1099 flow [2022-11-25 15:37:53,160 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-25 15:37:53,160 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:53,161 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:53,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Ended with exit code 0 [2022-11-25 15:37:53,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:53,374 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-25 15:37:53,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:53,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1240572479, now seen corresponding path program 1 times [2022-11-25 15:37:53,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:53,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485226224] [2022-11-25 15:37:53,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:53,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:53,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:53,376 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:53,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:53,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:37:53,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:53,551 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-25 15:37:53,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:53,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:53,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485226224] [2022-11-25 15:37:53,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485226224] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:53,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:53,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:37:53,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424683279] [2022-11-25 15:37:53,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:53,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:37:53,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:53,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:37:53,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:37:53,668 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-25 15:37:53,669 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-25 15:37:53,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:53,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-25 15:37:53,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:55,059 INFO L130 PetriNetUnfolder]: 3595/6862 cut-off events. [2022-11-25 15:37:55,059 INFO L131 PetriNetUnfolder]: For 14354/14551 co-relation queries the response was YES. [2022-11-25 15:37:55,094 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-25 15:37:55,115 INFO L137 encePairwiseOnDemand]: 247/256 looper letters, 178 selfloop transitions, 80 changer transitions 0/268 dead transitions. [2022-11-25 15:37:55,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 268 transitions, 2262 flow [2022-11-25 15:37:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:37:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:37:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 910 transitions. [2022-11-25 15:37:55,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2022-11-25 15:37:55,120 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 910 transitions. [2022-11-25 15:37:55,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 910 transitions. [2022-11-25 15:37:55,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:55,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 910 transitions. [2022-11-25 15:37:55,124 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-25 15:37:55,127 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-25 15:37:55,128 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-25 15:37:55,129 INFO L175 Difference]: Start difference. First operand has 101 places, 144 transitions, 1099 flow. Second operand 7 states and 910 transitions. [2022-11-25 15:37:55,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 268 transitions, 2262 flow [2022-11-25 15:37:55,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 268 transitions, 2254 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-25 15:37:55,219 INFO L231 Difference]: Finished difference. Result has 111 places, 175 transitions, 1567 flow [2022-11-25 15:37:55,219 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-25 15:37:55,220 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2022-11-25 15:37:55,220 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 175 transitions, 1567 flow [2022-11-25 15:37:55,220 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-25 15:37:55,221 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:55,221 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-25 15:37:55,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:55,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:55,434 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-25 15:37:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -635553890, now seen corresponding path program 1 times [2022-11-25 15:37:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:55,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008508124] [2022-11-25 15:37:55,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:55,435 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-25 15:37:55,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:55,436 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:55,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:37:55,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:37:55,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:37:55,668 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-25 15:37:55,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:37:55,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:37:55,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008508124] [2022-11-25 15:37:55,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008508124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:37:55,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:37:55,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:37:55,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664576036] [2022-11-25 15:37:55,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:37:55,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:37:55,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:37:55,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:37:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:37:55,805 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2022-11-25 15:37:55,806 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-25 15:37:55,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:37:55,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2022-11-25 15:37:55,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:37:57,561 INFO L130 PetriNetUnfolder]: 3834/7455 cut-off events. [2022-11-25 15:37:57,562 INFO L131 PetriNetUnfolder]: For 17756/17980 co-relation queries the response was YES. [2022-11-25 15:37:57,605 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-25 15:37:57,629 INFO L137 encePairwiseOnDemand]: 248/256 looper letters, 235 selfloop transitions, 65 changer transitions 0/309 dead transitions. [2022-11-25 15:37:57,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 309 transitions, 2852 flow [2022-11-25 15:37:57,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:37:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:37:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1043 transitions. [2022-11-25 15:37:57,633 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.50927734375 [2022-11-25 15:37:57,634 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1043 transitions. [2022-11-25 15:37:57,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1043 transitions. [2022-11-25 15:37:57,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:37:57,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1043 transitions. [2022-11-25 15:37:57,638 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-25 15:37:57,642 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-25 15:37:57,643 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-25 15:37:57,644 INFO L175 Difference]: Start difference. First operand has 111 places, 175 transitions, 1567 flow. Second operand 8 states and 1043 transitions. [2022-11-25 15:37:57,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 309 transitions, 2852 flow [2022-11-25 15:37:57,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 309 transitions, 2852 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:37:57,739 INFO L231 Difference]: Finished difference. Result has 122 places, 184 transitions, 1797 flow [2022-11-25 15:37:57,739 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-25 15:37:57,739 INFO L288 CegarLoopForPetriNet]: 68 programPoint places, 54 predicate places. [2022-11-25 15:37:57,740 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 184 transitions, 1797 flow [2022-11-25 15:37:57,740 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-25 15:37:57,740 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:37:57,741 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-25 15:37:57,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 15:37:57,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:57,954 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-25 15:37:57,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:37:57,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1464843596, now seen corresponding path program 1 times [2022-11-25 15:37:57,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:37:57,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621684251] [2022-11-25 15:37:57,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:37:57,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:37:57,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:37:57,957 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:57,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:37:58,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:37:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:37:58,231 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 15:37:58,231 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:37:58,233 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2022-11-25 15:37:58,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2022-11-25 15:37:58,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2022-11-25 15:37:58,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2022-11-25 15:37:58,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2022-11-25 15:37:58,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2022-11-25 15:37:58,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2022-11-25 15:37:58,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2022-11-25 15:37:58,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2022-11-25 15:37:58,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2022-11-25 15:37:58,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2022-11-25 15:37:58,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2022-11-25 15:37:58,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2022-11-25 15:37:58,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2022-11-25 15:37:58,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2022-11-25 15:37:58,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2022-11-25 15:37:58,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2022-11-25 15:37:58,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2022-11-25 15:37:58,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2022-11-25 15:37:58,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2022-11-25 15:37:58,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2022-11-25 15:37:58,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2022-11-25 15:37:58,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2022-11-25 15:37:58,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2022-11-25 15:37:58,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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)] Ended with exit code 0 [2022-11-25 15:37:58,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/mathsat -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-25 15:37:58,456 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:37:58,463 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:37:58,464 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:37:58,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:37:58 BasicIcfg [2022-11-25 15:37:58,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:37:58,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:37:58,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:37:58,563 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:37:58,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:37:07" (3/4) ... [2022-11-25 15:37:58,567 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:37:58,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:37:58,568 INFO L158 Benchmark]: Toolchain (without parser) took 53092.31ms. Allocated memory was 60.8MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 29.0MB in the beginning and 713.3MB in the end (delta: -684.3MB). Peak memory consumption was 688.8MB. Max. memory is 16.1GB. [2022-11-25 15:37:58,568 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 60.8MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:37:58,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 715.12ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 28.9MB in the beginning and 42.6MB in the end (delta: -13.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-11-25 15:37:58,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.84ms. Allocated memory is still 81.8MB. Free memory was 42.6MB in the beginning and 61.5MB in the end (delta: -18.9MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2022-11-25 15:37:58,571 INFO L158 Benchmark]: Boogie Preprocessor took 72.94ms. Allocated memory is still 81.8MB. Free memory was 61.5MB in the beginning and 59.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:37:58,571 INFO L158 Benchmark]: RCFGBuilder took 903.25ms. Allocated memory is still 81.8MB. Free memory was 59.8MB in the beginning and 38.1MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 15:37:58,572 INFO L158 Benchmark]: TraceAbstraction took 51283.09ms. Allocated memory was 81.8MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 37.7MB in the beginning and 713.3MB in the end (delta: -675.6MB). Peak memory consumption was 677.5MB. Max. memory is 16.1GB. [2022-11-25 15:37:58,572 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 1.4GB. Free memory is still 713.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:37:58,579 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.66ms. Allocated memory is still 60.8MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 715.12ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 28.9MB in the beginning and 42.6MB in the end (delta: -13.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.84ms. Allocated memory is still 81.8MB. Free memory was 42.6MB in the beginning and 61.5MB in the end (delta: -18.9MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.94ms. Allocated memory is still 81.8MB. Free memory was 61.5MB in the beginning and 59.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 903.25ms. Allocated memory is still 81.8MB. Free memory was 59.8MB in the beginning and 38.1MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 51283.09ms. Allocated memory was 81.8MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 37.7MB in the beginning and 713.3MB in the end (delta: -675.6MB). Peak memory consumption was 677.5MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 1.4GB. Free memory is still 713.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.9s, 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: 335, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 241, dependent conditional: 0, dependent unconditional: 241, 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 [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=1, r=1, t1={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 [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L724] 4 int l; [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l [L745] 2 return 0; [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L730] 4 y = l VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] 4 reach_error() VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 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: 50.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 25.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2066 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1474 mSDsluCounter, 332 SdHoareTripleChecker+Invalid, 6.8s 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.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.7s 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-25 15:37:58,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f06adb74-9ec1-4714-9aad-edb9fd596c9b/bin/uautomizer-ZsLfNo2U6R/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