./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 --- 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-14 15:23:39,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:23:39,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:23:39,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:23:39,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:23:39,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:23:39,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:23:39,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:23:39,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:23:39,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:23:39,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:23:39,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:23:39,519 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:23:39,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:23:39,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:23:39,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:23:39,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:23:39,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:23:39,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:23:39,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:23:39,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:23:39,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:23:39,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:23:39,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:23:39,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:23:39,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:23:39,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:23:39,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:23:39,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:23:39,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:23:39,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:23:39,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:23:39,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:23:39,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:23:39,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:23:39,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:23:39,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:23:39,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:23:39,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:23:39,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:23:39,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:23:39,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 15:23:39,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:23:39,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:23:39,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:23:39,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:23:39,550 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:23:39,550 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:23:39,551 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:23:39,551 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:23:39,551 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:23:39,551 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:23:39,551 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:23:39,551 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:23:39,551 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:23:39,551 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:23:39,551 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:23:39,552 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:23:39,552 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:23:39,552 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:23:39,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:23:39,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:23:39,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:23:39,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:23:39,553 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:23:39,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:23:39,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:23:39,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:23:39,553 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:23:39,553 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:23:39,554 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:23:39,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:23:39,554 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:23:39,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:23:39,554 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:23:39,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:23:39,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:23:39,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:23:39,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:23:39,555 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:23:39,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:23:39,555 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:23:39,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:23:39,555 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:23:39,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/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_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 [2022-12-14 15:23:39,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:23:39,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:23:39,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:23:39,768 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:23:39,768 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:23:39,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i [2022-12-14 15:23:42,283 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:23:42,498 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:23:42,499 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i [2022-12-14 15:23:42,511 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/data/2eb962e8b/78509432edcc4f2c835c9453b3e180a3/FLAGdbcfe3ee7 [2022-12-14 15:23:42,860 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/data/2eb962e8b/78509432edcc4f2c835c9453b3e180a3 [2022-12-14 15:23:42,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:23:42,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:23:42,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:23:42,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:23:42,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:23:42,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:23:42" (1/1) ... [2022-12-14 15:23:42,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c966dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:42, skipping insertion in model container [2022-12-14 15:23:42,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:23:42" (1/1) ... [2022-12-14 15:23:42,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:23:42,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:23:43,049 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_70c6d80a-0b75-425f-aee0-8dfc29790043/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i[992,1005] [2022-12-14 15:23:43,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:23:43,241 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:23:43,250 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_70c6d80a-0b75-425f-aee0-8dfc29790043/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i[992,1005] [2022-12-14 15:23:43,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:23:43,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:23:43,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:23:43,335 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:23:43,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43 WrapperNode [2022-12-14 15:23:43,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:23:43,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:23:43,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:23:43,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:23:43,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,381 INFO L138 Inliner]: procedures = 177, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2022-12-14 15:23:43,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:23:43,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:23:43,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:23:43,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:23:43,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,411 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:23:43,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:23:43,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:23:43,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:23:43,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (1/1) ... [2022-12-14 15:23:43,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:23:43,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:23:43,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:23:43,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:23:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 15:23:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 15:23:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 15:23:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:23:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 15:23:43,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:23:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 15:23:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 15:23:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 15:23:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 15:23:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 15:23:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 15:23:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 15:23:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 15:23:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:23:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 15:23:43,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:23:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:23:43,484 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 15:23:43,607 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:23:43,608 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:23:44,057 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:23:44,449 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:23:44,450 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 15:23:44,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:23:44 BoogieIcfgContainer [2022-12-14 15:23:44,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:23:44,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:23:44,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:23:44,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:23:44,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:23:42" (1/3) ... [2022-12-14 15:23:44,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa73891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:23:44, skipping insertion in model container [2022-12-14 15:23:44,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:43" (2/3) ... [2022-12-14 15:23:44,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa73891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:23:44, skipping insertion in model container [2022-12-14 15:23:44,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:23:44" (3/3) ... [2022-12-14 15:23:44,460 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_rmo.opt.i [2022-12-14 15:23:44,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:23:44,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-12-14 15:23:44,476 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 15:23:44,564 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 15:23:44,591 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 15:23:44,603 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 207 transitions, 434 flow [2022-12-14 15:23:44,606 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 207 transitions, 434 flow [2022-12-14 15:23:44,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 207 transitions, 434 flow [2022-12-14 15:23:44,681 INFO L130 PetriNetUnfolder]: 2/203 cut-off events. [2022-12-14 15:23:44,681 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 15:23:44,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 2/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 299 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 140. Up to 2 conditions per place. [2022-12-14 15:23:44,693 INFO L119 LiptonReduction]: Number of co-enabled transitions 10234 [2022-12-14 15:23:59,137 INFO L134 LiptonReduction]: Checked pairs total: 44098 [2022-12-14 15:23:59,137 INFO L136 LiptonReduction]: Total number of compositions: 196 [2022-12-14 15:23:59,143 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 102 places, 90 transitions, 200 flow [2022-12-14 15:24:08,457 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 447748 states, 374830 states have (on average 5.528615639089721) internal successors, (2072291), 447747 states have internal predecessors, (2072291), 0 states have call successors, (0), 0 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-14 15:24:08,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:24:08,482 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=FINITE_AUTOMATA, 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;@798b1a26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:24:08,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2022-12-14 15:24:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 447748 states, 374830 states have (on average 5.528615639089721) internal successors, (2072291), 447747 states have internal predecessors, (2072291), 0 states have call successors, (0), 0 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-14 15:24:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 15:24:08,984 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:08,984 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 15:24:08,984 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:08,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:08,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1180, now seen corresponding path program 1 times [2022-12-14 15:24:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:08,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881589679] [2022-12-14 15:24:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:08,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:09,089 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-14 15:24:09,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:09,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881589679] [2022-12-14 15:24:09,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881589679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:09,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:09,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 15:24:09,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125490516] [2022-12-14 15:24:09,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:09,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 15:24:09,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 15:24:09,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:24:09,692 INFO L87 Difference]: Start difference. First operand has 447748 states, 374830 states have (on average 5.528615639089721) internal successors, (2072291), 447747 states have internal predecessors, (2072291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 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-14 15:24:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:11,268 INFO L93 Difference]: Finished difference Result 86644 states and 384011 transitions. [2022-12-14 15:24:11,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 15:24:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-12-14 15:24:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:11,872 INFO L225 Difference]: With dead ends: 86644 [2022-12-14 15:24:11,872 INFO L226 Difference]: Without dead ends: 86644 [2022-12-14 15:24:11,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:24:11,875 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:11,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86644 states. [2022-12-14 15:24:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86644 to 86644. [2022-12-14 15:24:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86644 states, 80030 states have (on average 4.7983381232037985) internal successors, (384011), 86643 states have internal predecessors, (384011), 0 states have call successors, (0), 0 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-14 15:24:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86644 states to 86644 states and 384011 transitions. [2022-12-14 15:24:14,960 INFO L78 Accepts]: Start accepts. Automaton has 86644 states and 384011 transitions. Word has length 1 [2022-12-14 15:24:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:14,960 INFO L495 AbstractCegarLoop]: Abstraction has 86644 states and 384011 transitions. [2022-12-14 15:24:14,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 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-14 15:24:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 86644 states and 384011 transitions. [2022-12-14 15:24:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 15:24:14,961 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:14,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 15:24:14,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:24:14,962 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:14,962 INFO L85 PathProgramCache]: Analyzing trace with hash 36129279, now seen corresponding path program 1 times [2022-12-14 15:24:14,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:14,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568219697] [2022-12-14 15:24:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:15,126 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-14 15:24:15,126 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:15,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568219697] [2022-12-14 15:24:15,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568219697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:15,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:15,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:15,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528987851] [2022-12-14 15:24:15,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:15,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:15,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:15,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:15,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:15,129 INFO L87 Difference]: Start difference. First operand 86644 states and 384011 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-14 15:24:15,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:15,912 INFO L93 Difference]: Finished difference Result 65850 states and 261911 transitions. [2022-12-14 15:24:15,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:15,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 15:24:15,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:16,223 INFO L225 Difference]: With dead ends: 65850 [2022-12-14 15:24:16,223 INFO L226 Difference]: Without dead ends: 65842 [2022-12-14 15:24:16,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:16,224 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:16,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65842 states. [2022-12-14 15:24:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65842 to 58818. [2022-12-14 15:24:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58818 states, 56869 states have (on average 4.416518665705393) internal successors, (251163), 58817 states have internal predecessors, (251163), 0 states have call successors, (0), 0 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-14 15:24:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58818 states to 58818 states and 251163 transitions. [2022-12-14 15:24:18,302 INFO L78 Accepts]: Start accepts. Automaton has 58818 states and 251163 transitions. Word has length 4 [2022-12-14 15:24:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:18,302 INFO L495 AbstractCegarLoop]: Abstraction has 58818 states and 251163 transitions. [2022-12-14 15:24:18,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-14 15:24:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 58818 states and 251163 transitions. [2022-12-14 15:24:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 15:24:18,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:18,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 15:24:18,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:24:18,303 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash 36129280, now seen corresponding path program 1 times [2022-12-14 15:24:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:18,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608819014] [2022-12-14 15:24:18,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:18,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:18,391 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-14 15:24:18,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:18,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608819014] [2022-12-14 15:24:18,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608819014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:18,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:18,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:18,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022728093] [2022-12-14 15:24:18,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:18,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:18,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:18,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:18,393 INFO L87 Difference]: Start difference. First operand 58818 states and 251163 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-14 15:24:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:18,571 INFO L93 Difference]: Finished difference Result 16948 states and 63630 transitions. [2022-12-14 15:24:18,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 15:24:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:18,627 INFO L225 Difference]: With dead ends: 16948 [2022-12-14 15:24:18,627 INFO L226 Difference]: Without dead ends: 16656 [2022-12-14 15:24:18,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:18,628 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:18,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:18,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16656 states. [2022-12-14 15:24:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16656 to 16656. [2022-12-14 15:24:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16656 states, 16462 states have (on average 3.7882395820677925) internal successors, (62362), 16655 states have internal predecessors, (62362), 0 states have call successors, (0), 0 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-14 15:24:19,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16656 states to 16656 states and 62362 transitions. [2022-12-14 15:24:19,080 INFO L78 Accepts]: Start accepts. Automaton has 16656 states and 62362 transitions. Word has length 4 [2022-12-14 15:24:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:19,080 INFO L495 AbstractCegarLoop]: Abstraction has 16656 states and 62362 transitions. [2022-12-14 15:24:19,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-14 15:24:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 16656 states and 62362 transitions. [2022-12-14 15:24:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:24:19,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:19,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:19,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:24:19,082 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:19,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash 572984896, now seen corresponding path program 1 times [2022-12-14 15:24:19,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:19,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272657728] [2022-12-14 15:24:19,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:19,185 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-14 15:24:19,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:19,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272657728] [2022-12-14 15:24:19,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272657728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:19,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:19,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461808437] [2022-12-14 15:24:19,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:19,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:19,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:19,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:19,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:19,187 INFO L87 Difference]: Start difference. First operand 16656 states and 62362 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-14 15:24:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:19,373 INFO L93 Difference]: Finished difference Result 16528 states and 61818 transitions. [2022-12-14 15:24:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:19,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:24:19,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:19,426 INFO L225 Difference]: With dead ends: 16528 [2022-12-14 15:24:19,426 INFO L226 Difference]: Without dead ends: 16528 [2022-12-14 15:24:19,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:19,427 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:19,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16528 states. [2022-12-14 15:24:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16528 to 16528. [2022-12-14 15:24:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16528 states, 16334 states have (on average 3.7846210358760866) internal successors, (61818), 16527 states have internal predecessors, (61818), 0 states have call successors, (0), 0 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-14 15:24:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16528 states to 16528 states and 61818 transitions. [2022-12-14 15:24:19,841 INFO L78 Accepts]: Start accepts. Automaton has 16528 states and 61818 transitions. Word has length 13 [2022-12-14 15:24:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:19,842 INFO L495 AbstractCegarLoop]: Abstraction has 16528 states and 61818 transitions. [2022-12-14 15:24:19,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-14 15:24:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16528 states and 61818 transitions. [2022-12-14 15:24:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:24:19,843 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:19,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:19,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:24:19,843 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:19,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash 597217761, now seen corresponding path program 1 times [2022-12-14 15:24:19,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:19,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352269743] [2022-12-14 15:24:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:19,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:19,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-14 15:24:19,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:19,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352269743] [2022-12-14 15:24:19,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352269743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:19,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:19,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:24:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799971641] [2022-12-14 15:24:19,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:19,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:19,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:19,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:19,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:19,999 INFO L87 Difference]: Start difference. First operand 16528 states and 61818 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-14 15:24:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:20,189 INFO L93 Difference]: Finished difference Result 19744 states and 71428 transitions. [2022-12-14 15:24:20,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:20,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 15:24:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:20,253 INFO L225 Difference]: With dead ends: 19744 [2022-12-14 15:24:20,253 INFO L226 Difference]: Without dead ends: 19744 [2022-12-14 15:24:20,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:20,254 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:20,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19744 states. [2022-12-14 15:24:20,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 16272. [2022-12-14 15:24:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16272 states, 16079 states have (on average 3.7809565271472105) internal successors, (60794), 16271 states have internal predecessors, (60794), 0 states have call successors, (0), 0 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-14 15:24:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16272 states to 16272 states and 60794 transitions. [2022-12-14 15:24:20,593 INFO L78 Accepts]: Start accepts. Automaton has 16272 states and 60794 transitions. Word has length 14 [2022-12-14 15:24:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:20,593 INFO L495 AbstractCegarLoop]: Abstraction has 16272 states and 60794 transitions. [2022-12-14 15:24:20,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-14 15:24:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 16272 states and 60794 transitions. [2022-12-14 15:24:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:24:20,595 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:20,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:20,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:24:20,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:20,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:20,595 INFO L85 PathProgramCache]: Analyzing trace with hash 597217762, now seen corresponding path program 1 times [2022-12-14 15:24:20,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:20,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414117290] [2022-12-14 15:24:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:20,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:20,772 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-14 15:24:20,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:20,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414117290] [2022-12-14 15:24:20,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414117290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:20,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:20,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:24:20,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881809998] [2022-12-14 15:24:20,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:20,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:24:20,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:20,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:24:20,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:24:20,774 INFO L87 Difference]: Start difference. First operand 16272 states and 60794 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-14 15:24:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:21,136 INFO L93 Difference]: Finished difference Result 27932 states and 104298 transitions. [2022-12-14 15:24:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:24:21,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 15:24:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:21,254 INFO L225 Difference]: With dead ends: 27932 [2022-12-14 15:24:21,255 INFO L226 Difference]: Without dead ends: 27932 [2022-12-14 15:24:21,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:24:21,255 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 66 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:21,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 2 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27932 states. [2022-12-14 15:24:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27932 to 16912. [2022-12-14 15:24:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16912 states, 16719 states have (on average 3.7835994975776064) internal successors, (63258), 16911 states have internal predecessors, (63258), 0 states have call successors, (0), 0 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-14 15:24:21,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16912 states to 16912 states and 63258 transitions. [2022-12-14 15:24:21,727 INFO L78 Accepts]: Start accepts. Automaton has 16912 states and 63258 transitions. Word has length 14 [2022-12-14 15:24:21,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:21,727 INFO L495 AbstractCegarLoop]: Abstraction has 16912 states and 63258 transitions. [2022-12-14 15:24:21,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-14 15:24:21,727 INFO L276 IsEmpty]: Start isEmpty. Operand 16912 states and 63258 transitions. [2022-12-14 15:24:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:24:21,728 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:21,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:21,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:24:21,728 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:21,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash 582657616, now seen corresponding path program 1 times [2022-12-14 15:24:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:21,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544413405] [2022-12-14 15:24:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:21,869 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-14 15:24:21,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:21,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544413405] [2022-12-14 15:24:21,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544413405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:21,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:21,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345933735] [2022-12-14 15:24:21,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:21,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:21,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:21,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:21,870 INFO L87 Difference]: Start difference. First operand 16912 states and 63258 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-14 15:24:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:22,049 INFO L93 Difference]: Finished difference Result 16896 states and 63186 transitions. [2022-12-14 15:24:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:22,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 15:24:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:22,103 INFO L225 Difference]: With dead ends: 16896 [2022-12-14 15:24:22,103 INFO L226 Difference]: Without dead ends: 16896 [2022-12-14 15:24:22,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:22,104 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:22,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:22,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16896 states. [2022-12-14 15:24:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16896 to 16896. [2022-12-14 15:24:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16896 states, 16703 states have (on average 3.782913249116925) internal successors, (63186), 16895 states have internal predecessors, (63186), 0 states have call successors, (0), 0 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-14 15:24:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16896 states to 16896 states and 63186 transitions. [2022-12-14 15:24:22,446 INFO L78 Accepts]: Start accepts. Automaton has 16896 states and 63186 transitions. Word has length 14 [2022-12-14 15:24:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:22,447 INFO L495 AbstractCegarLoop]: Abstraction has 16896 states and 63186 transitions. [2022-12-14 15:24:22,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-14 15:24:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 16896 states and 63186 transitions. [2022-12-14 15:24:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:24:22,448 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:22,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:22,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:24:22,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:22,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:22,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1037414408, now seen corresponding path program 2 times [2022-12-14 15:24:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:22,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989655599] [2022-12-14 15:24:22,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:22,672 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-14 15:24:22,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:22,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989655599] [2022-12-14 15:24:22,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989655599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:22,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:22,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:24:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185409556] [2022-12-14 15:24:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:22,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:24:22,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:22,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:24:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:22,674 INFO L87 Difference]: Start difference. First operand 16896 states and 63186 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-14 15:24:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:22,927 INFO L93 Difference]: Finished difference Result 20112 states and 72796 transitions. [2022-12-14 15:24:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:24:22,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 15:24:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:22,994 INFO L225 Difference]: With dead ends: 20112 [2022-12-14 15:24:22,995 INFO L226 Difference]: Without dead ends: 20112 [2022-12-14 15:24:22,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:22,995 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 86 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:22,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:24:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20112 states. [2022-12-14 15:24:23,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20112 to 16000. [2022-12-14 15:24:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16000 states, 15808 states have (on average 3.7764423076923075) internal successors, (59698), 15999 states have internal predecessors, (59698), 0 states have call successors, (0), 0 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-14 15:24:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16000 states to 16000 states and 59698 transitions. [2022-12-14 15:24:23,322 INFO L78 Accepts]: Start accepts. Automaton has 16000 states and 59698 transitions. Word has length 14 [2022-12-14 15:24:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:23,322 INFO L495 AbstractCegarLoop]: Abstraction has 16000 states and 59698 transitions. [2022-12-14 15:24:23,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 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-14 15:24:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 16000 states and 59698 transitions. [2022-12-14 15:24:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:24:23,323 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:23,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:23,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 15:24:23,323 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:23,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:23,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1333876431, now seen corresponding path program 1 times [2022-12-14 15:24:23,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:23,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307750747] [2022-12-14 15:24:23,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:23,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:23,445 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-14 15:24:23,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:23,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307750747] [2022-12-14 15:24:23,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307750747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:23,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:23,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:23,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762533360] [2022-12-14 15:24:23,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:23,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:23,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:23,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:23,446 INFO L87 Difference]: Start difference. First operand 16000 states and 59698 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-14 15:24:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:23,651 INFO L93 Difference]: Finished difference Result 15984 states and 59626 transitions. [2022-12-14 15:24:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:23,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 15:24:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:23,697 INFO L225 Difference]: With dead ends: 15984 [2022-12-14 15:24:23,697 INFO L226 Difference]: Without dead ends: 15984 [2022-12-14 15:24:23,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:23,698 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:23,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15984 states. [2022-12-14 15:24:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15984 to 15984. [2022-12-14 15:24:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15984 states, 15792 states have (on average 3.775709219858156) internal successors, (59626), 15983 states have internal predecessors, (59626), 0 states have call successors, (0), 0 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-14 15:24:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15984 states to 15984 states and 59626 transitions. [2022-12-14 15:24:24,004 INFO L78 Accepts]: Start accepts. Automaton has 15984 states and 59626 transitions. Word has length 15 [2022-12-14 15:24:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:24,004 INFO L495 AbstractCegarLoop]: Abstraction has 15984 states and 59626 transitions. [2022-12-14 15:24:24,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-14 15:24:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 15984 states and 59626 transitions. [2022-12-14 15:24:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:24:24,005 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:24,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:24,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:24:24,006 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash 882688853, now seen corresponding path program 1 times [2022-12-14 15:24:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:24,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903708575] [2022-12-14 15:24:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:24,098 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-14 15:24:24,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:24,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903708575] [2022-12-14 15:24:24,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903708575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:24,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:24,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:24,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014971830] [2022-12-14 15:24:24,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:24,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:24,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:24,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:24,099 INFO L87 Difference]: Start difference. First operand 15984 states and 59626 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-14 15:24:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:24,278 INFO L93 Difference]: Finished difference Result 15912 states and 59320 transitions. [2022-12-14 15:24:24,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:24,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 15:24:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:24,330 INFO L225 Difference]: With dead ends: 15912 [2022-12-14 15:24:24,331 INFO L226 Difference]: Without dead ends: 15912 [2022-12-14 15:24:24,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:24,331 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:24,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:24,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15912 states. [2022-12-14 15:24:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15912 to 15912. [2022-12-14 15:24:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15912 states, 15720 states have (on average 3.7735368956743) internal successors, (59320), 15911 states have internal predecessors, (59320), 0 states have call successors, (0), 0 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-14 15:24:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15912 states to 15912 states and 59320 transitions. [2022-12-14 15:24:24,630 INFO L78 Accepts]: Start accepts. Automaton has 15912 states and 59320 transitions. Word has length 15 [2022-12-14 15:24:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:24,631 INFO L495 AbstractCegarLoop]: Abstraction has 15912 states and 59320 transitions. [2022-12-14 15:24:24,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-14 15:24:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 15912 states and 59320 transitions. [2022-12-14 15:24:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:24:24,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:24,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:24,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 15:24:24,632 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash -381622891, now seen corresponding path program 1 times [2022-12-14 15:24:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:24,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091731465] [2022-12-14 15:24:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:24,728 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-14 15:24:24,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:24,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091731465] [2022-12-14 15:24:24,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091731465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:24,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:24,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:24:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488842852] [2022-12-14 15:24:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:24,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:24:24,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:24,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:24:24,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:24:24,729 INFO L87 Difference]: Start difference. First operand 15912 states and 59320 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-14 15:24:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:24,998 INFO L93 Difference]: Finished difference Result 27279 states and 100894 transitions. [2022-12-14 15:24:24,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:24:24,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:24:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:25,108 INFO L225 Difference]: With dead ends: 27279 [2022-12-14 15:24:25,108 INFO L226 Difference]: Without dead ends: 27279 [2022-12-14 15:24:25,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:25,109 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:25,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 2 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27279 states. [2022-12-14 15:24:25,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27279 to 16668. [2022-12-14 15:24:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16668 states, 16476 states have (on average 3.7746419033746057) internal successors, (62191), 16667 states have internal predecessors, (62191), 0 states have call successors, (0), 0 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-14 15:24:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16668 states to 16668 states and 62191 transitions. [2022-12-14 15:24:25,522 INFO L78 Accepts]: Start accepts. Automaton has 16668 states and 62191 transitions. Word has length 16 [2022-12-14 15:24:25,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:25,522 INFO L495 AbstractCegarLoop]: Abstraction has 16668 states and 62191 transitions. [2022-12-14 15:24:25,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-14 15:24:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 16668 states and 62191 transitions. [2022-12-14 15:24:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:24:25,524 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:25,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:25,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 15:24:25,524 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:25,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1593790839, now seen corresponding path program 2 times [2022-12-14 15:24:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:25,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631650205] [2022-12-14 15:24:25,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:25,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:25,639 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-14 15:24:25,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:25,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631650205] [2022-12-14 15:24:25,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631650205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:25,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:25,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:25,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573008741] [2022-12-14 15:24:25,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:25,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:25,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:25,640 INFO L87 Difference]: Start difference. First operand 16668 states and 62191 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-14 15:24:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:25,804 INFO L93 Difference]: Finished difference Result 16632 states and 62044 transitions. [2022-12-14 15:24:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:25,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:24:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:25,857 INFO L225 Difference]: With dead ends: 16632 [2022-12-14 15:24:25,857 INFO L226 Difference]: Without dead ends: 16632 [2022-12-14 15:24:25,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:25,858 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:25,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16632 states. [2022-12-14 15:24:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16632 to 16632. [2022-12-14 15:24:26,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16632 states, 16440 states have (on average 3.773965936739659) internal successors, (62044), 16631 states have internal predecessors, (62044), 0 states have call successors, (0), 0 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-14 15:24:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16632 states to 16632 states and 62044 transitions. [2022-12-14 15:24:26,185 INFO L78 Accepts]: Start accepts. Automaton has 16632 states and 62044 transitions. Word has length 16 [2022-12-14 15:24:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:26,186 INFO L495 AbstractCegarLoop]: Abstraction has 16632 states and 62044 transitions. [2022-12-14 15:24:26,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-14 15:24:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 16632 states and 62044 transitions. [2022-12-14 15:24:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:24:26,188 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:26,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:26,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 15:24:26,188 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1588246543, now seen corresponding path program 1 times [2022-12-14 15:24:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:26,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239747459] [2022-12-14 15:24:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:26,297 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-14 15:24:26,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:26,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239747459] [2022-12-14 15:24:26,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239747459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:26,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:26,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:24:26,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565524165] [2022-12-14 15:24:26,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:26,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:24:26,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:26,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:24:26,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:26,299 INFO L87 Difference]: Start difference. First operand 16632 states and 62044 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-14 15:24:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:26,565 INFO L93 Difference]: Finished difference Result 15478 states and 55213 transitions. [2022-12-14 15:24:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:24:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:24:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:26,618 INFO L225 Difference]: With dead ends: 15478 [2022-12-14 15:24:26,619 INFO L226 Difference]: Without dead ends: 15478 [2022-12-14 15:24:26,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:26,619 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 29 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:26,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 6 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:24:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15478 states. [2022-12-14 15:24:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15478 to 14066. [2022-12-14 15:24:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14066 states, 13874 states have (on average 3.748522416029984) internal successors, (52007), 14065 states have internal predecessors, (52007), 0 states have call successors, (0), 0 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-14 15:24:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14066 states to 14066 states and 52007 transitions. [2022-12-14 15:24:27,000 INFO L78 Accepts]: Start accepts. Automaton has 14066 states and 52007 transitions. Word has length 16 [2022-12-14 15:24:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:27,000 INFO L495 AbstractCegarLoop]: Abstraction has 14066 states and 52007 transitions. [2022-12-14 15:24:27,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-14 15:24:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 14066 states and 52007 transitions. [2022-12-14 15:24:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:24:27,003 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:27,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:27,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 15:24:27,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1893630016, now seen corresponding path program 1 times [2022-12-14 15:24:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:27,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121381128] [2022-12-14 15:24:27,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:27,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:27,146 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-14 15:24:27,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:27,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121381128] [2022-12-14 15:24:27,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121381128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:27,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:27,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:24:27,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598107298] [2022-12-14 15:24:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:27,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:27,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:27,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:27,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:27,149 INFO L87 Difference]: Start difference. First operand 14066 states and 52007 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-14 15:24:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:27,414 INFO L93 Difference]: Finished difference Result 20742 states and 76046 transitions. [2022-12-14 15:24:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:27,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:24:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:27,499 INFO L225 Difference]: With dead ends: 20742 [2022-12-14 15:24:27,499 INFO L226 Difference]: Without dead ends: 20742 [2022-12-14 15:24:27,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:27,500 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:27,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2022-12-14 15:24:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 14138. [2022-12-14 15:24:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14138 states, 13946 states have (on average 3.750250968019504) internal successors, (52301), 14137 states have internal predecessors, (52301), 0 states have call successors, (0), 0 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-14 15:24:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14138 states to 14138 states and 52301 transitions. [2022-12-14 15:24:27,931 INFO L78 Accepts]: Start accepts. Automaton has 14138 states and 52301 transitions. Word has length 17 [2022-12-14 15:24:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:27,932 INFO L495 AbstractCegarLoop]: Abstraction has 14138 states and 52301 transitions. [2022-12-14 15:24:27,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-14 15:24:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 14138 states and 52301 transitions. [2022-12-14 15:24:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:24:27,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:27,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:27,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 15:24:27,937 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:27,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:27,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1960566326, now seen corresponding path program 1 times [2022-12-14 15:24:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:27,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409166953] [2022-12-14 15:24:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:27,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:29,100 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-14 15:24:29,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:29,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409166953] [2022-12-14 15:24:29,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409166953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:29,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:29,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:24:29,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900512680] [2022-12-14 15:24:29,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:29,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:24:29,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:24:29,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:24:29,102 INFO L87 Difference]: Start difference. First operand 14138 states and 52301 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-14 15:24:29,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:29,929 INFO L93 Difference]: Finished difference Result 14026 states and 51786 transitions. [2022-12-14 15:24:29,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:24:29,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:24:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:29,982 INFO L225 Difference]: With dead ends: 14026 [2022-12-14 15:24:29,982 INFO L226 Difference]: Without dead ends: 14026 [2022-12-14 15:24:29,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:29,983 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 68 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:29,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 12 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:24:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14026 states. [2022-12-14 15:24:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14026 to 14018. [2022-12-14 15:24:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14018 states, 13826 states have (on average 3.745262548821062) internal successors, (51782), 14017 states have internal predecessors, (51782), 0 states have call successors, (0), 0 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-14 15:24:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14018 states to 14018 states and 51782 transitions. [2022-12-14 15:24:30,346 INFO L78 Accepts]: Start accepts. Automaton has 14018 states and 51782 transitions. Word has length 17 [2022-12-14 15:24:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:30,346 INFO L495 AbstractCegarLoop]: Abstraction has 14018 states and 51782 transitions. [2022-12-14 15:24:30,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-14 15:24:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 14018 states and 51782 transitions. [2022-12-14 15:24:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:24:30,350 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:30,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:30,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 15:24:30,350 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:30,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:30,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1991004134, now seen corresponding path program 1 times [2022-12-14 15:24:30,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:30,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757167244] [2022-12-14 15:24:30,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:30,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:30,510 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-14 15:24:30,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:30,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757167244] [2022-12-14 15:24:30,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757167244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:30,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:30,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:24:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477478212] [2022-12-14 15:24:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:30,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:24:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:24:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:24:30,512 INFO L87 Difference]: Start difference. First operand 14018 states and 51782 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-14 15:24:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:30,810 INFO L93 Difference]: Finished difference Result 12634 states and 44580 transitions. [2022-12-14 15:24:30,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:24:30,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:24:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:30,852 INFO L225 Difference]: With dead ends: 12634 [2022-12-14 15:24:30,852 INFO L226 Difference]: Without dead ends: 12634 [2022-12-14 15:24:30,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:24:30,853 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 88 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:30,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 7 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:24:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12634 states. [2022-12-14 15:24:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12634 to 11510. [2022-12-14 15:24:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11510 states, 11318 states have (on average 3.7078989220710374) internal successors, (41966), 11509 states have internal predecessors, (41966), 0 states have call successors, (0), 0 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-14 15:24:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11510 states to 11510 states and 41966 transitions. [2022-12-14 15:24:31,150 INFO L78 Accepts]: Start accepts. Automaton has 11510 states and 41966 transitions. Word has length 17 [2022-12-14 15:24:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:31,150 INFO L495 AbstractCegarLoop]: Abstraction has 11510 states and 41966 transitions. [2022-12-14 15:24:31,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-14 15:24:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 11510 states and 41966 transitions. [2022-12-14 15:24:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:24:31,154 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:31,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:31,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 15:24:31,154 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:31,155 INFO L85 PathProgramCache]: Analyzing trace with hash 648131126, now seen corresponding path program 1 times [2022-12-14 15:24:31,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:31,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867177648] [2022-12-14 15:24:31,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:31,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:32,088 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-14 15:24:32,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:32,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867177648] [2022-12-14 15:24:32,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867177648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:32,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:32,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 15:24:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827974436] [2022-12-14 15:24:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:32,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:24:32,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:24:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:24:32,089 INFO L87 Difference]: Start difference. First operand 11510 states and 41966 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-14 15:24:32,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:32,791 INFO L93 Difference]: Finished difference Result 11681 states and 41913 transitions. [2022-12-14 15:24:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:24:32,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 15:24:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:32,820 INFO L225 Difference]: With dead ends: 11681 [2022-12-14 15:24:32,820 INFO L226 Difference]: Without dead ends: 11681 [2022-12-14 15:24:32,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:24:32,821 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 153 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:32,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 13 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:24:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11681 states. [2022-12-14 15:24:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11681 to 11353. [2022-12-14 15:24:33,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11353 states, 11161 states have (on average 3.6929486605142907) internal successors, (41217), 11352 states have internal predecessors, (41217), 0 states have call successors, (0), 0 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-14 15:24:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11353 states to 11353 states and 41217 transitions. [2022-12-14 15:24:33,049 INFO L78 Accepts]: Start accepts. Automaton has 11353 states and 41217 transitions. Word has length 18 [2022-12-14 15:24:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:33,049 INFO L495 AbstractCegarLoop]: Abstraction has 11353 states and 41217 transitions. [2022-12-14 15:24:33,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-14 15:24:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 11353 states and 41217 transitions. [2022-12-14 15:24:33,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:24:33,054 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:33,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:33,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 15:24:33,054 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:33,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:33,055 INFO L85 PathProgramCache]: Analyzing trace with hash 648188786, now seen corresponding path program 1 times [2022-12-14 15:24:33,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:33,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962622462] [2022-12-14 15:24:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:33,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:33,192 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-14 15:24:33,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:33,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962622462] [2022-12-14 15:24:33,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962622462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:33,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:33,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:24:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800185182] [2022-12-14 15:24:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:33,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:33,193 INFO L87 Difference]: Start difference. First operand 11353 states and 41217 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-14 15:24:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:33,330 INFO L93 Difference]: Finished difference Result 6169 states and 20117 transitions. [2022-12-14 15:24:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:33,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 15:24:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:33,348 INFO L225 Difference]: With dead ends: 6169 [2022-12-14 15:24:33,348 INFO L226 Difference]: Without dead ends: 6169 [2022-12-14 15:24:33,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:33,349 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:33,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2022-12-14 15:24:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 6169. [2022-12-14 15:24:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6169 states, 6013 states have (on average 3.345584566771994) internal successors, (20117), 6168 states have internal predecessors, (20117), 0 states have call successors, (0), 0 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-14 15:24:33,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6169 states to 6169 states and 20117 transitions. [2022-12-14 15:24:33,489 INFO L78 Accepts]: Start accepts. Automaton has 6169 states and 20117 transitions. Word has length 18 [2022-12-14 15:24:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:33,489 INFO L495 AbstractCegarLoop]: Abstraction has 6169 states and 20117 transitions. [2022-12-14 15:24:33,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-14 15:24:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 6169 states and 20117 transitions. [2022-12-14 15:24:33,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:24:33,493 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:33,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:33,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 15:24:33,493 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:33,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:33,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1411010570, now seen corresponding path program 1 times [2022-12-14 15:24:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:33,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980391269] [2022-12-14 15:24:33,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:33,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:33,639 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-14 15:24:33,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:33,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980391269] [2022-12-14 15:24:33,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980391269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:33,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:33,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:24:33,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559715932] [2022-12-14 15:24:33,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:33,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:24:33,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:33,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:24:33,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:24:33,641 INFO L87 Difference]: Start difference. First operand 6169 states and 20117 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-14 15:24:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:33,767 INFO L93 Difference]: Finished difference Result 2303 states and 6557 transitions. [2022-12-14 15:24:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:24:33,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 15:24:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:33,772 INFO L225 Difference]: With dead ends: 2303 [2022-12-14 15:24:33,772 INFO L226 Difference]: Without dead ends: 2303 [2022-12-14 15:24:33,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:24:33,772 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:33,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2022-12-14 15:24:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2303. [2022-12-14 15:24:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 2225 states have (on average 2.9469662921348316) internal successors, (6557), 2302 states have internal predecessors, (6557), 0 states have call successors, (0), 0 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-14 15:24:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 6557 transitions. [2022-12-14 15:24:33,811 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 6557 transitions. Word has length 20 [2022-12-14 15:24:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:33,811 INFO L495 AbstractCegarLoop]: Abstraction has 2303 states and 6557 transitions. [2022-12-14 15:24:33,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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-14 15:24:33,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 6557 transitions. [2022-12-14 15:24:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:24:33,813 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:33,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:33,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 15:24:33,814 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:33,814 INFO L85 PathProgramCache]: Analyzing trace with hash 187861421, now seen corresponding path program 1 times [2022-12-14 15:24:33,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:33,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102445818] [2022-12-14 15:24:33,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:33,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:34,028 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-14 15:24:34,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:34,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102445818] [2022-12-14 15:24:34,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102445818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:34,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:34,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:24:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937123736] [2022-12-14 15:24:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:34,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:24:34,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:34,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:24:34,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:34,030 INFO L87 Difference]: Start difference. First operand 2303 states and 6557 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-14 15:24:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:34,198 INFO L93 Difference]: Finished difference Result 1160 states and 3330 transitions. [2022-12-14 15:24:34,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:24:34,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 15:24:34,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:34,201 INFO L225 Difference]: With dead ends: 1160 [2022-12-14 15:24:34,201 INFO L226 Difference]: Without dead ends: 1160 [2022-12-14 15:24:34,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:34,202 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:34,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:24:34,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2022-12-14 15:24:34,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1160. [2022-12-14 15:24:34,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 1140 states have (on average 2.9210526315789473) internal successors, (3330), 1159 states have internal predecessors, (3330), 0 states have call successors, (0), 0 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-14 15:24:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 3330 transitions. [2022-12-14 15:24:34,222 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 3330 transitions. Word has length 22 [2022-12-14 15:24:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:34,223 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 3330 transitions. [2022-12-14 15:24:34,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-14 15:24:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 3330 transitions. [2022-12-14 15:24:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:34,225 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:34,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:34,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 15:24:34,225 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:34,225 INFO L85 PathProgramCache]: Analyzing trace with hash 812616305, now seen corresponding path program 1 times [2022-12-14 15:24:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:34,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219854179] [2022-12-14 15:24:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:34,457 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-14 15:24:34,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:34,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219854179] [2022-12-14 15:24:34,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219854179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:34,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:34,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:24:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777076512] [2022-12-14 15:24:34,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:34,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:24:34,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:34,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:24:34,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:24:34,459 INFO L87 Difference]: Start difference. First operand 1160 states and 3330 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-14 15:24:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:34,598 INFO L93 Difference]: Finished difference Result 992 states and 2996 transitions. [2022-12-14 15:24:34,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:24:34,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:34,601 INFO L225 Difference]: With dead ends: 992 [2022-12-14 15:24:34,601 INFO L226 Difference]: Without dead ends: 992 [2022-12-14 15:24:34,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:24:34,602 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:34,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:34,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-12-14 15:24:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 920. [2022-12-14 15:24:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 918 states have (on average 3.0217864923747277) internal successors, (2774), 919 states have internal predecessors, (2774), 0 states have call successors, (0), 0 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-14 15:24:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2774 transitions. [2022-12-14 15:24:34,618 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2774 transitions. Word has length 24 [2022-12-14 15:24:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:34,618 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 2774 transitions. [2022-12-14 15:24:34,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-14 15:24:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2774 transitions. [2022-12-14 15:24:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:24:34,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:34,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:34,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 15:24:34,620 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:34,621 INFO L85 PathProgramCache]: Analyzing trace with hash 804674505, now seen corresponding path program 1 times [2022-12-14 15:24:34,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:34,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704847257] [2022-12-14 15:24:34,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:34,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:34,845 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-14 15:24:34,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:34,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704847257] [2022-12-14 15:24:34,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704847257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:34,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:34,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:24:34,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766651346] [2022-12-14 15:24:34,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:34,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:24:34,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:34,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:24:34,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:24:34,847 INFO L87 Difference]: Start difference. First operand 920 states and 2774 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:24:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:35,004 INFO L93 Difference]: Finished difference Result 1265 states and 3686 transitions. [2022-12-14 15:24:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:24:35,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 15:24:35,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:35,006 INFO L225 Difference]: With dead ends: 1265 [2022-12-14 15:24:35,006 INFO L226 Difference]: Without dead ends: 1265 [2022-12-14 15:24:35,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:35,007 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:35,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2022-12-14 15:24:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 776. [2022-12-14 15:24:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 774 states have (on average 3.0103359173126614) internal successors, (2330), 775 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-14 15:24:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 2330 transitions. [2022-12-14 15:24:35,023 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 2330 transitions. Word has length 27 [2022-12-14 15:24:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:35,024 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 2330 transitions. [2022-12-14 15:24:35,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:24:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 2330 transitions. [2022-12-14 15:24:35,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:24:35,025 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:35,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:35,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 15:24:35,025 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:24:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash 558803193, now seen corresponding path program 2 times [2022-12-14 15:24:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:35,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170545526] [2022-12-14 15:24:35,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:35,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 15:24:35,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 15:24:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 15:24:35,205 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 15:24:35,205 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 15:24:35,206 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (95 of 96 remaining) [2022-12-14 15:24:35,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 96 remaining) [2022-12-14 15:24:35,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 96 remaining) [2022-12-14 15:24:35,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 96 remaining) [2022-12-14 15:24:35,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 96 remaining) [2022-12-14 15:24:35,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 96 remaining) [2022-12-14 15:24:35,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 96 remaining) [2022-12-14 15:24:35,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 96 remaining) [2022-12-14 15:24:35,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 96 remaining) [2022-12-14 15:24:35,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 96 remaining) [2022-12-14 15:24:35,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 96 remaining) [2022-12-14 15:24:35,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 96 remaining) [2022-12-14 15:24:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 96 remaining) [2022-12-14 15:24:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (42 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 96 remaining) [2022-12-14 15:24:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 96 remaining) [2022-12-14 15:24:35,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 96 remaining) [2022-12-14 15:24:35,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 96 remaining) [2022-12-14 15:24:35,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 96 remaining) [2022-12-14 15:24:35,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 96 remaining) [2022-12-14 15:24:35,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 96 remaining) [2022-12-14 15:24:35,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 96 remaining) [2022-12-14 15:24:35,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 15:24:35,219 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:35,223 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 15:24:35,223 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 15:24:35,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:24:35 BasicIcfg [2022-12-14 15:24:35,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 15:24:35,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 15:24:35,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 15:24:35,300 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 15:24:35,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:23:44" (3/4) ... [2022-12-14 15:24:35,302 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 15:24:35,302 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 15:24:35,303 INFO L158 Benchmark]: Toolchain (without parser) took 52437.23ms. Allocated memory was 136.3MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 98.4MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 7.6GB. Max. memory is 16.1GB. [2022-12-14 15:24:35,303 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 136.3MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:24:35,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.73ms. Allocated memory is still 136.3MB. Free memory was 98.4MB in the beginning and 69.9MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 15:24:35,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.68ms. Allocated memory is still 136.3MB. Free memory was 69.9MB in the beginning and 67.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 15:24:35,303 INFO L158 Benchmark]: Boogie Preprocessor took 35.45ms. Allocated memory is still 136.3MB. Free memory was 67.4MB in the beginning and 64.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:24:35,303 INFO L158 Benchmark]: RCFGBuilder took 1034.53ms. Allocated memory was 136.3MB in the beginning and 174.1MB in the end (delta: 37.7MB). Free memory was 64.9MB in the beginning and 105.8MB in the end (delta: -41.0MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-12-14 15:24:35,304 INFO L158 Benchmark]: TraceAbstraction took 50844.86ms. Allocated memory was 174.1MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 105.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 7.5GB. Max. memory is 16.1GB. [2022-12-14 15:24:35,304 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 11.4GB. Free memory is still 3.8GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:24:35,305 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 136.3MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.73ms. Allocated memory is still 136.3MB. Free memory was 98.4MB in the beginning and 69.9MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.68ms. Allocated memory is still 136.3MB. Free memory was 69.9MB in the beginning and 67.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.45ms. Allocated memory is still 136.3MB. Free memory was 67.4MB in the beginning and 64.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1034.53ms. Allocated memory was 136.3MB in the beginning and 174.1MB in the end (delta: 37.7MB). Free memory was 64.9MB in the beginning and 105.8MB in the end (delta: -41.0MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. * TraceAbstraction took 50844.86ms. Allocated memory was 174.1MB in the beginning and 11.4GB in the end (delta: 11.2GB). Free memory was 105.8MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 7.5GB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 11.4GB. Free memory is still 3.8GB. 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: 14.5s, 218 PlacesBefore, 102 PlacesAfterwards, 207 TransitionsBefore, 90 TransitionsAfterwards, 10234 CoEnabledTransitionPairs, 8 FixpointIterations, 73 TrivialSequentialCompositions, 116 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 196 TotalNumberOfCompositions, 44098 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16659, independent: 16052, independent conditional: 0, independent unconditional: 16052, dependent: 536, dependent conditional: 0, dependent unconditional: 536, unknown: 71, unknown conditional: 0, unknown unconditional: 71] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6444, independent: 6338, independent conditional: 0, independent unconditional: 6338, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6444, independent: 5656, independent conditional: 0, independent unconditional: 5656, dependent: 788, dependent conditional: 0, dependent unconditional: 788, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 788, independent: 682, independent conditional: 0, independent unconditional: 682, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4557, independent: 1710, independent conditional: 0, independent unconditional: 1710, dependent: 681, dependent conditional: 0, dependent unconditional: 681, unknown: 2165, unknown conditional: 0, unknown unconditional: 2165] ], Cache Queries: [ total: 16659, independent: 9714, independent conditional: 0, independent unconditional: 9714, dependent: 436, dependent conditional: 0, dependent unconditional: 436, unknown: 6509, unknown conditional: 0, unknown unconditional: 6509] , Statistics on independence cache: Total cache size (in pairs): 835, Positive cache size: 785, Positive conditional cache size: 0, Positive unconditional cache size: 785, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2245; [L872] FCALL, FORK 0 pthread_create(&t2245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2245, ((void *)0), P0, ((void *)0))=-3, t2245={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L873] 0 pthread_t t2246; [L874] FCALL, FORK 0 pthread_create(&t2246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2246, ((void *)0), P1, ((void *)0))=-2, t2245={7:0}, t2246={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L875] 0 pthread_t t2247; [L876] FCALL, FORK 0 pthread_create(&t2247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2247, ((void *)0), P2, ((void *)0))=-1, t2245={7:0}, t2246={5:0}, t2247={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L877] 0 pthread_t t2248; [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L878] FCALL, FORK 0 pthread_create(&t2248, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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(&t2248, ((void *)0), P3, ((void *)0))=0, t2245={7:0}, t2246={5:0}, t2247={6:0}, t2248={8:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L846] 4 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 \read(x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 1 \read(x) [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L794] 2 x = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L885] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L886] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L887] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L888] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245={7:0}, t2246={5:0}, t2247={6:0}, t2248={8:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L895] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, 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=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 874]: 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: 872]: 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: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 277 locations, 96 error locations. Started 1 CEGAR loops. OverallTime: 50.6s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.5s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 23.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 945 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 945 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3048 IncrementalHoareTripleChecker+Invalid, 3248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 24 mSDtfsCounter, 3048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447748occurred in iteration=0, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 46276 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 2337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-14 15:24:35,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 --- 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-14 15:24:37,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:24:37,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:24:37,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:24:37,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:24:37,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:24:37,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:24:37,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:24:37,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:24:37,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:24:37,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:24:37,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:24:37,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:24:37,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:24:37,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:24:37,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:24:37,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:24:37,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:24:37,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:24:37,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:24:37,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:24:37,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:24:37,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:24:37,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:24:37,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:24:37,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:24:37,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:24:37,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:24:37,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:24:37,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:24:37,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:24:37,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:24:37,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:24:37,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:24:37,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:24:37,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:24:37,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:24:37,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:24:37,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:24:37,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:24:37,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:24:37,298 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 15:24:37,320 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:24:37,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:24:37,320 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:24:37,320 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:24:37,321 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:24:37,321 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:24:37,321 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:24:37,322 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:24:37,322 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:24:37,322 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:24:37,322 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:24:37,322 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:24:37,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:24:37,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:24:37,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:24:37,324 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:24:37,324 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:24:37,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:24:37,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:24:37,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:24:37,325 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:24:37,325 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:24:37,325 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:24:37,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:24:37,325 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:24:37,325 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 15:24:37,326 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 15:24:37,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:24:37,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:24:37,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:24:37,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 15:24:37,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:24:37,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:24:37,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:24:37,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:24:37,327 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 15:24:37,328 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 15:24:37,328 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:24:37,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 15:24:37,328 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/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_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 [2022-12-14 15:24:37,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:24:37,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:24:37,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:24:37,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:24:37,591 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:24:37,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i [2022-12-14 15:24:40,173 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:24:40,394 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:24:40,395 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i [2022-12-14 15:24:40,407 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/data/577e874c2/5c8e2bbf99ef4da79e46c4949549bcac/FLAGbc73f23f0 [2022-12-14 15:24:40,419 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/data/577e874c2/5c8e2bbf99ef4da79e46c4949549bcac [2022-12-14 15:24:40,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:24:40,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:24:40,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:24:40,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:24:40,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:24:40,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:40,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3ce673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40, skipping insertion in model container [2022-12-14 15:24:40,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:40,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:24:40,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:24:40,601 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_70c6d80a-0b75-425f-aee0-8dfc29790043/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i[992,1005] [2022-12-14 15:24:40,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,784 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:24:40,825 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:24:40,843 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_70c6d80a-0b75-425f-aee0-8dfc29790043/sv-benchmarks/c/pthread-wmm/safe019_rmo.opt.i[992,1005] [2022-12-14 15:24:40,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,870 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,871 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,882 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 15:24:40,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 15:24:40,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:24:40,935 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:24:40,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40 WrapperNode [2022-12-14 15:24:40,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:24:40,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:24:40,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:24:40,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:24:40,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:40,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:40,985 INFO L138 Inliner]: procedures = 181, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2022-12-14 15:24:40,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:24:40,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:24:40,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:24:40,987 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:24:40,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:40,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:41,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:41,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:41,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:41,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:41,019 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:41,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:41,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:24:41,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:24:41,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:24:41,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:24:41,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (1/1) ... [2022-12-14 15:24:41,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:24:41,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:24:41,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:24:41,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 15:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 15:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 15:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 15:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 15:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-14 15:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 15:24:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 15:24:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 15:24:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 15:24:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 15:24:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 15:24:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-14 15:24:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-14 15:24:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 15:24:41,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:24:41,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:24:41,095 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 15:24:41,229 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:24:41,230 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:24:41,811 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:24:42,099 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:24:42,099 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 15:24:42,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:24:42 BoogieIcfgContainer [2022-12-14 15:24:42,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:24:42,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:24:42,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:24:42,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:24:42,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:24:40" (1/3) ... [2022-12-14 15:24:42,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133597c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:24:42, skipping insertion in model container [2022-12-14 15:24:42,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:40" (2/3) ... [2022-12-14 15:24:42,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133597c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:24:42, skipping insertion in model container [2022-12-14 15:24:42,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:24:42" (3/3) ... [2022-12-14 15:24:42,107 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_rmo.opt.i [2022-12-14 15:24:42,121 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:24:42,122 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2022-12-14 15:24:42,122 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 15:24:42,215 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 15:24:42,239 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 15:24:42,249 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 208 transitions, 436 flow [2022-12-14 15:24:42,251 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 208 transitions, 436 flow [2022-12-14 15:24:42,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 208 transitions, 436 flow [2022-12-14 15:24:42,317 INFO L130 PetriNetUnfolder]: 2/204 cut-off events. [2022-12-14 15:24:42,318 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 15:24:42,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 2/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 302 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 140. Up to 2 conditions per place. [2022-12-14 15:24:42,326 INFO L119 LiptonReduction]: Number of co-enabled transitions 10234 [2022-12-14 15:25:07,938 INFO L134 LiptonReduction]: Checked pairs total: 48495 [2022-12-14 15:25:07,938 INFO L136 LiptonReduction]: Total number of compositions: 191 [2022-12-14 15:25:07,944 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 102 places, 90 transitions, 200 flow [2022-12-14 15:25:17,125 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 447748 states, 374830 states have (on average 5.528615639089721) internal successors, (2072291), 447747 states have internal predecessors, (2072291), 0 states have call successors, (0), 0 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-14 15:25:17,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:25:17,146 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=FINITE_AUTOMATA, 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;@1f9f3e0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:25:17,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2022-12-14 15:25:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 447748 states, 374830 states have (on average 5.528615639089721) internal successors, (2072291), 447747 states have internal predecessors, (2072291), 0 states have call successors, (0), 0 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-14 15:25:17,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 15:25:17,652 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:17,652 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 15:25:17,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1176, now seen corresponding path program 1 times [2022-12-14 15:25:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:17,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598878091] [2022-12-14 15:25:17,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:17,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 15:25:17,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:17,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:17,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:17,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 15:25:17,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:17,800 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-14 15:25:17,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:17,801 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:17,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598878091] [2022-12-14 15:25:17,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598878091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:17,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:17,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 15:25:17,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618272622] [2022-12-14 15:25:17,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:17,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 15:25:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:17,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 15:25:17,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:25:18,422 INFO L87 Difference]: Start difference. First operand has 447748 states, 374830 states have (on average 5.528615639089721) internal successors, (2072291), 447747 states have internal predecessors, (2072291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 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-14 15:25:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:20,117 INFO L93 Difference]: Finished difference Result 86644 states and 384011 transitions. [2022-12-14 15:25:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 15:25:20,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-12-14 15:25:20,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:20,795 INFO L225 Difference]: With dead ends: 86644 [2022-12-14 15:25:20,795 INFO L226 Difference]: Without dead ends: 86644 [2022-12-14 15:25:20,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:25:20,798 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:20,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:25:21,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86644 states. [2022-12-14 15:25:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86644 to 86644. [2022-12-14 15:25:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86644 states, 80030 states have (on average 4.7983381232037985) internal successors, (384011), 86643 states have internal predecessors, (384011), 0 states have call successors, (0), 0 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-14 15:25:23,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86644 states to 86644 states and 384011 transitions. [2022-12-14 15:25:23,839 INFO L78 Accepts]: Start accepts. Automaton has 86644 states and 384011 transitions. Word has length 1 [2022-12-14 15:25:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:23,840 INFO L495 AbstractCegarLoop]: Abstraction has 86644 states and 384011 transitions. [2022-12-14 15:25:23,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 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-14 15:25:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 86644 states and 384011 transitions. [2022-12-14 15:25:23,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 15:25:23,840 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:23,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 15:25:23,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:24,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:24,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:24,045 INFO L85 PathProgramCache]: Analyzing trace with hash 36012163, now seen corresponding path program 1 times [2022-12-14 15:25:24,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:24,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869736956] [2022-12-14 15:25:24,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:24,048 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-14 15:25:24,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:24,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:24,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:24,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:25:24,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:24,260 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 15:25:24,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-14 15:25:24,289 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-14 15:25:24,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:24,289 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:24,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869736956] [2022-12-14 15:25:24,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869736956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:24,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:24,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:25:24,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3470056] [2022-12-14 15:25:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:24,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:25:24,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:25:24,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:25:24,292 INFO L87 Difference]: Start difference. First operand 86644 states and 384011 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-14 15:25:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:25,003 INFO L93 Difference]: Finished difference Result 42466 states and 183181 transitions. [2022-12-14 15:25:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:25:25,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 15:25:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:25,375 INFO L225 Difference]: With dead ends: 42466 [2022-12-14 15:25:25,375 INFO L226 Difference]: Without dead ends: 42466 [2022-12-14 15:25:25,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:25:25,376 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:25,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:25:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42466 states. [2022-12-14 15:25:26,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42466 to 42466. [2022-12-14 15:25:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42466 states, 40517 states have (on average 4.521089912876077) internal successors, (183181), 42465 states have internal predecessors, (183181), 0 states have call successors, (0), 0 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-14 15:25:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42466 states to 42466 states and 183181 transitions. [2022-12-14 15:25:26,444 INFO L78 Accepts]: Start accepts. Automaton has 42466 states and 183181 transitions. Word has length 4 [2022-12-14 15:25:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:26,444 INFO L495 AbstractCegarLoop]: Abstraction has 42466 states and 183181 transitions. [2022-12-14 15:25:26,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-14 15:25:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 42466 states and 183181 transitions. [2022-12-14 15:25:26,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 15:25:26,445 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:26,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 15:25:26,453 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:26,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:26,647 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:26,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash 36012164, now seen corresponding path program 1 times [2022-12-14 15:25:26,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:26,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125274022] [2022-12-14 15:25:26,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:26,651 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-14 15:25:26,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:26,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:26,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:26,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:25:26,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:26,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:25:26,796 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-14 15:25:26,819 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-14 15:25:26,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:26,820 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:26,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125274022] [2022-12-14 15:25:26,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125274022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:26,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:26,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:25:26,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322705189] [2022-12-14 15:25:26,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:26,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:25:26,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:25:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:25:26,821 INFO L87 Difference]: Start difference. First operand 42466 states and 183181 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-14 15:25:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:27,034 INFO L93 Difference]: Finished difference Result 10926 states and 44917 transitions. [2022-12-14 15:25:27,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:25:27,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 15:25:27,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:27,079 INFO L225 Difference]: With dead ends: 10926 [2022-12-14 15:25:27,079 INFO L226 Difference]: Without dead ends: 10926 [2022-12-14 15:25:27,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:25:27,080 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:27,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:25:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10926 states. [2022-12-14 15:25:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10926 to 10926. [2022-12-14 15:25:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10926 states, 10732 states have (on average 4.185333581811405) internal successors, (44917), 10925 states have internal predecessors, (44917), 0 states have call successors, (0), 0 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-14 15:25:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10926 states to 10926 states and 44917 transitions. [2022-12-14 15:25:27,482 INFO L78 Accepts]: Start accepts. Automaton has 10926 states and 44917 transitions. Word has length 4 [2022-12-14 15:25:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:27,482 INFO L495 AbstractCegarLoop]: Abstraction has 10926 states and 44917 transitions. [2022-12-14 15:25:27,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-14 15:25:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 10926 states and 44917 transitions. [2022-12-14 15:25:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:25:27,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:27,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:27,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:27,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:27,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash 90372192, now seen corresponding path program 1 times [2022-12-14 15:25:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:27,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072354808] [2022-12-14 15:25:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:27,686 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-14 15:25:27,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:27,687 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:27,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:27,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:25:27,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:27,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:27,884 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:27,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072354808] [2022-12-14 15:25:27,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072354808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:27,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:27,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:25:27,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100982498] [2022-12-14 15:25:27,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:27,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:25:27,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:27,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:25:27,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:25:27,886 INFO L87 Difference]: Start difference. First operand 10926 states and 44917 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-14 15:25:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:28,094 INFO L93 Difference]: Finished difference Result 6079 states and 21418 transitions. [2022-12-14 15:25:28,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:25:28,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:25:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:28,116 INFO L225 Difference]: With dead ends: 6079 [2022-12-14 15:25:28,116 INFO L226 Difference]: Without dead ends: 6079 [2022-12-14 15:25:28,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:25:28,118 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:28,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:25:28,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2022-12-14 15:25:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 6079. [2022-12-14 15:25:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6079 states, 5921 states have (on average 3.6172943759500082) internal successors, (21418), 6078 states have internal predecessors, (21418), 0 states have call successors, (0), 0 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-14 15:25:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6079 states to 6079 states and 21418 transitions. [2022-12-14 15:25:28,235 INFO L78 Accepts]: Start accepts. Automaton has 6079 states and 21418 transitions. Word has length 13 [2022-12-14 15:25:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:28,236 INFO L495 AbstractCegarLoop]: Abstraction has 6079 states and 21418 transitions. [2022-12-14 15:25:28,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-14 15:25:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6079 states and 21418 transitions. [2022-12-14 15:25:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:25:28,238 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:28,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:28,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:28,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:28,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1560409962, now seen corresponding path program 1 times [2022-12-14 15:25:28,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:28,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401736490] [2022-12-14 15:25:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:28,443 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-14 15:25:28,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:28,445 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:28,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:28,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:25:28,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:28,639 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-14 15:25:28,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:28,639 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:28,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401736490] [2022-12-14 15:25:28,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401736490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:28,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:28,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:25:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603903021] [2022-12-14 15:25:28,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:28,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:25:28,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:28,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:25:28,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:25:28,641 INFO L87 Difference]: Start difference. First operand 6079 states and 21418 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-14 15:25:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:28,836 INFO L93 Difference]: Finished difference Result 2083 states and 5949 transitions. [2022-12-14 15:25:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:25:28,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:25:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:28,840 INFO L225 Difference]: With dead ends: 2083 [2022-12-14 15:25:28,840 INFO L226 Difference]: Without dead ends: 2083 [2022-12-14 15:25:28,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:25:28,841 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:28,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:25:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2022-12-14 15:25:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2083. [2022-12-14 15:25:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2003 states have (on average 2.9700449326010983) internal successors, (5949), 2082 states have internal predecessors, (5949), 0 states have call successors, (0), 0 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-14 15:25:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 5949 transitions. [2022-12-14 15:25:28,870 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 5949 transitions. Word has length 16 [2022-12-14 15:25:28,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:28,870 INFO L495 AbstractCegarLoop]: Abstraction has 2083 states and 5949 transitions. [2022-12-14 15:25:28,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 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-14 15:25:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 5949 transitions. [2022-12-14 15:25:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:25:28,872 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:28,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:28,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:29,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:29,073 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:29,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:29,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1441299023, now seen corresponding path program 1 times [2022-12-14 15:25:29,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:29,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469893332] [2022-12-14 15:25:29,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:29,076 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-14 15:25:29,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:29,079 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:29,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:29,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:25:29,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:29,307 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-14 15:25:29,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:29,308 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:29,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469893332] [2022-12-14 15:25:29,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469893332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:29,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:29,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:25:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848612061] [2022-12-14 15:25:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:29,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:25:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:29,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:25:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:25:29,309 INFO L87 Difference]: Start difference. First operand 2083 states and 5949 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-14 15:25:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:29,637 INFO L93 Difference]: Finished difference Result 816 states and 2276 transitions. [2022-12-14 15:25:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:25:29,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:25:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:29,639 INFO L225 Difference]: With dead ends: 816 [2022-12-14 15:25:29,639 INFO L226 Difference]: Without dead ends: 816 [2022-12-14 15:25:29,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:25:29,639 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:29,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 9 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:25:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-12-14 15:25:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2022-12-14 15:25:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 794 states have (on average 2.866498740554156) internal successors, (2276), 815 states have internal predecessors, (2276), 0 states have call successors, (0), 0 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-14 15:25:29,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 2276 transitions. [2022-12-14 15:25:29,649 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 2276 transitions. Word has length 19 [2022-12-14 15:25:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:29,649 INFO L495 AbstractCegarLoop]: Abstraction has 816 states and 2276 transitions. [2022-12-14 15:25:29,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 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-14 15:25:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 2276 transitions. [2022-12-14 15:25:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 15:25:29,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:29,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:29,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-12-14 15:25:29,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:29,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:29,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1062847290, now seen corresponding path program 1 times [2022-12-14 15:25:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:29,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232269824] [2022-12-14 15:25:29,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:29,855 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-14 15:25:29,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:29,858 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:29,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:30,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:25:30,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:30,106 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-14 15:25:30,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:30,106 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:30,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232269824] [2022-12-14 15:25:30,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232269824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:30,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:30,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:25:30,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686177530] [2022-12-14 15:25:30,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:30,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:25:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:30,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:25:30,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:25:30,108 INFO L87 Difference]: Start difference. First operand 816 states and 2276 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-14 15:25:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:30,494 INFO L93 Difference]: Finished difference Result 632 states and 1921 transitions. [2022-12-14 15:25:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:25:30,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 15:25:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:30,495 INFO L225 Difference]: With dead ends: 632 [2022-12-14 15:25:30,495 INFO L226 Difference]: Without dead ends: 632 [2022-12-14 15:25:30,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:25:30,496 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 48 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:30,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:25:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2022-12-14 15:25:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2022-12-14 15:25:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 628 states have (on average 3.0589171974522293) internal successors, (1921), 631 states have internal predecessors, (1921), 0 states have call successors, (0), 0 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-14 15:25:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1921 transitions. [2022-12-14 15:25:30,503 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1921 transitions. Word has length 22 [2022-12-14 15:25:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:30,503 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1921 transitions. [2022-12-14 15:25:30,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 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-14 15:25:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1921 transitions. [2022-12-14 15:25:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:30,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:30,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:30,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-12-14 15:25:30,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:30,706 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:30,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:30,707 INFO L85 PathProgramCache]: Analyzing trace with hash -548015510, now seen corresponding path program 1 times [2022-12-14 15:25:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:30,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102363517] [2022-12-14 15:25:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:30,710 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-14 15:25:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:30,713 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:30,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:30,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 15:25:30,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:31,080 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-14 15:25:31,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:31,080 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:31,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102363517] [2022-12-14 15:25:31,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102363517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:31,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:31,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:25:31,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450540464] [2022-12-14 15:25:31,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:31,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:25:31,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:31,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:25:31,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:25:31,081 INFO L87 Difference]: Start difference. First operand 632 states and 1921 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-14 15:25:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:31,259 INFO L93 Difference]: Finished difference Result 631 states and 1920 transitions. [2022-12-14 15:25:31,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:25:31,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:31,262 INFO L225 Difference]: With dead ends: 631 [2022-12-14 15:25:31,262 INFO L226 Difference]: Without dead ends: 631 [2022-12-14 15:25:31,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:25:31,262 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:31,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:25:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-12-14 15:25:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2022-12-14 15:25:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 628 states have (on average 3.0573248407643314) internal successors, (1920), 630 states have internal predecessors, (1920), 0 states have call successors, (0), 0 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-14 15:25:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1920 transitions. [2022-12-14 15:25:31,275 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1920 transitions. Word has length 26 [2022-12-14 15:25:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:31,276 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 1920 transitions. [2022-12-14 15:25:31,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-14 15:25:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1920 transitions. [2022-12-14 15:25:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:31,278 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:31,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:31,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:31,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:31,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:31,481 INFO L85 PathProgramCache]: Analyzing trace with hash -548015509, now seen corresponding path program 1 times [2022-12-14 15:25:31,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:31,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674338826] [2022-12-14 15:25:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:31,484 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-14 15:25:31,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:31,487 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:31,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:31,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 15:25:31,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:31,934 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-14 15:25:31,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:31,935 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:31,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674338826] [2022-12-14 15:25:31,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674338826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:31,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:31,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:25:31,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486049034] [2022-12-14 15:25:31,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:31,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:25:31,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:31,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:25:31,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:25:31,936 INFO L87 Difference]: Start difference. First operand 631 states and 1920 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-14 15:25:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:32,135 INFO L93 Difference]: Finished difference Result 630 states and 1919 transitions. [2022-12-14 15:25:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:25:32,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:32,137 INFO L225 Difference]: With dead ends: 630 [2022-12-14 15:25:32,137 INFO L226 Difference]: Without dead ends: 630 [2022-12-14 15:25:32,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:25:32,138 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:32,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:25:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2022-12-14 15:25:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2022-12-14 15:25:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 3.055732484076433) internal successors, (1919), 629 states have internal predecessors, (1919), 0 states have call successors, (0), 0 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-14 15:25:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1919 transitions. [2022-12-14 15:25:32,155 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1919 transitions. Word has length 26 [2022-12-14 15:25:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:32,156 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 1919 transitions. [2022-12-14 15:25:32,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-14 15:25:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1919 transitions. [2022-12-14 15:25:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:25:32,158 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:32,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:32,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:32,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:32,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:32,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash 191383405, now seen corresponding path program 1 times [2022-12-14 15:25:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:32,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823761808] [2022-12-14 15:25:32,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:32,364 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-14 15:25:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:32,367 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:32,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 15:25:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:32,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 15:25:32,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:32,806 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-14 15:25:32,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:32,806 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:32,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823761808] [2022-12-14 15:25:32,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823761808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:32,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:32,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:25:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347186930] [2022-12-14 15:25:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:32,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:25:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:32,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:25:32,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:25:32,808 INFO L87 Difference]: Start difference. First operand 630 states and 1919 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:25:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:33,034 INFO L93 Difference]: Finished difference Result 961 states and 2889 transitions. [2022-12-14 15:25:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:25:33,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 15:25:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:33,037 INFO L225 Difference]: With dead ends: 961 [2022-12-14 15:25:33,037 INFO L226 Difference]: Without dead ends: 961 [2022-12-14 15:25:33,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:25:33,037 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 51 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:33,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 3 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:25:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-12-14 15:25:33,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 956. [2022-12-14 15:25:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 954 states have (on average 3.0241090146750524) internal successors, (2885), 955 states have internal predecessors, (2885), 0 states have call successors, (0), 0 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-14 15:25:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2885 transitions. [2022-12-14 15:25:33,058 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2885 transitions. Word has length 27 [2022-12-14 15:25:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:33,058 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 2885 transitions. [2022-12-14 15:25:33,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:25:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2885 transitions. [2022-12-14 15:25:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:25:33,061 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:33,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:33,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 15:25:33,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:33,262 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:33,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:33,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1078992091, now seen corresponding path program 2 times [2022-12-14 15:25:33,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:33,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486432997] [2022-12-14 15:25:33,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 15:25:33,264 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-14 15:25:33,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:33,265 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:33,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 15:25:33,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 15:25:33,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:25:33,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 15:25:33,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:33,722 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-14 15:25:33,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:33,722 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:33,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486432997] [2022-12-14 15:25:33,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486432997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:33,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:33,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:25:33,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807028198] [2022-12-14 15:25:33,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:33,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:25:33,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:33,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:25:33,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:25:33,723 INFO L87 Difference]: Start difference. First operand 956 states and 2885 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:25:34,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:34,050 INFO L93 Difference]: Finished difference Result 1447 states and 4208 transitions. [2022-12-14 15:25:34,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:25:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 15:25:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:34,053 INFO L225 Difference]: With dead ends: 1447 [2022-12-14 15:25:34,054 INFO L226 Difference]: Without dead ends: 1447 [2022-12-14 15:25:34,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:25:34,054 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 75 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:34,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:25:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2022-12-14 15:25:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 776. [2022-12-14 15:25:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 774 states have (on average 3.0103359173126614) internal successors, (2330), 775 states have internal predecessors, (2330), 0 states have call successors, (0), 0 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-14 15:25:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 2330 transitions. [2022-12-14 15:25:34,075 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 2330 transitions. Word has length 27 [2022-12-14 15:25:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:34,075 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 2330 transitions. [2022-12-14 15:25:34,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:25:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 2330 transitions. [2022-12-14 15:25:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:25:34,077 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:34,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:34,086 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-14 15:25:34,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:34,278 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:34,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:34,278 INFO L85 PathProgramCache]: Analyzing trace with hash 414968865, now seen corresponding path program 3 times [2022-12-14 15:25:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:34,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828291040] [2022-12-14 15:25:34,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:25:34,279 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-14 15:25:34,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:34,280 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:34,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 15:25:34,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 15:25:34,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:25:34,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 15:25:34,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:34,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 71 [2022-12-14 15:25:35,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 15:25:35,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 15:25:35,365 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:25:35,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 15:25:35,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-12-14 15:25:35,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 15:25:35,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 52 treesize of output 36 [2022-12-14 15:25:36,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 15:25:36,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-14 15:25:36,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:36,335 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:36,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828291040] [2022-12-14 15:25:36,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828291040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:36,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:36,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:25:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630880278] [2022-12-14 15:25:36,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:36,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 15:25:36,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 15:25:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:25:36,336 INFO L87 Difference]: Start difference. First operand 776 states and 2330 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:25:37,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:37,871 INFO L93 Difference]: Finished difference Result 2303 states and 6822 transitions. [2022-12-14 15:25:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:25:37,872 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 15:25:37,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:37,875 INFO L225 Difference]: With dead ends: 2303 [2022-12-14 15:25:37,875 INFO L226 Difference]: Without dead ends: 2303 [2022-12-14 15:25:37,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:25:37,876 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 61 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:37,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 12 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 15:25:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2022-12-14 15:25:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 808. [2022-12-14 15:25:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 806 states have (on average 3.0198511166253104) internal successors, (2434), 807 states have internal predecessors, (2434), 0 states have call successors, (0), 0 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-14 15:25:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 2434 transitions. [2022-12-14 15:25:37,893 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 2434 transitions. Word has length 27 [2022-12-14 15:25:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:37,893 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 2434 transitions. [2022-12-14 15:25:37,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:25:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 2434 transitions. [2022-12-14 15:25:37,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:25:37,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:37,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:37,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-14 15:25:38,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:38,095 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:38,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1084021785, now seen corresponding path program 4 times [2022-12-14 15:25:38,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:38,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609620020] [2022-12-14 15:25:38,096 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 15:25:38,096 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-14 15:25:38,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:38,097 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:38,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-14 15:25:38,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 15:25:38,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:25:38,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 15:25:38,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:38,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-14 15:25:38,737 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 15:25:38,738 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-14 15:25:38,901 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 15:25:38,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-14 15:25:39,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 61 [2022-12-14 15:25:39,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2022-12-14 15:25:39,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-12-14 15:25:40,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 15:25:40,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 52 treesize of output 36 [2022-12-14 15:25:40,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-14 15:25:40,730 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-14 15:25:40,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:25:40,731 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 15:25:40,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609620020] [2022-12-14 15:25:40,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609620020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:40,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:40,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:25:40,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293853159] [2022-12-14 15:25:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:40,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:25:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 15:25:40,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:25:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:25:40,732 INFO L87 Difference]: Start difference. First operand 808 states and 2434 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:25:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:42,302 INFO L93 Difference]: Finished difference Result 1484 states and 4398 transitions. [2022-12-14 15:25:42,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:25:42,302 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 15:25:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:42,305 INFO L225 Difference]: With dead ends: 1484 [2022-12-14 15:25:42,305 INFO L226 Difference]: Without dead ends: 1484 [2022-12-14 15:25:42,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-12-14 15:25:42,305 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 85 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:42,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 15 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:25:42,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2022-12-14 15:25:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 824. [2022-12-14 15:25:42,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 822 states have (on average 3.034063260340633) internal successors, (2494), 823 states have internal predecessors, (2494), 0 states have call successors, (0), 0 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-14 15:25:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2494 transitions. [2022-12-14 15:25:42,318 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2494 transitions. Word has length 27 [2022-12-14 15:25:42,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:42,318 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 2494 transitions. [2022-12-14 15:25:42,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-14 15:25:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2494 transitions. [2022-12-14 15:25:42,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 15:25:42,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:42,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:42,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-14 15:25:42,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:42,520 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2022-12-14 15:25:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:42,521 INFO L85 PathProgramCache]: Analyzing trace with hash 144055405, now seen corresponding path program 5 times [2022-12-14 15:25:42,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 15:25:42,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606040923] [2022-12-14 15:25:42,521 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 15:25:42,521 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-14 15:25:42,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 15:25:42,522 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:42,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-14 15:25:42,793 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 15:25:42,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-14 15:25:42,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 15:25:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 15:25:43,021 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-12-14 15:25:43,021 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 15:25:43,022 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (95 of 96 remaining) [2022-12-14 15:25:43,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 96 remaining) [2022-12-14 15:25:43,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 96 remaining) [2022-12-14 15:25:43,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 96 remaining) [2022-12-14 15:25:43,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 96 remaining) [2022-12-14 15:25:43,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 96 remaining) [2022-12-14 15:25:43,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 96 remaining) [2022-12-14 15:25:43,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 96 remaining) [2022-12-14 15:25:43,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (42 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 96 remaining) [2022-12-14 15:25:43,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 96 remaining) [2022-12-14 15:25:43,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 96 remaining) [2022-12-14 15:25:43,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 96 remaining) [2022-12-14 15:25:43,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 96 remaining) [2022-12-14 15:25:43,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 96 remaining) [2022-12-14 15:25:43,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 96 remaining) [2022-12-14 15:25:43,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 96 remaining) [2022-12-14 15:25:43,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 96 remaining) [2022-12-14 15:25:43,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 96 remaining) [2022-12-14 15:25:43,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-14 15:25:43,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/mathsat -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-14 15:25:43,237 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:43,254 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 15:25:43,254 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 15:25:43,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:25:43 BasicIcfg [2022-12-14 15:25:43,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 15:25:43,354 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 15:25:43,354 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 15:25:43,354 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 15:25:43,355 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:24:42" (3/4) ... [2022-12-14 15:25:43,357 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 15:25:43,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 15:25:43,358 INFO L158 Benchmark]: Toolchain (without parser) took 62936.10ms. Allocated memory was 67.1MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 44.0MB in the beginning and 7.7GB in the end (delta: -7.7GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-12-14 15:25:43,358 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 67.1MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:25:43,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.55ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 53.9MB in the end (delta: -10.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2022-12-14 15:25:43,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.86ms. Allocated memory is still 86.0MB. Free memory was 53.9MB in the beginning and 51.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:25:43,359 INFO L158 Benchmark]: Boogie Preprocessor took 39.17ms. Allocated memory is still 86.0MB. Free memory was 51.1MB in the beginning and 48.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 15:25:43,359 INFO L158 Benchmark]: RCFGBuilder took 1074.83ms. Allocated memory is still 86.0MB. Free memory was 48.3MB in the beginning and 51.6MB in the end (delta: -3.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2022-12-14 15:25:43,360 INFO L158 Benchmark]: TraceAbstraction took 61251.05ms. Allocated memory was 86.0MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 51.0MB in the beginning and 7.7GB in the end (delta: -7.7GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-12-14 15:25:43,360 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 10.8GB. Free memory is still 7.7GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:25:43,361 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.16ms. Allocated memory is still 67.1MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.55ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 43.8MB in the beginning and 53.9MB in the end (delta: -10.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.86ms. Allocated memory is still 86.0MB. Free memory was 53.9MB in the beginning and 51.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.17ms. Allocated memory is still 86.0MB. Free memory was 51.1MB in the beginning and 48.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1074.83ms. Allocated memory is still 86.0MB. Free memory was 48.3MB in the beginning and 51.6MB in the end (delta: -3.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 61251.05ms. Allocated memory was 86.0MB in the beginning and 10.8GB in the end (delta: 10.7GB). Free memory was 51.0MB in the beginning and 7.7GB in the end (delta: -7.7GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 10.8GB. Free memory is still 7.7GB. 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: 25.7s, 219 PlacesBefore, 102 PlacesAfterwards, 208 TransitionsBefore, 90 TransitionsAfterwards, 10234 CoEnabledTransitionPairs, 9 FixpointIterations, 72 TrivialSequentialCompositions, 112 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 191 TotalNumberOfCompositions, 48495 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17562, independent: 16875, independent conditional: 0, independent unconditional: 16875, dependent: 670, dependent conditional: 0, dependent unconditional: 670, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6505, independent: 6400, independent conditional: 0, independent unconditional: 6400, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6505, independent: 5694, independent conditional: 0, independent unconditional: 5694, dependent: 811, dependent conditional: 0, dependent unconditional: 811, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 811, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3411, independent: 1986, independent conditional: 0, independent unconditional: 1986, dependent: 1374, dependent conditional: 0, dependent unconditional: 1374, unknown: 51, unknown conditional: 0, unknown unconditional: 51] ], Cache Queries: [ total: 17562, independent: 10475, independent conditional: 0, independent unconditional: 10475, dependent: 567, dependent conditional: 0, dependent unconditional: 567, unknown: 6520, unknown conditional: 0, unknown unconditional: 6520] , Statistics on independence cache: Total cache size (in pairs): 844, Positive cache size: 790, Positive conditional cache size: 0, Positive unconditional cache size: 790, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 2, Unknown conditional cache size: 0, Unknown unconditional cache size: 2 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2245; [L872] FCALL, FORK 0 pthread_create(&t2245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2245, ((void *)0), P0, ((void *)0))=0, t2245={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L873] 0 pthread_t t2246; [L874] FCALL, FORK 0 pthread_create(&t2246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2246, ((void *)0), P1, ((void *)0))=1, t2245={-2147483642:0}, t2246={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L875] 0 pthread_t t2247; [L876] FCALL, FORK 0 pthread_create(&t2247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2247, ((void *)0), P2, ((void *)0))=2, t2245={-2147483642:0}, t2246={7:0}, t2247={10:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L877] 0 pthread_t t2248; [L878] FCALL, FORK 0 pthread_create(&t2248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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(&t2248, ((void *)0), P3, ((void *)0))=3, t2245={-2147483642:0}, t2246={7:0}, t2247={10:0}, t2248={6:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L846] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 \read(x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 1 \read(x) [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L794] 2 x = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L885] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L886] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L887] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L888] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245={-2147483642:0}, t2246={7:0}, t2247={10:0}, t2248={6:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L895] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, 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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: -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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 874]: 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: 872]: 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: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 278 locations, 96 error locations. Started 1 CEGAR loops. OverallTime: 61.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.5s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 34.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 566 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2192 IncrementalHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 25 mSDtfsCounter, 2192 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447748occurred in iteration=0, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 2831 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 3400 SizeOfPredicates, 77 NumberOfNonLiveVariables, 2379 ConjunctsInSsa, 156 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-14 15:25:43,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70c6d80a-0b75-425f-aee0-8dfc29790043/bin/utaipan-gh47qXpMRh/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