./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8 --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 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e --- 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-2329fc7 [2022-12-13 14:40:27,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:40:27,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:40:27,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:40:27,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:40:27,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:40:27,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:40:27,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:40:27,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:40:27,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:40:27,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:40:27,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:40:27,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:40:27,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:40:27,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:40:27,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:40:27,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:40:27,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:40:27,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:40:27,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:40:27,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:40:27,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:40:27,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:40:27,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:40:27,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:40:27,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:40:27,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:40:27,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:40:27,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:40:27,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:40:27,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:40:27,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:40:27,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:40:27,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:40:27,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:40:27,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:40:27,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:40:27,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:40:27,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:40:27,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:40:27,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:40:27,961 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 14:40:27,979 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:40:27,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:40:27,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:40:27,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:40:27,989 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:40:27,990 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:40:27,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:40:27,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:40:27,990 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:40:27,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:40:27,991 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:40:27,991 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:40:27,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:40:27,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:40:27,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:40:27,991 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:40:27,992 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:40:27,992 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 14:40:27,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:40:27,992 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:40:27,992 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:40:27,992 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:40:27,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:40:27,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:40:27,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:40:27,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:40:27,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:40:27,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:40:27,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:40:27,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:40:27,994 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:40:27,994 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:40:27,994 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:40:27,994 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:40:27,994 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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8 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 -> 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e [2022-12-13 14:40:28,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:40:28,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:40:28,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:40:28,175 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:40:28,175 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:40:28,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2022-12-13 14:40:30,824 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:40:30,978 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:40:30,979 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2022-12-13 14:40:30,988 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/data/88b6fdfd9/56f594c315c84816aba15a5f75819478/FLAG7f7e4b11a [2022-12-13 14:40:31,002 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/data/88b6fdfd9/56f594c315c84816aba15a5f75819478 [2022-12-13 14:40:31,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:40:31,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:40:31,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:40:31,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:40:31,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:40:31,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@234554c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31, skipping insertion in model container [2022-12-13 14:40:31,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:40:31,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:40:31,161 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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i[993,1006] [2022-12-13 14:40:31,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:40:31,304 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:40:31,312 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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i[993,1006] [2022-12-13 14:40:31,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:31,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:31,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:40:31,366 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:40:31,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31 WrapperNode [2022-12-13 14:40:31,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:40:31,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:40:31,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:40:31,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:40:31,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,399 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 14:40:31,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:40:31,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:40:31,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:40:31,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:40:31,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,409 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,417 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:40:31,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:40:31,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:40:31,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:40:31,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (1/1) ... [2022-12-13 14:40:31,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:40:31,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:40:31,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:40:31,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:40:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 14:40:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 14:40:31,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 14:40:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:40:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:40:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:40:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 14:40:31,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 14:40:31,477 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 14:40:31,477 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 14:40:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 14:40:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 14:40:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:40:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 14:40:31,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:40:31,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:40:31,480 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 14:40:31,606 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:40:31,608 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:40:31,941 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:40:32,164 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:40:32,164 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:40:32,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:40:32 BoogieIcfgContainer [2022-12-13 14:40:32,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:40:32,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:40:32,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:40:32,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:40:32,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:40:31" (1/3) ... [2022-12-13 14:40:32,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9adeac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:40:32, skipping insertion in model container [2022-12-13 14:40:32,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:31" (2/3) ... [2022-12-13 14:40:32,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9adeac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:40:32, skipping insertion in model container [2022-12-13 14:40:32,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:40:32" (3/3) ... [2022-12-13 14:40:32,172 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_rmo.oepc.i [2022-12-13 14:40:32,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:40:32,187 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-12-13 14:40:32,187 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 14:40:32,235 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 14:40:32,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 166 transitions, 347 flow [2022-12-13 14:40:32,305 INFO L130 PetriNetUnfolder]: 2/163 cut-off events. [2022-12-13 14:40:32,305 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:40:32,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 163 events. 2/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 179 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 14:40:32,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 166 transitions, 347 flow [2022-12-13 14:40:32,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 163 transitions, 335 flow [2022-12-13 14:40:32,317 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 14:40:32,324 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 163 transitions, 335 flow [2022-12-13 14:40:32,326 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 163 transitions, 335 flow [2022-12-13 14:40:32,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 335 flow [2022-12-13 14:40:32,350 INFO L130 PetriNetUnfolder]: 2/163 cut-off events. [2022-12-13 14:40:32,350 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:40:32,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 163 events. 2/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 178 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 14:40:32,353 INFO L119 LiptonReduction]: Number of co-enabled transitions 4704 [2022-12-13 14:40:39,433 INFO L134 LiptonReduction]: Checked pairs total: 17372 [2022-12-13 14:40:39,433 INFO L136 LiptonReduction]: Total number of compositions: 144 [2022-12-13 14:40:39,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:40:39,447 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;@1cfcaa27, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:40:39,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-12-13 14:40:39,448 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 14:40:39,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:40:39,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:39,449 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 14:40:39,449 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:39,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 819, now seen corresponding path program 1 times [2022-12-13 14:40:39,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:39,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952896635] [2022-12-13 14:40:39,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:39,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:39,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:39,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952896635] [2022-12-13 14:40:39,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952896635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:39,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:39,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 14:40:39,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067587066] [2022-12-13 14:40:39,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:39,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 14:40:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:39,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 14:40:39,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 14:40:39,561 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 310 [2022-12-13 14:40:39,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 125 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:39,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:39,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 310 [2022-12-13 14:40:39,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:40,327 INFO L130 PetriNetUnfolder]: 4688/6810 cut-off events. [2022-12-13 14:40:40,327 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 14:40:40,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13611 conditions, 6810 events. 4688/6810 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 41699 event pairs, 4688 based on Foata normal form. 0/3743 useless extension candidates. Maximal degree in co-relation 13600. Up to 6755 conditions per place. [2022-12-13 14:40:40,368 INFO L137 encePairwiseOnDemand]: 293/310 looper letters, 34 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2022-12-13 14:40:40,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 157 flow [2022-12-13 14:40:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 14:40:40,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 14:40:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2022-12-13 14:40:40,379 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5145161290322581 [2022-12-13 14:40:40,380 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 319 transitions. [2022-12-13 14:40:40,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 319 transitions. [2022-12-13 14:40:40,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:40,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 319 transitions. [2022-12-13 14:40:40,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:40,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:40,389 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:40,390 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 125 flow. Second operand 2 states and 319 transitions. [2022-12-13 14:40:40,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 157 flow [2022-12-13 14:40:40,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 14:40:40,395 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2022-12-13 14:40:40,396 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-13 14:40:40,399 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2022-12-13 14:40:40,399 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2022-12-13 14:40:40,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:40,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:40,399 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 14:40:40,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:40:40,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash 808640, now seen corresponding path program 1 times [2022-12-13 14:40:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:40,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341057831] [2022-12-13 14:40:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:40,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:40,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:40,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341057831] [2022-12-13 14:40:40,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341057831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:40,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:40,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:40:40,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009391643] [2022-12-13 14:40:40,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:40,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:40:40,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:40,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:40:40,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:40:40,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 310 [2022-12-13 14:40:40,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 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-12-13 14:40:40,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:40,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 310 [2022-12-13 14:40:40,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:41,255 INFO L130 PetriNetUnfolder]: 4173/6267 cut-off events. [2022-12-13 14:40:41,256 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:40:41,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12478 conditions, 6267 events. 4173/6267 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 37725 event pairs, 2692 based on Foata normal form. 0/4130 useless extension candidates. Maximal degree in co-relation 12475. Up to 3934 conditions per place. [2022-12-13 14:40:41,283 INFO L137 encePairwiseOnDemand]: 296/310 looper letters, 41 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2022-12-13 14:40:41,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 210 flow [2022-12-13 14:40:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:40:41,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:40:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-12-13 14:40:41,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4720430107526882 [2022-12-13 14:40:41,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2022-12-13 14:40:41,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2022-12-13 14:40:41,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:41,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2022-12-13 14:40:41,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:41,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:41,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:41,290 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 439 transitions. [2022-12-13 14:40:41,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 210 flow [2022-12-13 14:40:41,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 14:40:41,291 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 146 flow [2022-12-13 14:40:41,292 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-13 14:40:41,292 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -17 predicate places. [2022-12-13 14:40:41,292 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 146 flow [2022-12-13 14:40:41,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-12-13 14:40:41,292 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:41,293 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 14:40:41,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:40:41,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash 808641, now seen corresponding path program 1 times [2022-12-13 14:40:41,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:41,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979046274] [2022-12-13 14:40:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:41,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:41,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979046274] [2022-12-13 14:40:41,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979046274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:41,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:41,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:40:41,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398858114] [2022-12-13 14:40:41,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:41,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:40:41,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:41,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:40:41,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:40:41,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 310 [2022-12-13 14:40:41,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:41,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:41,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 310 [2022-12-13 14:40:41,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:41,767 INFO L130 PetriNetUnfolder]: 1754/2803 cut-off events. [2022-12-13 14:40:41,767 INFO L131 PetriNetUnfolder]: For 667/712 co-relation queries the response was YES. [2022-12-13 14:40:41,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7170 conditions, 2803 events. 1754/2803 cut-off events. For 667/712 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16409 event pairs, 1460 based on Foata normal form. 392/2819 useless extension candidates. Maximal degree in co-relation 7165. Up to 2607 conditions per place. [2022-12-13 14:40:41,779 INFO L137 encePairwiseOnDemand]: 303/310 looper letters, 30 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2022-12-13 14:40:41,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 196 flow [2022-12-13 14:40:41,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:40:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:40:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2022-12-13 14:40:41,782 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46021505376344085 [2022-12-13 14:40:41,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2022-12-13 14:40:41,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2022-12-13 14:40:41,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:41,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2022-12-13 14:40:41,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:41,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:41,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:41,785 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 146 flow. Second operand 3 states and 428 transitions. [2022-12-13 14:40:41,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 196 flow [2022-12-13 14:40:41,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:40:41,790 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 120 flow [2022-12-13 14:40:41,791 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-13 14:40:41,791 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2022-12-13 14:40:41,791 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 120 flow [2022-12-13 14:40:41,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:41,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:41,792 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:41,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:40:41,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2145318097, now seen corresponding path program 1 times [2022-12-13 14:40:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:41,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76962312] [2022-12-13 14:40:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:41,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:41,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76962312] [2022-12-13 14:40:41,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76962312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:41,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:41,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:40:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596798084] [2022-12-13 14:40:41,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:41,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:40:41,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:41,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:40:41,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:40:41,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 310 [2022-12-13 14:40:41,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:41,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:41,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 310 [2022-12-13 14:40:41,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:42,221 INFO L130 PetriNetUnfolder]: 1690/2723 cut-off events. [2022-12-13 14:40:42,221 INFO L131 PetriNetUnfolder]: For 286/325 co-relation queries the response was YES. [2022-12-13 14:40:42,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6525 conditions, 2723 events. 1690/2723 cut-off events. For 286/325 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16013 event pairs, 1101 based on Foata normal form. 0/2186 useless extension candidates. Maximal degree in co-relation 6520. Up to 1744 conditions per place. [2022-12-13 14:40:42,233 INFO L137 encePairwiseOnDemand]: 306/310 looper letters, 51 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-13 14:40:42,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 300 flow [2022-12-13 14:40:42,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:40:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:40:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-12-13 14:40:42,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47956989247311826 [2022-12-13 14:40:42,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2022-12-13 14:40:42,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2022-12-13 14:40:42,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:42,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2022-12-13 14:40:42,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,239 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,240 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 120 flow. Second operand 3 states and 446 transitions. [2022-12-13 14:40:42,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 300 flow [2022-12-13 14:40:42,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 14:40:42,241 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 132 flow [2022-12-13 14:40:42,242 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-13 14:40:42,242 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2022-12-13 14:40:42,242 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 132 flow [2022-12-13 14:40:42,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,243 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:42,243 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:42,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:40:42,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:42,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:42,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2145318401, now seen corresponding path program 1 times [2022-12-13 14:40:42,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:42,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764223391] [2022-12-13 14:40:42,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:42,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764223391] [2022-12-13 14:40:42,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764223391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:42,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:42,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:40:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686218649] [2022-12-13 14:40:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:42,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:40:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:42,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:40:42,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:40:42,422 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 310 [2022-12-13 14:40:42,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:42,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 310 [2022-12-13 14:40:42,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:42,795 INFO L130 PetriNetUnfolder]: 1658/2676 cut-off events. [2022-12-13 14:40:42,796 INFO L131 PetriNetUnfolder]: For 580/616 co-relation queries the response was YES. [2022-12-13 14:40:42,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6878 conditions, 2676 events. 1658/2676 cut-off events. For 580/616 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 15745 event pairs, 1087 based on Foata normal form. 0/2280 useless extension candidates. Maximal degree in co-relation 6872. Up to 1729 conditions per place. [2022-12-13 14:40:42,804 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 50 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2022-12-13 14:40:42,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 308 flow [2022-12-13 14:40:42,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:40:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:40:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2022-12-13 14:40:42,806 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4806451612903226 [2022-12-13 14:40:42,806 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2022-12-13 14:40:42,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2022-12-13 14:40:42,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:42,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2022-12-13 14:40:42,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,808 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 132 flow. Second operand 3 states and 447 transitions. [2022-12-13 14:40:42,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 308 flow [2022-12-13 14:40:42,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:40:42,809 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 137 flow [2022-12-13 14:40:42,809 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2022-12-13 14:40:42,810 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2022-12-13 14:40:42,810 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 137 flow [2022-12-13 14:40:42,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,810 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:42,810 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:42,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:40:42,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:42,811 INFO L85 PathProgramCache]: Analyzing trace with hash -215646782, now seen corresponding path program 1 times [2022-12-13 14:40:42,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:42,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912523889] [2022-12-13 14:40:42,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:42,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:42,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912523889] [2022-12-13 14:40:42,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912523889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:42,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:42,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:40:42,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51887349] [2022-12-13 14:40:42,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:42,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:40:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:42,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:40:42,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:40:42,951 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 310 [2022-12-13 14:40:42,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:42,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:42,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 310 [2022-12-13 14:40:42,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:43,230 INFO L130 PetriNetUnfolder]: 1557/2552 cut-off events. [2022-12-13 14:40:43,230 INFO L131 PetriNetUnfolder]: For 631/637 co-relation queries the response was YES. [2022-12-13 14:40:43,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6815 conditions, 2552 events. 1557/2552 cut-off events. For 631/637 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 15290 event pairs, 334 based on Foata normal form. 6/2224 useless extension candidates. Maximal degree in co-relation 6808. Up to 2007 conditions per place. [2022-12-13 14:40:43,238 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 47 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2022-12-13 14:40:43,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 303 flow [2022-12-13 14:40:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:40:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:40:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2022-12-13 14:40:43,239 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4698924731182796 [2022-12-13 14:40:43,239 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2022-12-13 14:40:43,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2022-12-13 14:40:43,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:43,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2022-12-13 14:40:43,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:43,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:43,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 310.0) internal successors, (1240), 4 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:43,242 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 137 flow. Second operand 3 states and 437 transitions. [2022-12-13 14:40:43,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 303 flow [2022-12-13 14:40:43,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:40:43,243 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 139 flow [2022-12-13 14:40:43,243 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2022-12-13 14:40:43,244 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2022-12-13 14:40:43,244 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 139 flow [2022-12-13 14:40:43,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:43,244 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:43,244 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:43,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:40:43,244 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:43,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1716174534, now seen corresponding path program 1 times [2022-12-13 14:40:43,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:43,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199604949] [2022-12-13 14:40:43,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:43,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:43,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:43,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199604949] [2022-12-13 14:40:43,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199604949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:43,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:43,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:40:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488308983] [2022-12-13 14:40:43,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:43,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:40:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:43,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:40:43,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:40:43,549 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 310 [2022-12-13 14:40:43,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:43,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:43,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 310 [2022-12-13 14:40:43,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:43,873 INFO L130 PetriNetUnfolder]: 1666/2648 cut-off events. [2022-12-13 14:40:43,873 INFO L131 PetriNetUnfolder]: For 409/409 co-relation queries the response was YES. [2022-12-13 14:40:43,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7151 conditions, 2648 events. 1666/2648 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 15151 event pairs, 1152 based on Foata normal form. 0/2291 useless extension candidates. Maximal degree in co-relation 7143. Up to 1709 conditions per place. [2022-12-13 14:40:43,881 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 53 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-13 14:40:43,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 328 flow [2022-12-13 14:40:43,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:40:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:40:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2022-12-13 14:40:43,883 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4467741935483871 [2022-12-13 14:40:43,883 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2022-12-13 14:40:43,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2022-12-13 14:40:43,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:43,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2022-12-13 14:40:43,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:43,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:43,885 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:43,885 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 139 flow. Second operand 4 states and 554 transitions. [2022-12-13 14:40:43,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 328 flow [2022-12-13 14:40:43,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:40:43,887 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 137 flow [2022-12-13 14:40:43,887 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2022-12-13 14:40:43,888 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2022-12-13 14:40:43,888 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 137 flow [2022-12-13 14:40:43,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:43,888 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:43,888 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:43,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:40:43,888 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash -215647087, now seen corresponding path program 1 times [2022-12-13 14:40:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:43,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733434503] [2022-12-13 14:40:43,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:43,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:44,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733434503] [2022-12-13 14:40:44,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733434503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:44,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:44,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:40:44,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808042861] [2022-12-13 14:40:44,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:44,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:40:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:40:44,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:40:44,096 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 310 [2022-12-13 14:40:44,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:44,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:44,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 310 [2022-12-13 14:40:44,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:44,522 INFO L130 PetriNetUnfolder]: 2032/3251 cut-off events. [2022-12-13 14:40:44,522 INFO L131 PetriNetUnfolder]: For 692/692 co-relation queries the response was YES. [2022-12-13 14:40:44,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8650 conditions, 3251 events. 2032/3251 cut-off events. For 692/692 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 19642 event pairs, 910 based on Foata normal form. 60/2986 useless extension candidates. Maximal degree in co-relation 8642. Up to 1775 conditions per place. [2022-12-13 14:40:44,530 INFO L137 encePairwiseOnDemand]: 303/310 looper letters, 55 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2022-12-13 14:40:44,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 351 flow [2022-12-13 14:40:44,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:40:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:40:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2022-12-13 14:40:44,531 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4443548387096774 [2022-12-13 14:40:44,531 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2022-12-13 14:40:44,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2022-12-13 14:40:44,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:44,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2022-12-13 14:40:44,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:44,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:44,534 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:44,534 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 137 flow. Second operand 4 states and 551 transitions. [2022-12-13 14:40:44,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 351 flow [2022-12-13 14:40:44,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 344 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 14:40:44,535 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 181 flow [2022-12-13 14:40:44,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2022-12-13 14:40:44,536 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2022-12-13 14:40:44,536 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 181 flow [2022-12-13 14:40:44,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:44,536 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:44,536 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:44,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:40:44,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:44,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1815504028, now seen corresponding path program 1 times [2022-12-13 14:40:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:44,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581129075] [2022-12-13 14:40:44,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:44,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:44,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581129075] [2022-12-13 14:40:44,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581129075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:44,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:44,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:40:44,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27379090] [2022-12-13 14:40:44,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:44,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:40:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:44,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:40:44,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:40:44,675 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 310 [2022-12-13 14:40:44,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 181 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:44,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:44,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 310 [2022-12-13 14:40:44,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:45,306 INFO L130 PetriNetUnfolder]: 3374/5421 cut-off events. [2022-12-13 14:40:45,307 INFO L131 PetriNetUnfolder]: For 3566/3638 co-relation queries the response was YES. [2022-12-13 14:40:45,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15518 conditions, 5421 events. 3374/5421 cut-off events. For 3566/3638 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 35942 event pairs, 980 based on Foata normal form. 72/4826 useless extension candidates. Maximal degree in co-relation 15510. Up to 1945 conditions per place. [2022-12-13 14:40:45,329 INFO L137 encePairwiseOnDemand]: 306/310 looper letters, 86 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2022-12-13 14:40:45,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 95 transitions, 613 flow [2022-12-13 14:40:45,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:40:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:40:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2022-12-13 14:40:45,331 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4669354838709677 [2022-12-13 14:40:45,331 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2022-12-13 14:40:45,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2022-12-13 14:40:45,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:45,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2022-12-13 14:40:45,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,334 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 181 flow. Second operand 4 states and 579 transitions. [2022-12-13 14:40:45,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 95 transitions, 613 flow [2022-12-13 14:40:45,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 95 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 14:40:45,351 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 200 flow [2022-12-13 14:40:45,351 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-13 14:40:45,351 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -14 predicate places. [2022-12-13 14:40:45,352 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 200 flow [2022-12-13 14:40:45,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,352 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:45,352 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:45,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:40:45,353 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:45,353 INFO L85 PathProgramCache]: Analyzing trace with hash 66710240, now seen corresponding path program 1 times [2022-12-13 14:40:45,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:45,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672071096] [2022-12-13 14:40:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:45,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:45,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672071096] [2022-12-13 14:40:45,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672071096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:45,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:45,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:40:45,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307561382] [2022-12-13 14:40:45,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:45,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:40:45,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:45,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:40:45,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:40:45,481 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 310 [2022-12-13 14:40:45,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 200 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:45,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 310 [2022-12-13 14:40:45,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:45,807 INFO L130 PetriNetUnfolder]: 1475/2670 cut-off events. [2022-12-13 14:40:45,807 INFO L131 PetriNetUnfolder]: For 1671/1762 co-relation queries the response was YES. [2022-12-13 14:40:45,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7856 conditions, 2670 events. 1475/2670 cut-off events. For 1671/1762 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17544 event pairs, 448 based on Foata normal form. 108/2455 useless extension candidates. Maximal degree in co-relation 7845. Up to 2187 conditions per place. [2022-12-13 14:40:45,816 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 45 selfloop transitions, 4 changer transitions 17/73 dead transitions. [2022-12-13 14:40:45,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 449 flow [2022-12-13 14:40:45,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:40:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:40:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2022-12-13 14:40:45,818 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-13 14:40:45,818 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2022-12-13 14:40:45,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2022-12-13 14:40:45,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:45,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2022-12-13 14:40:45,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,821 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 310.0) internal successors, (1860), 6 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,821 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 200 flow. Second operand 5 states and 682 transitions. [2022-12-13 14:40:45,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 449 flow [2022-12-13 14:40:45,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:40:45,830 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 232 flow [2022-12-13 14:40:45,830 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-12-13 14:40:45,830 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -9 predicate places. [2022-12-13 14:40:45,830 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 232 flow [2022-12-13 14:40:45,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:45,830 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:45,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:40:45,831 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash 452622383, now seen corresponding path program 1 times [2022-12-13 14:40:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:45,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887674352] [2022-12-13 14:40:45,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:45,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:45,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887674352] [2022-12-13 14:40:45,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887674352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:45,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:45,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:40:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059243487] [2022-12-13 14:40:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:45,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:40:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:40:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:40:45,998 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 310 [2022-12-13 14:40:45,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:45,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:45,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 310 [2022-12-13 14:40:45,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:46,198 INFO L130 PetriNetUnfolder]: 407/868 cut-off events. [2022-12-13 14:40:46,198 INFO L131 PetriNetUnfolder]: For 987/1032 co-relation queries the response was YES. [2022-12-13 14:40:46,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 868 events. 407/868 cut-off events. For 987/1032 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4911 event pairs, 72 based on Foata normal form. 72/870 useless extension candidates. Maximal degree in co-relation 3104. Up to 486 conditions per place. [2022-12-13 14:40:46,201 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 50 selfloop transitions, 7 changer transitions 17/81 dead transitions. [2022-12-13 14:40:46,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 556 flow [2022-12-13 14:40:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:40:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:40:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2022-12-13 14:40:46,202 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.439247311827957 [2022-12-13 14:40:46,202 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2022-12-13 14:40:46,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2022-12-13 14:40:46,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:46,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2022-12-13 14:40:46,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,206 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 310.0) internal successors, (2170), 7 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,206 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 232 flow. Second operand 6 states and 817 transitions. [2022-12-13 14:40:46,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 556 flow [2022-12-13 14:40:46,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 550 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 14:40:46,209 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 275 flow [2022-12-13 14:40:46,209 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2022-12-13 14:40:46,210 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -5 predicate places. [2022-12-13 14:40:46,210 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 275 flow [2022-12-13 14:40:46,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,210 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:46,210 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:46,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 14:40:46,210 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:46,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:46,211 INFO L85 PathProgramCache]: Analyzing trace with hash 434769177, now seen corresponding path program 1 times [2022-12-13 14:40:46,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:46,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119040875] [2022-12-13 14:40:46,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:46,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:46,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:46,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119040875] [2022-12-13 14:40:46,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119040875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:46,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:46,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:40:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800447859] [2022-12-13 14:40:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:46,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:40:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:46,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:40:46,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:40:46,339 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 310 [2022-12-13 14:40:46,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:46,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 310 [2022-12-13 14:40:46,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:46,594 INFO L130 PetriNetUnfolder]: 602/1320 cut-off events. [2022-12-13 14:40:46,594 INFO L131 PetriNetUnfolder]: For 2804/2851 co-relation queries the response was YES. [2022-12-13 14:40:46,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5244 conditions, 1320 events. 602/1320 cut-off events. For 2804/2851 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8318 event pairs, 163 based on Foata normal form. 14/1218 useless extension candidates. Maximal degree in co-relation 5228. Up to 642 conditions per place. [2022-12-13 14:40:46,598 INFO L137 encePairwiseOnDemand]: 307/310 looper letters, 88 selfloop transitions, 2 changer transitions 1/97 dead transitions. [2022-12-13 14:40:46,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 97 transitions, 749 flow [2022-12-13 14:40:46,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:40:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:40:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2022-12-13 14:40:46,600 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4653225806451613 [2022-12-13 14:40:46,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2022-12-13 14:40:46,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2022-12-13 14:40:46,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:46,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2022-12-13 14:40:46,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,603 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 310.0) internal successors, (1550), 5 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,603 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 275 flow. Second operand 4 states and 577 transitions. [2022-12-13 14:40:46,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 97 transitions, 749 flow [2022-12-13 14:40:46,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 97 transitions, 675 flow, removed 28 selfloop flow, removed 4 redundant places. [2022-12-13 14:40:46,610 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 258 flow [2022-12-13 14:40:46,610 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2022-12-13 14:40:46,611 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -6 predicate places. [2022-12-13 14:40:46,611 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 258 flow [2022-12-13 14:40:46,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,611 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:46,611 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:46,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 14:40:46,611 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash 559759609, now seen corresponding path program 2 times [2022-12-13 14:40:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:46,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694384631] [2022-12-13 14:40:46,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:40:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:40:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:40:46,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694384631] [2022-12-13 14:40:46,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694384631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:40:46,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:40:46,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:40:46,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546613327] [2022-12-13 14:40:46,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:40:46,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:40:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:40:46,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:40:46,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:40:46,782 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 310 [2022-12-13 14:40:46,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:40:46,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 310 [2022-12-13 14:40:46,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:40:46,971 INFO L130 PetriNetUnfolder]: 237/563 cut-off events. [2022-12-13 14:40:46,971 INFO L131 PetriNetUnfolder]: For 779/828 co-relation queries the response was YES. [2022-12-13 14:40:46,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 563 events. 237/563 cut-off events. For 779/828 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3198 event pairs, 33 based on Foata normal form. 70/611 useless extension candidates. Maximal degree in co-relation 2073. Up to 193 conditions per place. [2022-12-13 14:40:46,974 INFO L137 encePairwiseOnDemand]: 304/310 looper letters, 35 selfloop transitions, 10 changer transitions 9/60 dead transitions. [2022-12-13 14:40:46,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 427 flow [2022-12-13 14:40:46,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:40:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 14:40:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 933 transitions. [2022-12-13 14:40:46,977 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42995391705069125 [2022-12-13 14:40:46,977 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 933 transitions. [2022-12-13 14:40:46,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 933 transitions. [2022-12-13 14:40:46,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:40:46,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 933 transitions. [2022-12-13 14:40:46,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,980 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 310.0) internal successors, (2480), 8 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,980 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 258 flow. Second operand 7 states and 933 transitions. [2022-12-13 14:40:46,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 427 flow [2022-12-13 14:40:46,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 376 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 14:40:46,983 INFO L231 Difference]: Finished difference. Result has 60 places, 35 transitions, 185 flow [2022-12-13 14:40:46,983 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=310, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=185, PETRI_PLACES=60, PETRI_TRANSITIONS=35} [2022-12-13 14:40:46,983 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -7 predicate places. [2022-12-13 14:40:46,983 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 185 flow [2022-12-13 14:40:46,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:40:46,984 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:40:46,984 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] [2022-12-13 14:40:46,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 14:40:46,984 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:40:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:40:46,984 INFO L85 PathProgramCache]: Analyzing trace with hash 995407982, now seen corresponding path program 1 times [2022-12-13 14:40:46,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:40:46,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49324937] [2022-12-13 14:40:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:40:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:40:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:40:47,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:40:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:40:47,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:40:47,085 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 14:40:47,086 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-12-13 14:40:47,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-12-13 14:40:47,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-12-13 14:40:47,090 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-12-13 14:40:47,091 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-12-13 14:40:47,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 14:40:47,091 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:40:47,096 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 14:40:47,096 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:40:47,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:40:47 BasicIcfg [2022-12-13 14:40:47,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:40:47,139 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:40:47,140 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:40:47,140 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:40:47,140 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:40:32" (3/4) ... [2022-12-13 14:40:47,142 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 14:40:47,142 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:40:47,142 INFO L158 Benchmark]: Toolchain (without parser) took 16137.13ms. Allocated memory was 157.3MB in the beginning and 532.7MB in the end (delta: 375.4MB). Free memory was 121.1MB in the beginning and 291.8MB in the end (delta: -170.7MB). Peak memory consumption was 206.3MB. Max. memory is 16.1GB. [2022-12-13 14:40:47,142 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:40:47,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.49ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 94.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 14:40:47,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.40ms. Allocated memory is still 157.3MB. Free memory was 94.8MB in the beginning and 92.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:40:47,143 INFO L158 Benchmark]: Boogie Preprocessor took 21.32ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:40:47,143 INFO L158 Benchmark]: RCFGBuilder took 744.91ms. Allocated memory is still 157.3MB. Free memory was 90.6MB in the beginning and 94.9MB in the end (delta: -4.3MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. [2022-12-13 14:40:47,143 INFO L158 Benchmark]: TraceAbstraction took 14971.67ms. Allocated memory was 157.3MB in the beginning and 532.7MB in the end (delta: 375.4MB). Free memory was 94.1MB in the beginning and 291.8MB in the end (delta: -197.6MB). Peak memory consumption was 177.5MB. Max. memory is 16.1GB. [2022-12-13 14:40:47,143 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 532.7MB. Free memory is still 291.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:40:47,144 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.49ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 94.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.40ms. Allocated memory is still 157.3MB. Free memory was 94.8MB in the beginning and 92.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.32ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 90.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 744.91ms. Allocated memory is still 157.3MB. Free memory was 90.6MB in the beginning and 94.9MB in the end (delta: -4.3MB). Peak memory consumption was 51.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14971.67ms. Allocated memory was 157.3MB in the beginning and 532.7MB in the end (delta: 375.4MB). Free memory was 94.1MB in the beginning and 291.8MB in the end (delta: -197.6MB). Peak memory consumption was 177.5MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 532.7MB. Free memory is still 291.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 171 PlacesBefore, 67 PlacesAfterwards, 163 TransitionsBefore, 58 TransitionsAfterwards, 4704 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 144 TotalNumberOfCompositions, 17372 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7313, independent: 6911, independent conditional: 0, independent unconditional: 6911, dependent: 402, dependent conditional: 0, dependent unconditional: 402, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2314, independent: 2244, independent conditional: 0, independent unconditional: 2244, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7313, independent: 4667, independent conditional: 0, independent unconditional: 4667, dependent: 332, dependent conditional: 0, dependent unconditional: 332, unknown: 2314, unknown conditional: 0, unknown unconditional: 2314] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 348, Positive conditional cache size: 0, Positive unconditional cache size: 348, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t2061; [L837] FCALL, FORK 0 pthread_create(&t2061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2061, ((void *)0), P0, ((void *)0))=-2, t2061={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t2062; [L839] FCALL, FORK 0 pthread_create(&t2062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2062, ((void *)0), P1, ((void *)0))=-1, t2061={6:0}, t2062={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t2063; [L841] FCALL, FORK 0 pthread_create(&t2063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2063, ((void *)0), P2, ((void *)0))=0, t2061={6:0}, t2062={7:0}, t2063={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2061={6:0}, t2062={7:0}, t2063={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=255, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=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: -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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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, 208 locations, 53 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: 14.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 686 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1342 IncrementalHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 39 mSDtfsCounter, 1342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=11, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-12-13 14:40:47,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8 --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 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e --- 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-2329fc7 [2022-12-13 14:40:48,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:40:48,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:40:48,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:40:48,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:40:48,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:40:48,775 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:40:48,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:40:48,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:40:48,779 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:40:48,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:40:48,781 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:40:48,781 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:40:48,782 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:40:48,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:40:48,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:40:48,785 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:40:48,786 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:40:48,787 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:40:48,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:40:48,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:40:48,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:40:48,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:40:48,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:40:48,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:40:48,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:40:48,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:40:48,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:40:48,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:40:48,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:40:48,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:40:48,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:40:48,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:40:48,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:40:48,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:40:48,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:40:48,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:40:48,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:40:48,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:40:48,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:40:48,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:40:48,812 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 14:40:48,835 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:40:48,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:40:48,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:40:48,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:40:48,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:40:48,837 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:40:48,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:40:48,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:40:48,838 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:40:48,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:40:48,838 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:40:48,838 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:40:48,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:40:48,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:40:48,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:40:48,839 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:40:48,839 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:40:48,839 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 14:40:48,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:40:48,840 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:40:48,840 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 14:40:48,840 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 14:40:48,840 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:40:48,841 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:40:48,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:40:48,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:40:48,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:40:48,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:40:48,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:40:48,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:40:48,842 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 14:40:48,842 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 14:40:48,842 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:40:48,843 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:40:48,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:40:48,843 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 14:40:48,843 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:40:48,843 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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8 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 -> 68631ae83b11f8573706de51209bda75798bffba6e8c7fbfd0f4547966fed62e [2022-12-13 14:40:49,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:40:49,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:40:49,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:40:49,094 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:40:49,094 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:40:49,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2022-12-13 14:40:51,687 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:40:51,896 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:40:51,897 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i [2022-12-13 14:40:51,908 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/data/91f246fc6/5fc73e00a22249b9964dc15faf5a9127/FLAG18e5fe01a [2022-12-13 14:40:51,922 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/data/91f246fc6/5fc73e00a22249b9964dc15faf5a9127 [2022-12-13 14:40:51,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:40:51,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:40:51,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:40:51,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:40:51,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:40:51,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:40:51" (1/1) ... [2022-12-13 14:40:51,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60222cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:51, skipping insertion in model container [2022-12-13 14:40:51,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:40:51" (1/1) ... [2022-12-13 14:40:51,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:40:51,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:40:52,100 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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i[993,1006] [2022-12-13 14:40:52,234 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:40:52,277 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:40:52,287 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_0a30cfe8-2158-44a0-8754-a67cdb500b8d/sv-benchmarks/c/pthread-wmm/safe012_rmo.oepc.i[993,1006] [2022-12-13 14:40:52,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:40:52,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:40:52,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:40:52,370 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:40:52,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52 WrapperNode [2022-12-13 14:40:52,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:40:52,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:40:52,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:40:52,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:40:52,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,419 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 138 [2022-12-13 14:40:52,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:40:52,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:40:52,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:40:52,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:40:52,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,447 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:40:52,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:40:52,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:40:52,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:40:52,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (1/1) ... [2022-12-13 14:40:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:40:52,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:40:52,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:40:52,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:40:52,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 14:40:52,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 14:40:52,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:40:52,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:40:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:40:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 14:40:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 14:40:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 14:40:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 14:40:52,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 14:40:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 14:40:52,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 14:40:52,517 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 14:40:52,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 14:40:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 14:40:52,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:40:52,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:40:52,519 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 14:40:52,654 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:40:52,656 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:40:53,076 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:40:53,340 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:40:53,340 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:40:53,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:40:53 BoogieIcfgContainer [2022-12-13 14:40:53,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:40:53,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:40:53,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:40:53,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:40:53,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:40:51" (1/3) ... [2022-12-13 14:40:53,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6434bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:40:53, skipping insertion in model container [2022-12-13 14:40:53,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:40:52" (2/3) ... [2022-12-13 14:40:53,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6434bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:40:53, skipping insertion in model container [2022-12-13 14:40:53,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:40:53" (3/3) ... [2022-12-13 14:40:53,351 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_rmo.oepc.i [2022-12-13 14:40:53,370 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:40:53,370 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-12-13 14:40:53,370 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 14:40:53,449 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 14:40:53,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 167 transitions, 349 flow [2022-12-13 14:40:53,552 INFO L130 PetriNetUnfolder]: 2/164 cut-off events. [2022-12-13 14:40:53,552 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:40:53,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 2/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 179 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 14:40:53,558 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 167 transitions, 349 flow [2022-12-13 14:40:53,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 164 transitions, 337 flow [2022-12-13 14:40:53,567 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 14:40:53,578 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 164 transitions, 337 flow [2022-12-13 14:40:53,580 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 164 transitions, 337 flow [2022-12-13 14:40:53,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 337 flow [2022-12-13 14:40:53,627 INFO L130 PetriNetUnfolder]: 2/164 cut-off events. [2022-12-13 14:40:53,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:40:53,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 164 events. 2/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 178 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-13 14:40:53,632 INFO L119 LiptonReduction]: Number of co-enabled transitions 4704 [2022-12-13 14:41:08,008 INFO L134 LiptonReduction]: Checked pairs total: 17420 [2022-12-13 14:41:08,008 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-12-13 14:41:08,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:41:08,028 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;@cca52a3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:41:08,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-12-13 14:41:08,030 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 14:41:08,030 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:41:08,030 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:41:08,031 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 14:41:08,031 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:41:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash 822, now seen corresponding path program 1 times [2022-12-13 14:41:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:41:08,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245941301] [2022-12-13 14:41:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:08,047 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-12-13 14:41:08,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:41:08,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:08,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:08,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 14:41:08,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:08,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:41:08,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:41:08,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245941301] [2022-12-13 14:41:08,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245941301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:08,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:08,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 14:41:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154746236] [2022-12-13 14:41:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:08,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 14:41:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:41:08,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 14:41:08,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 14:41:08,146 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 312 [2022-12-13 14:41:08,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 125 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:08,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:41:08,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 312 [2022-12-13 14:41:08,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:41:09,021 INFO L130 PetriNetUnfolder]: 4688/6840 cut-off events. [2022-12-13 14:41:09,021 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 14:41:09,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13641 conditions, 6840 events. 4688/6840 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 42210 event pairs, 4688 based on Foata normal form. 0/3698 useless extension candidates. Maximal degree in co-relation 13630. Up to 6755 conditions per place. [2022-12-13 14:41:09,057 INFO L137 encePairwiseOnDemand]: 295/312 looper letters, 34 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2022-12-13 14:41:09,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 157 flow [2022-12-13 14:41:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 14:41:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 14:41:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions. [2022-12-13 14:41:09,070 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5144230769230769 [2022-12-13 14:41:09,071 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 321 transitions. [2022-12-13 14:41:09,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 321 transitions. [2022-12-13 14:41:09,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:41:09,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 321 transitions. [2022-12-13 14:41:09,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 160.5) internal successors, (321), 2 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-12-13 14:41:09,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:09,083 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:09,084 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 125 flow. Second operand 2 states and 321 transitions. [2022-12-13 14:41:09,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 157 flow [2022-12-13 14:41:09,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 14:41:09,090 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2022-12-13 14:41:09,092 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-13 14:41:09,095 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2022-12-13 14:41:09,095 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2022-12-13 14:41:09,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:09,095 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:41:09,095 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 14:41:09,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:41:09,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:09,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:41:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:09,299 INFO L85 PathProgramCache]: Analyzing trace with hash 811588, now seen corresponding path program 1 times [2022-12-13 14:41:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:41:09,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739156085] [2022-12-13 14:41:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:09,302 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-12-13 14:41:09,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:41:09,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:09,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:09,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 14:41:09,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:09,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:41:09,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 14:41:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:09,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:41:09,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:41:09,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739156085] [2022-12-13 14:41:09,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739156085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:09,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:09,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:41:09,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357466618] [2022-12-13 14:41:09,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:09,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:41:09,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:41:09,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:41:09,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:41:09,710 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 312 [2022-12-13 14:41:09,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:09,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:41:09,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 312 [2022-12-13 14:41:09,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:41:10,248 INFO L130 PetriNetUnfolder]: 2075/3113 cut-off events. [2022-12-13 14:41:10,248 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:41:10,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6194 conditions, 3113 events. 2075/3113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 17465 event pairs, 2075 based on Foata normal form. 0/2062 useless extension candidates. Maximal degree in co-relation 6191. Up to 3044 conditions per place. [2022-12-13 14:41:10,267 INFO L137 encePairwiseOnDemand]: 305/312 looper letters, 27 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2022-12-13 14:41:10,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 130 flow [2022-12-13 14:41:10,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:41:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:41:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-12-13 14:41:10,269 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4658119658119658 [2022-12-13 14:41:10,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-12-13 14:41:10,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-12-13 14:41:10,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:41:10,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-12-13 14:41:10,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:10,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:10,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:10,273 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 436 transitions. [2022-12-13 14:41:10,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 130 flow [2022-12-13 14:41:10,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 14:41:10,273 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2022-12-13 14:41:10,274 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-13 14:41:10,274 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2022-12-13 14:41:10,274 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2022-12-13 14:41:10,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:10,275 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:41:10,275 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 14:41:10,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 14:41:10,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:10,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:41:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash 811587, now seen corresponding path program 1 times [2022-12-13 14:41:10,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:41:10,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956535946] [2022-12-13 14:41:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:10,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 14:41:10,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:41:10,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:10,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:10,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:41:10,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:10,645 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 14:41:10,646 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 14:41:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:10,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:41:10,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:41:10,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956535946] [2022-12-13 14:41:10,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956535946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:10,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:10,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:41:10,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113764249] [2022-12-13 14:41:10,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:10,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:41:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:41:10,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:41:10,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:41:10,731 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 312 [2022-12-13 14:41:10,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:10,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:41:10,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 312 [2022-12-13 14:41:10,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:41:11,028 INFO L130 PetriNetUnfolder]: 1234/1881 cut-off events. [2022-12-13 14:41:11,028 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:41:11,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3759 conditions, 1881 events. 1234/1881 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9589 event pairs, 698 based on Foata normal form. 63/1559 useless extension candidates. Maximal degree in co-relation 3755. Up to 1053 conditions per place. [2022-12-13 14:41:11,035 INFO L137 encePairwiseOnDemand]: 304/312 looper letters, 32 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2022-12-13 14:41:11,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 154 flow [2022-12-13 14:41:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:41:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:41:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-12-13 14:41:11,036 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46260683760683763 [2022-12-13 14:41:11,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-12-13 14:41:11,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-12-13 14:41:11,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:41:11,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-12-13 14:41:11,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:11,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:11,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 312.0) internal successors, (1248), 4 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:11,040 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 433 transitions. [2022-12-13 14:41:11,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 154 flow [2022-12-13 14:41:11,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 14:41:11,041 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 85 flow [2022-12-13 14:41:11,041 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-12-13 14:41:11,041 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2022-12-13 14:41:11,041 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 85 flow [2022-12-13 14:41:11,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:11,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:41:11,042 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:11,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 14:41:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:11,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:41:11,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:11,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2116885166, now seen corresponding path program 1 times [2022-12-13 14:41:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:41:11,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208754140] [2022-12-13 14:41:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:11,244 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-12-13 14:41:11,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:41:11,246 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:11,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:11,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:41:11,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:11,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:41:11,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:41:11,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208754140] [2022-12-13 14:41:11,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208754140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:11,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:11,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:41:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922448551] [2022-12-13 14:41:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:11,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:41:11,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:41:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:41:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:41:11,484 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 312 [2022-12-13 14:41:11,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:11,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:41:11,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 312 [2022-12-13 14:41:11,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:41:11,839 INFO L130 PetriNetUnfolder]: 625/1056 cut-off events. [2022-12-13 14:41:11,839 INFO L131 PetriNetUnfolder]: For 48/60 co-relation queries the response was YES. [2022-12-13 14:41:11,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 1056 events. 625/1056 cut-off events. For 48/60 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5371 event pairs, 187 based on Foata normal form. 36/948 useless extension candidates. Maximal degree in co-relation 2259. Up to 906 conditions per place. [2022-12-13 14:41:11,843 INFO L137 encePairwiseOnDemand]: 306/312 looper letters, 33 selfloop transitions, 4 changer transitions 15/58 dead transitions. [2022-12-13 14:41:11,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 245 flow [2022-12-13 14:41:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:41:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:41:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2022-12-13 14:41:11,845 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2022-12-13 14:41:11,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2022-12-13 14:41:11,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2022-12-13 14:41:11,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:41:11,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2022-12-13 14:41:11,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:11,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:11,849 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:11,849 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 85 flow. Second operand 5 states and 689 transitions. [2022-12-13 14:41:11,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 245 flow [2022-12-13 14:41:11,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:41:11,850 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 117 flow [2022-12-13 14:41:11,850 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-12-13 14:41:11,851 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2022-12-13 14:41:11,851 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 117 flow [2022-12-13 14:41:11,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:11,851 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:41:11,851 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:11,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:12,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:12,053 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:41:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1218963800, now seen corresponding path program 1 times [2022-12-13 14:41:12,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:41:12,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338038980] [2022-12-13 14:41:12,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:12,057 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-12-13 14:41:12,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:41:12,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:12,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:12,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 14:41:12,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:12,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:41:12,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:41:12,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338038980] [2022-12-13 14:41:12,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338038980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:12,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:12,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:41:12,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921410100] [2022-12-13 14:41:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:12,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:41:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:41:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:41:12,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:41:12,337 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 312 [2022-12-13 14:41:12,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:12,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:41:12,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 312 [2022-12-13 14:41:12,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:41:12,569 INFO L130 PetriNetUnfolder]: 178/369 cut-off events. [2022-12-13 14:41:12,569 INFO L131 PetriNetUnfolder]: For 170/172 co-relation queries the response was YES. [2022-12-13 14:41:12,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 369 events. 178/369 cut-off events. For 170/172 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1513 event pairs, 38 based on Foata normal form. 24/351 useless extension candidates. Maximal degree in co-relation 1001. Up to 199 conditions per place. [2022-12-13 14:41:12,571 INFO L137 encePairwiseOnDemand]: 306/312 looper letters, 39 selfloop transitions, 7 changer transitions 15/67 dead transitions. [2022-12-13 14:41:12,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 347 flow [2022-12-13 14:41:12,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:41:12,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:41:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2022-12-13 14:41:12,574 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4407051282051282 [2022-12-13 14:41:12,574 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 825 transitions. [2022-12-13 14:41:12,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 825 transitions. [2022-12-13 14:41:12,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:41:12,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 825 transitions. [2022-12-13 14:41:12,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:12,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 312.0) internal successors, (2184), 7 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:12,578 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 312.0) internal successors, (2184), 7 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:12,578 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 117 flow. Second operand 6 states and 825 transitions. [2022-12-13 14:41:12,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 347 flow [2022-12-13 14:41:12,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 341 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 14:41:12,580 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 167 flow [2022-12-13 14:41:12,580 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2022-12-13 14:41:12,581 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -14 predicate places. [2022-12-13 14:41:12,581 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 167 flow [2022-12-13 14:41:12,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:12,582 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:41:12,582 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:12,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 14:41:12,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:12,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:41:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:12,785 INFO L85 PathProgramCache]: Analyzing trace with hash -168803220, now seen corresponding path program 1 times [2022-12-13 14:41:12,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:41:12,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910398973] [2022-12-13 14:41:12,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:12,787 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-12-13 14:41:12,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:41:12,790 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:12,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:13,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 14:41:13,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:13,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:41:13,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:41:13,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910398973] [2022-12-13 14:41:13,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910398973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:13,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:13,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:41:13,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099371536] [2022-12-13 14:41:13,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:13,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:41:13,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:41:13,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:41:13,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:41:13,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 312 [2022-12-13 14:41:13,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:13,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:41:13,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 312 [2022-12-13 14:41:13,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:41:13,401 INFO L130 PetriNetUnfolder]: 74/166 cut-off events. [2022-12-13 14:41:13,401 INFO L131 PetriNetUnfolder]: For 199/199 co-relation queries the response was YES. [2022-12-13 14:41:13,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 166 events. 74/166 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 514 event pairs, 19 based on Foata normal form. 8/167 useless extension candidates. Maximal degree in co-relation 516. Up to 59 conditions per place. [2022-12-13 14:41:13,403 INFO L137 encePairwiseOnDemand]: 306/312 looper letters, 32 selfloop transitions, 10 changer transitions 9/56 dead transitions. [2022-12-13 14:41:13,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 331 flow [2022-12-13 14:41:13,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:41:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 14:41:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 942 transitions. [2022-12-13 14:41:13,405 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43131868131868134 [2022-12-13 14:41:13,405 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 942 transitions. [2022-12-13 14:41:13,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 942 transitions. [2022-12-13 14:41:13,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:41:13,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 942 transitions. [2022-12-13 14:41:13,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:13,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 312.0) internal successors, (2496), 8 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:13,409 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 312.0) internal successors, (2496), 8 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:13,409 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 167 flow. Second operand 7 states and 942 transitions. [2022-12-13 14:41:13,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 331 flow [2022-12-13 14:41:13,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 293 flow, removed 14 selfloop flow, removed 5 redundant places. [2022-12-13 14:41:13,412 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 149 flow [2022-12-13 14:41:13,412 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2022-12-13 14:41:13,412 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2022-12-13 14:41:13,413 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 149 flow [2022-12-13 14:41:13,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:13,413 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:41:13,413 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] [2022-12-13 14:41:13,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 14:41:13,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:13,615 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:41:13,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1331602219, now seen corresponding path program 1 times [2022-12-13 14:41:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:41:13,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898252323] [2022-12-13 14:41:13,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:13,619 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-12-13 14:41:13,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:41:13,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:13,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:13,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 14:41:13,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:41:13,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:41:13,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:41:13,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898252323] [2022-12-13 14:41:13,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898252323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:13,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:13,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:41:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3408647] [2022-12-13 14:41:13,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:13,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:41:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:41:13,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:41:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:41:14,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 312 [2022-12-13 14:41:14,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:14,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:41:14,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 312 [2022-12-13 14:41:14,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:41:14,255 INFO L130 PetriNetUnfolder]: 80/173 cut-off events. [2022-12-13 14:41:14,256 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2022-12-13 14:41:14,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 173 events. 80/173 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 592 event pairs, 45 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 511. Up to 119 conditions per place. [2022-12-13 14:41:14,257 INFO L137 encePairwiseOnDemand]: 308/312 looper letters, 37 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-13 14:41:14,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 277 flow [2022-12-13 14:41:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:41:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:41:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2022-12-13 14:41:14,258 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43141025641025643 [2022-12-13 14:41:14,258 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2022-12-13 14:41:14,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2022-12-13 14:41:14,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:41:14,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2022-12-13 14:41:14,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:14,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:14,261 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 312.0) internal successors, (1872), 6 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:14,261 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 149 flow. Second operand 5 states and 673 transitions. [2022-12-13 14:41:14,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 277 flow [2022-12-13 14:41:14,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 233 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-13 14:41:14,262 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 115 flow [2022-12-13 14:41:14,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-12-13 14:41:14,263 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2022-12-13 14:41:14,263 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 115 flow [2022-12-13 14:41:14,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:14,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:41:14,263 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] [2022-12-13 14:41:14,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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)] Ended with exit code 0 [2022-12-13 14:41:14,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:14,465 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:41:14,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash -404168968, now seen corresponding path program 1 times [2022-12-13 14:41:14,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:41:14,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835347946] [2022-12-13 14:41:14,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:14,471 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-12-13 14:41:14,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:41:14,475 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:14,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:41:14,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:41:14,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:41:15,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-12-13 14:41:15,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:41:15,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:41:15,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835347946] [2022-12-13 14:41:15,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835347946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:41:15,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:41:15,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:41:15,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468165491] [2022-12-13 14:41:15,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:41:15,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:41:15,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:41:15,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:41:15,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:41:15,152 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 312 [2022-12-13 14:41:15,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 115 flow. Second operand has 5 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-12-13 14:41:15,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:41:15,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 312 [2022-12-13 14:41:15,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:41:15,304 INFO L130 PetriNetUnfolder]: 80/172 cut-off events. [2022-12-13 14:41:15,304 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2022-12-13 14:41:15,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 172 events. 80/172 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 587 event pairs, 45 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 488. Up to 121 conditions per place. [2022-12-13 14:41:15,305 INFO L137 encePairwiseOnDemand]: 309/312 looper letters, 37 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-12-13 14:41:15,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 235 flow [2022-12-13 14:41:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:41:15,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:41:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2022-12-13 14:41:15,306 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44551282051282054 [2022-12-13 14:41:15,306 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2022-12-13 14:41:15,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2022-12-13 14:41:15,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:41:15,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2022-12-13 14:41:15,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:15,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:15,309 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 312.0) internal successors, (1560), 5 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:41:15,309 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 115 flow. Second operand 4 states and 556 transitions. [2022-12-13 14:41:15,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 235 flow [2022-12-13 14:41:15,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 14:41:15,310 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2022-12-13 14:41:15,311 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=312, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2022-12-13 14:41:15,311 INFO L288 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2022-12-13 14:41:15,311 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2022-12-13 14:41:15,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-12-13 14:41:15,311 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:41:15,312 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] [2022-12-13 14:41:15,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 14:41:15,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:15,513 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-12-13 14:41:15,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:41:15,514 INFO L85 PathProgramCache]: Analyzing trace with hash -404168669, now seen corresponding path program 1 times [2022-12-13 14:41:15,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:41:15,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627095172] [2022-12-13 14:41:15,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:41:15,515 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-12-13 14:41:15,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:41:15,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:15,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:41:15,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:41:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:41:15,881 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 14:41:15,881 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 14:41:15,882 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-12-13 14:41:15,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-12-13 14:41:15,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-12-13 14:41:15,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-12-13 14:41:15,885 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-12-13 14:41:15,886 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-12-13 14:41:15,887 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-12-13 14:41:15,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-12-13 14:41:15,888 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-12-13 14:41:15,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 14:41:16,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/mathsat -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-12-13 14:41:16,090 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:41:16,106 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 14:41:16,106 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:41:16,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:41:16 BasicIcfg [2022-12-13 14:41:16,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:41:16,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:41:16,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:41:16,181 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:41:16,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:40:53" (3/4) ... [2022-12-13 14:41:16,184 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 14:41:16,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:41:16,185 INFO L158 Benchmark]: Toolchain (without parser) took 24259.29ms. Allocated memory was 67.1MB in the beginning and 343.9MB in the end (delta: 276.8MB). Free memory was 44.7MB in the beginning and 177.7MB in the end (delta: -133.1MB). Peak memory consumption was 143.9MB. Max. memory is 16.1GB. [2022-12-13 14:41:16,185 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:41:16,185 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.73ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 44.4MB in the beginning and 66.7MB in the end (delta: -22.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-12-13 14:41:16,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.70ms. Allocated memory is still 96.5MB. Free memory was 66.7MB in the beginning and 64.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:41:16,186 INFO L158 Benchmark]: Boogie Preprocessor took 33.30ms. Allocated memory is still 96.5MB. Free memory was 64.5MB in the beginning and 62.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:41:16,186 INFO L158 Benchmark]: RCFGBuilder took 888.93ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 69.4MB in the end (delta: -7.3MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2022-12-13 14:41:16,187 INFO L158 Benchmark]: TraceAbstraction took 22835.28ms. Allocated memory was 96.5MB in the beginning and 343.9MB in the end (delta: 247.5MB). Free memory was 68.7MB in the beginning and 178.8MB in the end (delta: -110.1MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. [2022-12-13 14:41:16,187 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 343.9MB. Free memory was 178.8MB in the beginning and 177.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:41:16,189 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 45.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.73ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 44.4MB in the beginning and 66.7MB in the end (delta: -22.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.70ms. Allocated memory is still 96.5MB. Free memory was 66.7MB in the beginning and 64.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.30ms. Allocated memory is still 96.5MB. Free memory was 64.5MB in the beginning and 62.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 888.93ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 69.4MB in the end (delta: -7.3MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22835.28ms. Allocated memory was 96.5MB in the beginning and 343.9MB in the end (delta: 247.5MB). Free memory was 68.7MB in the beginning and 178.8MB in the end (delta: -110.1MB). Peak memory consumption was 136.8MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 343.9MB. Free memory was 178.8MB in the beginning and 177.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.4s, 172 PlacesBefore, 67 PlacesAfterwards, 164 TransitionsBefore, 58 TransitionsAfterwards, 4704 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 17420 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7880, independent: 7476, independent conditional: 0, independent unconditional: 7476, dependent: 404, dependent conditional: 0, dependent unconditional: 404, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2323, independent: 2246, independent conditional: 0, independent unconditional: 2246, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7880, independent: 5230, independent conditional: 0, independent unconditional: 5230, dependent: 327, dependent conditional: 0, dependent unconditional: 327, unknown: 2323, unknown conditional: 0, unknown unconditional: 2323] , Statistics on independence cache: Total cache size (in pairs): 411, Positive cache size: 377, Positive conditional cache size: 0, Positive unconditional cache size: 377, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t2061; [L837] FCALL, FORK 0 pthread_create(&t2061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2061, ((void *)0), P0, ((void *)0))=0, t2061={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t2062; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L839] FCALL, FORK 0 pthread_create(&t2062, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2062, ((void *)0), P1, ((void *)0))=1, t2061={15:0}, t2062={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L840] 0 pthread_t t2063; [L841] FCALL, FORK 0 pthread_create(&t2063, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2063, ((void *)0), P2, ((void *)0))=2, t2061={15:0}, t2062={5:0}, t2063={7:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2061={15:0}, t2062={5:0}, t2063={7:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=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: -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: 834]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: 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, 209 locations, 53 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 542 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 122 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=5, InterpolantAutomatonStates: 35, 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.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 446 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-12-13 14:41:16,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a30cfe8-2158-44a0-8754-a67cdb500b8d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample