./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe018_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 --- 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 04:42:46,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:42:46,125 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:42:46,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:42:46,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:42:46,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:42:46,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:42:46,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:42:46,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:42:46,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:42:46,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:42:46,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:42:46,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:42:46,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:42:46,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:42:46,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:42:46,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:42:46,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:42:46,149 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:42:46,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:42:46,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:42:46,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:42:46,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:42:46,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:42:46,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:42:46,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:42:46,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:42:46,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:42:46,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:42:46,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:42:46,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:42:46,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:42:46,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:42:46,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:42:46,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:42:46,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:42:46,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:42:46,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:42:46,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:42:46,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:42:46,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:42:46,164 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 04:42:46,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:42:46,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:42:46,180 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:42:46,180 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:42:46,180 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:42:46,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:42:46,181 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:42:46,181 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:42:46,181 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:42:46,181 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 04:42:46,181 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:42:46,182 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:42:46,182 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 04:42:46,182 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 04:42:46,182 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:42:46,182 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 04:42:46,182 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 04:42:46,183 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 04:42:46,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 04:42:46,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 04:42:46,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:42:46,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:42:46,184 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 04:42:46,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:42:46,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:42:46,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:42:46,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 04:42:46,185 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 04:42:46,185 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 04:42:46,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:42:46,185 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 04:42:46,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:42:46,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:42:46,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:42:46,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:42:46,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:42:46,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:42:46,186 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 04:42:46,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:42:46,187 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 04:42:46,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 04:42:46,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:42:46,187 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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 -> 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 [2022-12-14 04:42:46,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:42:46,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:42:46,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:42:46,376 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:42:46,376 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:42:46,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-12-14 04:42:48,897 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:42:49,079 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:42:49,080 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-12-14 04:42:49,088 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/data/08f57eb62/8856315b37534da69a97f43ab2cc7a31/FLAGdcee911f2 [2022-12-14 04:42:49,469 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/data/08f57eb62/8856315b37534da69a97f43ab2cc7a31 [2022-12-14 04:42:49,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:42:49,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:42:49,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:42:49,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:42:49,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:42:49,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c95d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49, skipping insertion in model container [2022-12-14 04:42:49,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:42:49,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:42:49,616 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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-12-14 04:42:49,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:42:49,745 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:42:49,754 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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-12-14 04:42:49,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,795 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:42:49,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:42:49,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:42:49,818 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:42:49,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49 WrapperNode [2022-12-14 04:42:49,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:42:49,820 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:42:49,820 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:42:49,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:42:49,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,853 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-14 04:42:49,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:42:49,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:42:49,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:42:49,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:42:49,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,874 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:42:49,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:42:49,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:42:49,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:42:49,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (1/1) ... [2022-12-14 04:42:49,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:42:49,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:42:49,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:42:49,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:42:49,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 04:42:49,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 04:42:49,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 04:42:49,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:42:49,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 04:42:49,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 04:42:49,937 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 04:42:49,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 04:42:49,937 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 04:42:49,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 04:42:49,937 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 04:42:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 04:42:49,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 04:42:49,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 04:42:49,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:42:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:42:49,939 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 04:42:50,050 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:42:50,052 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:42:50,428 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:42:50,647 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:42:50,647 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 04:42:50,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:42:50 BoogieIcfgContainer [2022-12-14 04:42:50,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:42:50,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:42:50,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:42:50,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:42:50,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:42:49" (1/3) ... [2022-12-14 04:42:50,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40445457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:42:50, skipping insertion in model container [2022-12-14 04:42:50,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:42:49" (2/3) ... [2022-12-14 04:42:50,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40445457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:42:50, skipping insertion in model container [2022-12-14 04:42:50,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:42:50" (3/3) ... [2022-12-14 04:42:50,655 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2022-12-14 04:42:50,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:42:50,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-12-14 04:42:50,670 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 04:42:50,738 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 04:42:50,763 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 04:42:50,773 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 181 transitions, 377 flow [2022-12-14 04:42:50,776 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 181 transitions, 377 flow [2022-12-14 04:42:50,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 377 flow [2022-12-14 04:42:50,834 INFO L130 PetriNetUnfolder]: 2/178 cut-off events. [2022-12-14 04:42:50,834 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 04:42:50,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 2/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 255 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-14 04:42:50,841 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-12-14 04:43:00,565 INFO L134 LiptonReduction]: Checked pairs total: 29185 [2022-12-14 04:43:00,565 INFO L136 LiptonReduction]: Total number of compositions: 171 [2022-12-14 04:43:00,572 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 76 transitions, 167 flow [2022-12-14 04:43:01,506 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 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 04:43:01,520 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 04:43:01,524 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;@2cbc6740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 04:43:01,524 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-12-14 04:43:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 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 04:43:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 04:43:01,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:01,573 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 04:43:01,573 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:01,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:01,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1032, now seen corresponding path program 1 times [2022-12-14 04:43:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:01,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452414776] [2022-12-14 04:43:01,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:01,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:01,664 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 04:43:01,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:01,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452414776] [2022-12-14 04:43:01,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452414776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:01,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:01,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 04:43:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025213882] [2022-12-14 04:43:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:01,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 04:43:01,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:01,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 04:43:01,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 04:43:01,736 INFO L87 Difference]: Start difference. First operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 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 04:43:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:02,078 INFO L93 Difference]: Finished difference Result 10092 states and 35895 transitions. [2022-12-14 04:43:02,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 04:43:02,081 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 04:43:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:02,184 INFO L225 Difference]: With dead ends: 10092 [2022-12-14 04:43:02,184 INFO L226 Difference]: Without dead ends: 10092 [2022-12-14 04:43:02,185 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 04:43:02,188 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:02,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2022-12-14 04:43:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 10092. [2022-12-14 04:43:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10092 states, 8770 states have (on average 4.092930444697833) internal successors, (35895), 10091 states have internal predecessors, (35895), 0 states have call successors, (0), 0 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 04:43:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10092 states to 10092 states and 35895 transitions. [2022-12-14 04:43:02,594 INFO L78 Accepts]: Start accepts. Automaton has 10092 states and 35895 transitions. Word has length 1 [2022-12-14 04:43:02,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:02,595 INFO L495 AbstractCegarLoop]: Abstraction has 10092 states and 35895 transitions. [2022-12-14 04:43:02,595 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 04:43:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 10092 states and 35895 transitions. [2022-12-14 04:43:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 04:43:02,595 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:02,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 04:43:02,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 04:43:02,596 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:02,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash 31630542, now seen corresponding path program 1 times [2022-12-14 04:43:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:02,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528747111] [2022-12-14 04:43:02,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:02,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:02,849 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 04:43:02,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:02,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528747111] [2022-12-14 04:43:02,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528747111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:02,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:02,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 04:43:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664042036] [2022-12-14 04:43:02,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:02,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:43:02,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:02,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:43:02,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:43:02,853 INFO L87 Difference]: Start difference. First operand 10092 states and 35895 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 04:43:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:03,071 INFO L93 Difference]: Finished difference Result 5274 states and 18133 transitions. [2022-12-14 04:43:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:03,072 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 04:43:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:03,106 INFO L225 Difference]: With dead ends: 5274 [2022-12-14 04:43:03,106 INFO L226 Difference]: Without dead ends: 5274 [2022-12-14 04:43:03,106 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 04:43:03,107 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:03,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:03,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2022-12-14 04:43:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 5274. [2022-12-14 04:43:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5274 states, 4821 states have (on average 3.7612528521053723) internal successors, (18133), 5273 states have internal predecessors, (18133), 0 states have call successors, (0), 0 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 04:43:03,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5274 states to 5274 states and 18133 transitions. [2022-12-14 04:43:03,283 INFO L78 Accepts]: Start accepts. Automaton has 5274 states and 18133 transitions. Word has length 4 [2022-12-14 04:43:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:03,283 INFO L495 AbstractCegarLoop]: Abstraction has 5274 states and 18133 transitions. [2022-12-14 04:43:03,284 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 04:43:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 5274 states and 18133 transitions. [2022-12-14 04:43:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 04:43:03,284 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:03,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 04:43:03,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 04:43:03,285 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:03,285 INFO L85 PathProgramCache]: Analyzing trace with hash 31630543, now seen corresponding path program 1 times [2022-12-14 04:43:03,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:03,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171878411] [2022-12-14 04:43:03,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:03,386 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 04:43:03,387 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:03,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171878411] [2022-12-14 04:43:03,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171878411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:03,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:03,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 04:43:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552299100] [2022-12-14 04:43:03,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:03,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:43:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:03,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:43:03,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:43:03,389 INFO L87 Difference]: Start difference. First operand 5274 states and 18133 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 04:43:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:03,481 INFO L93 Difference]: Finished difference Result 1734 states and 5635 transitions. [2022-12-14 04:43:03,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:03,481 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 04:43:03,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:03,489 INFO L225 Difference]: With dead ends: 1734 [2022-12-14 04:43:03,489 INFO L226 Difference]: Without dead ends: 1734 [2022-12-14 04:43:03,489 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 04:43:03,490 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:03,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2022-12-14 04:43:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1734. [2022-12-14 04:43:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1668 states have (on average 3.378297362110312) internal successors, (5635), 1733 states have internal predecessors, (5635), 0 states have call successors, (0), 0 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 04:43:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 5635 transitions. [2022-12-14 04:43:03,552 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 5635 transitions. Word has length 4 [2022-12-14 04:43:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:03,553 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 5635 transitions. [2022-12-14 04:43:03,553 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 04:43:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 5635 transitions. [2022-12-14 04:43:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 04:43:03,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:03,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:03,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 04:43:03,555 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:03,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash -560557014, now seen corresponding path program 1 times [2022-12-14 04:43:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:03,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486354628] [2022-12-14 04:43:03,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:03,646 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 04:43:03,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:03,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486354628] [2022-12-14 04:43:03,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486354628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:03,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:03,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 04:43:03,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675183588] [2022-12-14 04:43:03,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:03,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:43:03,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:03,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:43:03,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:43:03,648 INFO L87 Difference]: Start difference. First operand 1734 states and 5635 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 04:43:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:03,761 INFO L93 Difference]: Finished difference Result 1702 states and 5523 transitions. [2022-12-14 04:43:03,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:03,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-14 04:43:03,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:03,767 INFO L225 Difference]: With dead ends: 1702 [2022-12-14 04:43:03,767 INFO L226 Difference]: Without dead ends: 1702 [2022-12-14 04:43:03,768 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 04:43:03,768 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:03,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:03,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2022-12-14 04:43:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2022-12-14 04:43:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1636 states have (on average 3.375916870415648) internal successors, (5523), 1701 states have internal predecessors, (5523), 0 states have call successors, (0), 0 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 04:43:03,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 5523 transitions. [2022-12-14 04:43:03,812 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 5523 transitions. Word has length 10 [2022-12-14 04:43:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:03,812 INFO L495 AbstractCegarLoop]: Abstraction has 1702 states and 5523 transitions. [2022-12-14 04:43:03,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 04:43:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 5523 transitions. [2022-12-14 04:43:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 04:43:03,813 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:03,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:03,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 04:43:03,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:03,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:03,814 INFO L85 PathProgramCache]: Analyzing trace with hash -197401242, now seen corresponding path program 1 times [2022-12-14 04:43:03,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:03,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111473680] [2022-12-14 04:43:03,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:03,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:04,120 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 04:43:04,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:04,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111473680] [2022-12-14 04:43:04,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111473680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:04,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:04,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:43:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240193955] [2022-12-14 04:43:04,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:04,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:43:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:04,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:43:04,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:43:04,121 INFO L87 Difference]: Start difference. First operand 1702 states and 5523 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 04:43:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:04,244 INFO L93 Difference]: Finished difference Result 1698 states and 5508 transitions. [2022-12-14 04:43:04,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:04,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-12-14 04:43:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:04,250 INFO L225 Difference]: With dead ends: 1698 [2022-12-14 04:43:04,250 INFO L226 Difference]: Without dead ends: 1698 [2022-12-14 04:43:04,250 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 04:43:04,251 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:04,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2022-12-14 04:43:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1698. [2022-12-14 04:43:04,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1632 states have (on average 3.375) internal successors, (5508), 1697 states have internal predecessors, (5508), 0 states have call successors, (0), 0 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 04:43:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 5508 transitions. [2022-12-14 04:43:04,281 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 5508 transitions. Word has length 11 [2022-12-14 04:43:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:04,281 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 5508 transitions. [2022-12-14 04:43:04,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 04:43:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 5508 transitions. [2022-12-14 04:43:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 04:43:04,282 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:04,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:04,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 04:43:04,282 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:04,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash -197396802, now seen corresponding path program 1 times [2022-12-14 04:43:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:04,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551720729] [2022-12-14 04:43:04,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:04,339 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 04:43:04,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:04,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551720729] [2022-12-14 04:43:04,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551720729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:04,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:04,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:43:04,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018600592] [2022-12-14 04:43:04,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:04,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:43:04,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:04,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:43:04,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:43:04,341 INFO L87 Difference]: Start difference. First operand 1698 states and 5508 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 04:43:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:04,451 INFO L93 Difference]: Finished difference Result 2186 states and 6684 transitions. [2022-12-14 04:43:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:04,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-12-14 04:43:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:04,457 INFO L225 Difference]: With dead ends: 2186 [2022-12-14 04:43:04,457 INFO L226 Difference]: Without dead ends: 2130 [2022-12-14 04:43:04,457 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 04:43:04,458 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:04,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:04,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2022-12-14 04:43:04,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2018. [2022-12-14 04:43:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1953 states have (on average 3.2534562211981566) internal successors, (6354), 2017 states have internal predecessors, (6354), 0 states have call successors, (0), 0 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 04:43:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 6354 transitions. [2022-12-14 04:43:04,498 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 6354 transitions. Word has length 11 [2022-12-14 04:43:04,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:04,498 INFO L495 AbstractCegarLoop]: Abstraction has 2018 states and 6354 transitions. [2022-12-14 04:43:04,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 04:43:04,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 6354 transitions. [2022-12-14 04:43:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 04:43:04,499 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:04,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:04,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 04:43:04,499 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:04,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash -197396801, now seen corresponding path program 1 times [2022-12-14 04:43:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:04,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502542531] [2022-12-14 04:43:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:04,607 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 04:43:04,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:04,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502542531] [2022-12-14 04:43:04,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502542531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:04,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:04,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:43:04,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597852664] [2022-12-14 04:43:04,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:04,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:43:04,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:04,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:43:04,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:43:04,609 INFO L87 Difference]: Start difference. First operand 2018 states and 6354 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 04:43:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:04,705 INFO L93 Difference]: Finished difference Result 1954 states and 6146 transitions. [2022-12-14 04:43:04,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:43:04,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-12-14 04:43:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:04,710 INFO L225 Difference]: With dead ends: 1954 [2022-12-14 04:43:04,711 INFO L226 Difference]: Without dead ends: 1954 [2022-12-14 04:43:04,711 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 04:43:04,711 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 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 04:43:04,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 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 04:43:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-12-14 04:43:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1954. [2022-12-14 04:43:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1890 states have (on average 3.251851851851852) internal successors, (6146), 1953 states have internal predecessors, (6146), 0 states have call successors, (0), 0 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 04:43:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 6146 transitions. [2022-12-14 04:43:04,749 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 6146 transitions. Word has length 11 [2022-12-14 04:43:04,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:04,749 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 6146 transitions. [2022-12-14 04:43:04,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 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 04:43:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 6146 transitions. [2022-12-14 04:43:04,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 04:43:04,750 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:04,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:04,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 04:43:04,750 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:04,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1173919648, now seen corresponding path program 1 times [2022-12-14 04:43:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:04,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466075742] [2022-12-14 04:43:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:04,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:04,874 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 04:43:04,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:04,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466075742] [2022-12-14 04:43:04,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466075742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:04,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:04,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:43:04,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769157615] [2022-12-14 04:43:04,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:04,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:43:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:04,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:43:04,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:43:04,876 INFO L87 Difference]: Start difference. First operand 1954 states and 6146 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 04:43:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:05,003 INFO L93 Difference]: Finished difference Result 2754 states and 8602 transitions. [2022-12-14 04:43:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:43:05,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-12-14 04:43:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:05,012 INFO L225 Difference]: With dead ends: 2754 [2022-12-14 04:43:05,012 INFO L226 Difference]: Without dead ends: 2754 [2022-12-14 04:43:05,013 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 04:43:05,013 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1 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 04:43:05,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2022-12-14 04:43:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2022. [2022-12-14 04:43:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1958 states have (on average 3.238508682328907) internal successors, (6341), 2021 states have internal predecessors, (6341), 0 states have call successors, (0), 0 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 04:43:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 6341 transitions. [2022-12-14 04:43:05,068 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 6341 transitions. Word has length 12 [2022-12-14 04:43:05,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:05,068 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 6341 transitions. [2022-12-14 04:43:05,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 04:43:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 6341 transitions. [2022-12-14 04:43:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 04:43:05,069 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:05,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:05,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 04:43:05,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:05,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash -724004145, now seen corresponding path program 1 times [2022-12-14 04:43:05,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:05,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202402946] [2022-12-14 04:43:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:05,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:05,213 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 04:43:05,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:05,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202402946] [2022-12-14 04:43:05,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202402946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:05,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:05,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:43:05,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295212332] [2022-12-14 04:43:05,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:05,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:43:05,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:05,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:43:05,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:43:05,215 INFO L87 Difference]: Start difference. First operand 2022 states and 6341 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 04:43:05,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:05,350 INFO L93 Difference]: Finished difference Result 2384 states and 6824 transitions. [2022-12-14 04:43:05,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:43:05,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 04:43:05,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:05,357 INFO L225 Difference]: With dead ends: 2384 [2022-12-14 04:43:05,358 INFO L226 Difference]: Without dead ends: 2318 [2022-12-14 04:43:05,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:43:05,358 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 35 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:05,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 6 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-12-14 04:43:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1866. [2022-12-14 04:43:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1866 states, 1802 states have (on average 3.107103218645949) internal successors, (5599), 1865 states have internal predecessors, (5599), 0 states have call successors, (0), 0 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 04:43:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 5599 transitions. [2022-12-14 04:43:05,412 INFO L78 Accepts]: Start accepts. Automaton has 1866 states and 5599 transitions. Word has length 13 [2022-12-14 04:43:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:05,412 INFO L495 AbstractCegarLoop]: Abstraction has 1866 states and 5599 transitions. [2022-12-14 04:43:05,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 04:43:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1866 states and 5599 transitions. [2022-12-14 04:43:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 04:43:05,413 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:05,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:05,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 04:43:05,414 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash -971382671, now seen corresponding path program 1 times [2022-12-14 04:43:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:05,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422815086] [2022-12-14 04:43:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:06,446 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 04:43:06,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:06,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422815086] [2022-12-14 04:43:06,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422815086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:06,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:06,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:43:06,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822579122] [2022-12-14 04:43:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:06,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 04:43:06,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:06,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 04:43:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:43:06,448 INFO L87 Difference]: Start difference. First operand 1866 states and 5599 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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 04:43:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:06,925 INFO L93 Difference]: Finished difference Result 1944 states and 5673 transitions. [2022-12-14 04:43:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 04:43:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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 04:43:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:06,931 INFO L225 Difference]: With dead ends: 1944 [2022-12-14 04:43:06,931 INFO L226 Difference]: Without dead ends: 1926 [2022-12-14 04:43:06,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2022-12-14 04:43:06,932 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 72 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:06,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 9 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:43:06,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-12-14 04:43:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1812. [2022-12-14 04:43:06,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1752 states have (on average 3.0896118721461185) internal successors, (5413), 1811 states have internal predecessors, (5413), 0 states have call successors, (0), 0 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 04:43:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 5413 transitions. [2022-12-14 04:43:06,979 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 5413 transitions. Word has length 14 [2022-12-14 04:43:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:06,979 INFO L495 AbstractCegarLoop]: Abstraction has 1812 states and 5413 transitions. [2022-12-14 04:43:06,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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 04:43:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 5413 transitions. [2022-12-14 04:43:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 04:43:06,981 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:06,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:06,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 04:43:06,981 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash -969292886, now seen corresponding path program 1 times [2022-12-14 04:43:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:06,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051778426] [2022-12-14 04:43:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:07,077 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 04:43:07,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:07,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051778426] [2022-12-14 04:43:07,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051778426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:07,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:07,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:43:07,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407326005] [2022-12-14 04:43:07,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:07,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:43:07,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:43:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:43:07,079 INFO L87 Difference]: Start difference. First operand 1812 states and 5413 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) 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 04:43:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:07,157 INFO L93 Difference]: Finished difference Result 841 states and 2122 transitions. [2022-12-14 04:43:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:07,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) 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 04:43:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:07,160 INFO L225 Difference]: With dead ends: 841 [2022-12-14 04:43:07,160 INFO L226 Difference]: Without dead ends: 841 [2022-12-14 04:43:07,160 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 04:43:07,161 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:07,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-12-14 04:43:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2022-12-14 04:43:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 797 states have (on average 2.6624843161856964) internal successors, (2122), 840 states have internal predecessors, (2122), 0 states have call successors, (0), 0 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 04:43:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2122 transitions. [2022-12-14 04:43:07,184 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2122 transitions. Word has length 14 [2022-12-14 04:43:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:07,184 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 2122 transitions. [2022-12-14 04:43:07,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) 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 04:43:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2122 transitions. [2022-12-14 04:43:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 04:43:07,185 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:07,186 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 04:43:07,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 04:43:07,186 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:07,186 INFO L85 PathProgramCache]: Analyzing trace with hash -218410368, now seen corresponding path program 1 times [2022-12-14 04:43:07,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:07,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107889960] [2022-12-14 04:43:07,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:07,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:07,505 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 04:43:07,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:07,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107889960] [2022-12-14 04:43:07,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107889960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:07,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:07,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 04:43:07,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789256963] [2022-12-14 04:43:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:07,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 04:43:07,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:07,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 04:43:07,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:43:07,507 INFO L87 Difference]: Start difference. First operand 841 states and 2122 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 04:43:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:07,802 INFO L93 Difference]: Finished difference Result 1010 states and 2486 transitions. [2022-12-14 04:43:07,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 04:43:07,802 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 04:43:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:07,804 INFO L225 Difference]: With dead ends: 1010 [2022-12-14 04:43:07,805 INFO L226 Difference]: Without dead ends: 1010 [2022-12-14 04:43:07,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:43:07,805 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:07,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 7 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:43:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-12-14 04:43:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 737. [2022-12-14 04:43:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 693 states have (on average 2.4963924963924966) internal successors, (1730), 736 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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 04:43:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1730 transitions. [2022-12-14 04:43:07,820 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1730 transitions. Word has length 17 [2022-12-14 04:43:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:07,821 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 1730 transitions. [2022-12-14 04:43:07,821 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 04:43:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1730 transitions. [2022-12-14 04:43:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 04:43:07,822 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:07,822 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 04:43:07,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 04:43:07,822 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:07,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash -218410318, now seen corresponding path program 1 times [2022-12-14 04:43:07,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:07,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117296990] [2022-12-14 04:43:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:07,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:08,248 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 04:43:08,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:08,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117296990] [2022-12-14 04:43:08,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117296990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:08,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:08,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 04:43:08,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978952645] [2022-12-14 04:43:08,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:08,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 04:43:08,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:08,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 04:43:08,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 04:43:08,250 INFO L87 Difference]: Start difference. First operand 737 states and 1730 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 04:43:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:08,669 INFO L93 Difference]: Finished difference Result 584 states and 1412 transitions. [2022-12-14 04:43:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 04:43:08,670 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 04:43:08,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:08,671 INFO L225 Difference]: With dead ends: 584 [2022-12-14 04:43:08,671 INFO L226 Difference]: Without dead ends: 541 [2022-12-14 04:43:08,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-12-14 04:43:08,672 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 69 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:08,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 16 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:43:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-12-14 04:43:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2022-12-14 04:43:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 519 states have (on average 2.420038535645472) internal successors, (1256), 540 states have internal predecessors, (1256), 0 states have call successors, (0), 0 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 04:43:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1256 transitions. [2022-12-14 04:43:08,678 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1256 transitions. Word has length 17 [2022-12-14 04:43:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:08,678 INFO L495 AbstractCegarLoop]: Abstraction has 541 states and 1256 transitions. [2022-12-14 04:43:08,678 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 04:43:08,678 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1256 transitions. [2022-12-14 04:43:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 04:43:08,679 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:08,679 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 04:43:08,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 04:43:08,679 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:08,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1359341395, now seen corresponding path program 1 times [2022-12-14 04:43:08,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:08,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082626732] [2022-12-14 04:43:08,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:08,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:08,799 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 04:43:08,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:08,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082626732] [2022-12-14 04:43:08,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082626732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:08,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:08,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:43:08,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405118701] [2022-12-14 04:43:08,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:08,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:43:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:08,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:43:08,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:43:08,801 INFO L87 Difference]: Start difference. First operand 541 states and 1256 transitions. Second operand has 4 states, 4 states have (on average 4.25) 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 04:43:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:08,906 INFO L93 Difference]: Finished difference Result 242 states and 496 transitions. [2022-12-14 04:43:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:43:08,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) 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 04:43:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:08,907 INFO L225 Difference]: With dead ends: 242 [2022-12-14 04:43:08,907 INFO L226 Difference]: Without dead ends: 242 [2022-12-14 04:43:08,908 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 04:43:08,908 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:08,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-14 04:43:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-12-14 04:43:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 234 states have (on average 2.1196581196581197) internal successors, (496), 241 states have internal predecessors, (496), 0 states have call successors, (0), 0 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 04:43:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 496 transitions. [2022-12-14 04:43:08,913 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 496 transitions. Word has length 17 [2022-12-14 04:43:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:08,913 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 496 transitions. [2022-12-14 04:43:08,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) 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 04:43:08,913 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 496 transitions. [2022-12-14 04:43:08,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 04:43:08,914 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:08,914 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 04:43:08,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 04:43:08,914 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:08,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:08,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1365645883, now seen corresponding path program 1 times [2022-12-14 04:43:08,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:08,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348424848] [2022-12-14 04:43:08,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:08,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:43:09,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:09,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348424848] [2022-12-14 04:43:09,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348424848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:09,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:09,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:43:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540542734] [2022-12-14 04:43:09,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:09,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 04:43:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:09,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 04:43:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:43:09,670 INFO L87 Difference]: Start difference. First operand 242 states and 496 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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 04:43:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:09,923 INFO L93 Difference]: Finished difference Result 411 states and 790 transitions. [2022-12-14 04:43:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:43:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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 04:43:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:09,924 INFO L225 Difference]: With dead ends: 411 [2022-12-14 04:43:09,924 INFO L226 Difference]: Without dead ends: 395 [2022-12-14 04:43:09,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:43:09,924 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:09,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:43:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-12-14 04:43:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 274. [2022-12-14 04:43:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 267 states have (on average 2.1273408239700373) internal successors, (568), 273 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:43:09,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 568 transitions. [2022-12-14 04:43:09,928 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 568 transitions. Word has length 19 [2022-12-14 04:43:09,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:09,928 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 568 transitions. [2022-12-14 04:43:09,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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 04:43:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 568 transitions. [2022-12-14 04:43:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 04:43:09,929 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:09,929 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 04:43:09,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 04:43:09,929 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1333471603, now seen corresponding path program 1 times [2022-12-14 04:43:09,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:09,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441312512] [2022-12-14 04:43:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:10,072 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 04:43:10,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:10,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441312512] [2022-12-14 04:43:10,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441312512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:10,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:10,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:43:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997345780] [2022-12-14 04:43:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:10,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:43:10,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:10,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:43:10,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:43:10,074 INFO L87 Difference]: Start difference. First operand 274 states and 568 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 04:43:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:10,164 INFO L93 Difference]: Finished difference Result 200 states and 440 transitions. [2022-12-14 04:43:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:43:10,164 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 04:43:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:10,165 INFO L225 Difference]: With dead ends: 200 [2022-12-14 04:43:10,165 INFO L226 Difference]: Without dead ends: 81 [2022-12-14 04:43:10,165 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 04:43:10,166 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:10,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-12-14 04:43:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-12-14 04:43:10,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.955223880597015) internal successors, (131), 67 states have internal predecessors, (131), 0 states have call successors, (0), 0 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 04:43:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 131 transitions. [2022-12-14 04:43:10,168 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 131 transitions. Word has length 19 [2022-12-14 04:43:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:10,168 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 131 transitions. [2022-12-14 04:43:10,168 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 04:43:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 131 transitions. [2022-12-14 04:43:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:43:10,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:10,169 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] [2022-12-14 04:43:10,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 04:43:10,169 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:10,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:10,169 INFO L85 PathProgramCache]: Analyzing trace with hash 670174737, now seen corresponding path program 1 times [2022-12-14 04:43:10,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:10,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409418929] [2022-12-14 04:43:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:11,816 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 04:43:11,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409418929] [2022-12-14 04:43:11,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409418929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:11,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:11,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 04:43:11,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035522259] [2022-12-14 04:43:11,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:11,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 04:43:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:11,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 04:43:11,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-14 04:43:11,818 INFO L87 Difference]: Start difference. First operand 68 states and 131 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:12,667 INFO L93 Difference]: Finished difference Result 153 states and 284 transitions. [2022-12-14 04:43:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 04:43:12,668 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 04:43:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:12,669 INFO L225 Difference]: With dead ends: 153 [2022-12-14 04:43:12,669 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 04:43:12,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2022-12-14 04:43:12,670 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 87 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:12,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 10 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 04:43:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 04:43:12,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 68. [2022-12-14 04:43:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.8507462686567164) internal successors, (124), 67 states have internal predecessors, (124), 0 states have call successors, (0), 0 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 04:43:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 124 transitions. [2022-12-14 04:43:12,672 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 124 transitions. Word has length 21 [2022-12-14 04:43:12,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:12,672 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 124 transitions. [2022-12-14 04:43:12,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:12,672 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 124 transitions. [2022-12-14 04:43:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:43:12,673 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:12,673 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] [2022-12-14 04:43:12,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 04:43:12,673 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:12,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash 399040529, now seen corresponding path program 2 times [2022-12-14 04:43:12,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:12,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286304869] [2022-12-14 04:43:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:12,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:14,031 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 04:43:14,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 04:43:14,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286304869] [2022-12-14 04:43:14,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286304869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:14,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:14,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:43:14,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247787128] [2022-12-14 04:43:14,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:14,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 04:43:14,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 04:43:14,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 04:43:14,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:43:14,032 INFO L87 Difference]: Start difference. First operand 68 states and 124 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:14,403 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2022-12-14 04:43:14,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 04:43:14,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 04:43:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:14,404 INFO L225 Difference]: With dead ends: 117 [2022-12-14 04:43:14,404 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 04:43:14,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-12-14 04:43:14,405 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 33 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:14,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:43:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 04:43:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-12-14 04:43:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 42 states have internal predecessors, (69), 0 states have call successors, (0), 0 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 04:43:14,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-12-14 04:43:14,406 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 21 [2022-12-14 04:43:14,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:14,406 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 69 transitions. [2022-12-14 04:43:14,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:14,407 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2022-12-14 04:43:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:43:14,407 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:14,407 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] [2022-12-14 04:43:14,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 04:43:14,407 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:14,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:14,408 INFO L85 PathProgramCache]: Analyzing trace with hash -330321449, now seen corresponding path program 3 times [2022-12-14 04:43:14,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 04:43:14,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722141936] [2022-12-14 04:43:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:14,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 04:43:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 04:43:14,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 04:43:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 04:43:14,545 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 04:43:14,545 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 04:43:14,546 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-12-14 04:43:14,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-12-14 04:43:14,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-12-14 04:43:14,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-12-14 04:43:14,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-12-14 04:43:14,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-12-14 04:43:14,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-12-14 04:43:14,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-12-14 04:43:14,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-12-14 04:43:14,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-12-14 04:43:14,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-12-14 04:43:14,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-12-14 04:43:14,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-12-14 04:43:14,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-12-14 04:43:14,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-12-14 04:43:14,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-12-14 04:43:14,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-12-14 04:43:14,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-12-14 04:43:14,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-12-14 04:43:14,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-12-14 04:43:14,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-12-14 04:43:14,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-12-14 04:43:14,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-12-14 04:43:14,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-12-14 04:43:14,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-12-14 04:43:14,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-12-14 04:43:14,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-12-14 04:43:14,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-12-14 04:43:14,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-12-14 04:43:14,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-12-14 04:43:14,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-12-14 04:43:14,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-12-14 04:43:14,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-12-14 04:43:14,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-12-14 04:43:14,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-12-14 04:43:14,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-12-14 04:43:14,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-12-14 04:43:14,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-12-14 04:43:14,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-12-14 04:43:14,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-12-14 04:43:14,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-12-14 04:43:14,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-12-14 04:43:14,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-12-14 04:43:14,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-12-14 04:43:14,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-12-14 04:43:14,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-12-14 04:43:14,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-12-14 04:43:14,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-12-14 04:43:14,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-12-14 04:43:14,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-12-14 04:43:14,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-12-14 04:43:14,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-12-14 04:43:14,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-12-14 04:43:14,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-12-14 04:43:14,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-12-14 04:43:14,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-12-14 04:43:14,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-12-14 04:43:14,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-12-14 04:43:14,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-12-14 04:43:14,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-12-14 04:43:14,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-12-14 04:43:14,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-12-14 04:43:14,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-12-14 04:43:14,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-12-14 04:43:14,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-12-14 04:43:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-12-14 04:43:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-12-14 04:43:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-12-14 04:43:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-12-14 04:43:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-12-14 04:43:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-12-14 04:43:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-12-14 04:43:14,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-12-14 04:43:14,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-12-14 04:43:14,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-12-14 04:43:14,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-12-14 04:43:14,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-12-14 04:43:14,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-12-14 04:43:14,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-12-14 04:43:14,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-12-14 04:43:14,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-12-14 04:43:14,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-12-14 04:43:14,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-12-14 04:43:14,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-12-14 04:43:14,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-12-14 04:43:14,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 04:43:14,559 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:14,564 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 04:43:14,564 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 04:43:14,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:43:14 BasicIcfg [2022-12-14 04:43:14,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 04:43:14,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 04:43:14,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 04:43:14,610 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 04:43:14,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:42:50" (3/4) ... [2022-12-14 04:43:14,613 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 04:43:14,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 04:43:14,613 INFO L158 Benchmark]: Toolchain (without parser) took 25141.41ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 112.3MB in the beginning and 808.5MB in the end (delta: -696.2MB). Peak memory consumption was 538.5MB. Max. memory is 16.1GB. [2022-12-14 04:43:14,613 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 98.6MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 04:43:14,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.45ms. Allocated memory is still 146.8MB. Free memory was 111.8MB in the beginning and 84.6MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-14 04:43:14,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.72ms. Allocated memory is still 146.8MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 04:43:14,614 INFO L158 Benchmark]: Boogie Preprocessor took 24.20ms. Allocated memory is still 146.8MB. Free memory was 82.5MB in the beginning and 79.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 04:43:14,614 INFO L158 Benchmark]: RCFGBuilder took 770.70ms. Allocated memory is still 146.8MB. Free memory was 79.9MB in the beginning and 90.6MB in the end (delta: -10.7MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2022-12-14 04:43:14,614 INFO L158 Benchmark]: TraceAbstraction took 23959.16ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 90.4MB in the beginning and 808.5MB in the end (delta: -718.1MB). Peak memory consumption was 516.0MB. Max. memory is 16.1GB. [2022-12-14 04:43:14,614 INFO L158 Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 1.4GB. Free memory is still 808.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 04:43:14,616 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.11ms. Allocated memory is still 98.6MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.45ms. Allocated memory is still 146.8MB. Free memory was 111.8MB in the beginning and 84.6MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.72ms. Allocated memory is still 146.8MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.20ms. Allocated memory is still 146.8MB. Free memory was 82.5MB in the beginning and 79.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 770.70ms. Allocated memory is still 146.8MB. Free memory was 79.9MB in the beginning and 90.6MB in the end (delta: -10.7MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * TraceAbstraction took 23959.16ms. Allocated memory was 146.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 90.4MB in the beginning and 808.5MB in the end (delta: -718.1MB). Peak memory consumption was 516.0MB. Max. memory is 16.1GB. * Witness Printer took 2.81ms. Allocated memory is still 1.4GB. Free memory is still 808.5MB. 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: 9.8s, 189 PlacesBefore, 85 PlacesAfterwards, 181 TransitionsBefore, 76 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 8 FixpointIterations, 69 TrivialSequentialCompositions, 97 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 171 TotalNumberOfCompositions, 29185 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12739, independent: 12251, independent conditional: 0, independent unconditional: 12251, dependent: 424, dependent conditional: 0, dependent unconditional: 424, unknown: 64, unknown conditional: 0, unknown unconditional: 64] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4866, independent: 4785, independent conditional: 0, independent unconditional: 4785, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4866, independent: 4194, independent conditional: 0, independent unconditional: 4194, dependent: 672, dependent conditional: 0, dependent unconditional: 672, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 672, independent: 591, independent conditional: 0, independent unconditional: 591, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1713, independent: 1291, independent conditional: 0, independent unconditional: 1291, dependent: 304, dependent conditional: 0, dependent unconditional: 304, unknown: 118, unknown conditional: 0, unknown unconditional: 118] ], Cache Queries: [ total: 12739, independent: 7466, independent conditional: 0, independent unconditional: 7466, dependent: 351, dependent conditional: 0, dependent unconditional: 351, unknown: 4922, unknown conditional: 0, unknown unconditional: 4922] , Statistics on independence cache: Total cache size (in pairs): 779, Positive cache size: 748, Positive conditional cache size: 0, Positive unconditional cache size: 748, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((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_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$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(&t2216, ((void *)0), P0, ((void *)0))=-2, t2216={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((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_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$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(&t2217, ((void *)0), P1, ((void *)0))=-1, t2216={6:0}, t2217={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((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_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$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(&t2218, ((void *)0), P2, ((void *)0))=0, t2216={6:0}, t2217={7:0}, t2218={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] 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) [L810] EXPR 3 \read(x) [L810] 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) [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 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_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$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L824] 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_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$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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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_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$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, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] 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) [L768] EXPR 1 \read(x) [L768] 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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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_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$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, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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_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$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=3, weak$$choice1=0, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L792] 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) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] 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) [L792] 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) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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_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$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=3, weak$$choice1=0, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L827] 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) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] 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) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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_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$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=3, weak$$choice1=0, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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_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$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=1, main$tmp_guard1=0, t2216={6:0}, t2217={7:0}, t2218={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_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_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$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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] - 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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 854]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 239 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 711 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 711 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2154 IncrementalHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 23 mSDtfsCounter, 2154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51276occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 1850 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 3804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 04:43:14,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 --- 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 04:43:16,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 04:43:16,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 04:43:16,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 04:43:16,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 04:43:16,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 04:43:16,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 04:43:16,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 04:43:16,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 04:43:16,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 04:43:16,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 04:43:16,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 04:43:16,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 04:43:16,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 04:43:16,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 04:43:16,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 04:43:16,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 04:43:16,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 04:43:16,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 04:43:16,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 04:43:16,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 04:43:16,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 04:43:16,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 04:43:16,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 04:43:16,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 04:43:16,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 04:43:16,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 04:43:16,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 04:43:16,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 04:43:16,285 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 04:43:16,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 04:43:16,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 04:43:16,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 04:43:16,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 04:43:16,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 04:43:16,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 04:43:16,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 04:43:16,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 04:43:16,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 04:43:16,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 04:43:16,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 04:43:16,291 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 04:43:16,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 04:43:16,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 04:43:16,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 04:43:16,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 04:43:16,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 04:43:16,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 04:43:16,309 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 04:43:16,309 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 04:43:16,309 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 04:43:16,309 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 04:43:16,309 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 04:43:16,309 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 04:43:16,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 04:43:16,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 04:43:16,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 04:43:16,310 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 04:43:16,310 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 04:43:16,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 04:43:16,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 04:43:16,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 04:43:16,311 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 04:43:16,311 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 04:43:16,311 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 04:43:16,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 04:43:16,311 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 04:43:16,311 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 04:43:16,312 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 04:43:16,312 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 04:43:16,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 04:43:16,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 04:43:16,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 04:43:16,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 04:43:16,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:43:16,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 04:43:16,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 04:43:16,318 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 04:43:16,318 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 04:43:16,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 04:43:16,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 04:43:16,318 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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 -> 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 [2022-12-14 04:43:16,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 04:43:16,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 04:43:16,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 04:43:16,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 04:43:16,580 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 04:43:16,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-12-14 04:43:19,234 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 04:43:19,429 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 04:43:19,429 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-12-14 04:43:19,440 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/data/a77e3b60a/8fb92053b4774177a8040073e7a230dd/FLAG0bc9dec2e [2022-12-14 04:43:19,455 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/data/a77e3b60a/8fb92053b4774177a8040073e7a230dd [2022-12-14 04:43:19,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 04:43:19,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 04:43:19,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 04:43:19,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 04:43:19,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 04:43:19,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:19,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@447d9f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19, skipping insertion in model container [2022-12-14 04:43:19,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:19,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 04:43:19,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 04:43:19,670 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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-12-14 04:43:19,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,869 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:43:19,884 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 04:43:19,896 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_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-12-14 04:43:19,916 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,917 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,922 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 04:43:19,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 04:43:19,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 04:43:19,995 INFO L208 MainTranslator]: Completed translation [2022-12-14 04:43:19,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19 WrapperNode [2022-12-14 04:43:19,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 04:43:19,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 04:43:19,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 04:43:19,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 04:43:20,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,041 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-14 04:43:20,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 04:43:20,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 04:43:20,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 04:43:20,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 04:43:20,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,069 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 04:43:20,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 04:43:20,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 04:43:20,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 04:43:20,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (1/1) ... [2022-12-14 04:43:20,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 04:43:20,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 04:43:20,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 04:43:20,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 04:43:20,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 04:43:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 04:43:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 04:43:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 04:43:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 04:43:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 04:43:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 04:43:20,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-14 04:43:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-14 04:43:20,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-14 04:43:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-14 04:43:20,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-14 04:43:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-14 04:43:20,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-14 04:43:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 04:43:20,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 04:43:20,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 04:43:20,141 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 04:43:20,263 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 04:43:20,265 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 04:43:20,787 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 04:43:21,133 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 04:43:21,133 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 04:43:21,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:43:21 BoogieIcfgContainer [2022-12-14 04:43:21,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 04:43:21,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 04:43:21,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 04:43:21,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 04:43:21,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:43:19" (1/3) ... [2022-12-14 04:43:21,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcbb4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:43:21, skipping insertion in model container [2022-12-14 04:43:21,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:43:19" (2/3) ... [2022-12-14 04:43:21,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcbb4be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:43:21, skipping insertion in model container [2022-12-14 04:43:21,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:43:21" (3/3) ... [2022-12-14 04:43:21,144 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2022-12-14 04:43:21,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 04:43:21,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-12-14 04:43:21,164 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 04:43:21,284 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-14 04:43:21,316 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 04:43:21,332 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 182 transitions, 379 flow [2022-12-14 04:43:21,335 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 182 transitions, 379 flow [2022-12-14 04:43:21,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 182 transitions, 379 flow [2022-12-14 04:43:21,421 INFO L130 PetriNetUnfolder]: 2/179 cut-off events. [2022-12-14 04:43:21,422 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-14 04:43:21,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 179 events. 2/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 255 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-14 04:43:21,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-12-14 04:43:40,110 INFO L134 LiptonReduction]: Checked pairs total: 29039 [2022-12-14 04:43:40,110 INFO L136 LiptonReduction]: Total number of compositions: 173 [2022-12-14 04:43:40,117 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 76 transitions, 167 flow [2022-12-14 04:43:41,235 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 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 04:43:41,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 04:43:41,256 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;@186e3950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 04:43:41,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-12-14 04:43:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 0 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 04:43:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 04:43:41,323 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:41,324 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 04:43:41,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:41,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1036, now seen corresponding path program 1 times [2022-12-14 04:43:41,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:41,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777872012] [2022-12-14 04:43:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:41,340 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 04:43:41,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:41,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:41,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:41,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 04:43:41,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:41,437 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 04:43:41,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:41,438 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:41,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777872012] [2022-12-14 04:43:41,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777872012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:41,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:41,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 04:43:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729366380] [2022-12-14 04:43:41,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:41,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 04:43:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:41,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 04:43:41,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 04:43:41,535 INFO L87 Difference]: Start difference. First operand has 51276 states, 37144 states have (on average 5.206951324574629) internal successors, (193407), 51275 states have internal predecessors, (193407), 0 states have call successors, (0), 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 04:43:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:41,866 INFO L93 Difference]: Finished difference Result 10092 states and 35895 transitions. [2022-12-14 04:43:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 04:43:41,869 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 04:43:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:41,949 INFO L225 Difference]: With dead ends: 10092 [2022-12-14 04:43:41,949 INFO L226 Difference]: Without dead ends: 10092 [2022-12-14 04:43:41,949 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 04:43:41,953 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:41,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:43:42,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10092 states. [2022-12-14 04:43:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10092 to 10092. [2022-12-14 04:43:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10092 states, 8770 states have (on average 4.092930444697833) internal successors, (35895), 10091 states have internal predecessors, (35895), 0 states have call successors, (0), 0 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 04:43:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10092 states to 10092 states and 35895 transitions. [2022-12-14 04:43:42,441 INFO L78 Accepts]: Start accepts. Automaton has 10092 states and 35895 transitions. Word has length 1 [2022-12-14 04:43:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:42,441 INFO L495 AbstractCegarLoop]: Abstraction has 10092 states and 35895 transitions. [2022-12-14 04:43:42,442 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 04:43:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 10092 states and 35895 transitions. [2022-12-14 04:43:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 04:43:42,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:42,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 04:43:42,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:42,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:42,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:42,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash 31662319, now seen corresponding path program 1 times [2022-12-14 04:43:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:42,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69624440] [2022-12-14 04:43:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:42,652 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 04:43:42,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:42,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:42,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:42,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 04:43:42,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:42,971 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 04:43:42,972 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 04:43:43,000 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 04:43:43,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:43,001 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:43,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69624440] [2022-12-14 04:43:43,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69624440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:43,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:43,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 04:43:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400271597] [2022-12-14 04:43:43,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:43,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:43:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:43,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:43:43,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:43:43,004 INFO L87 Difference]: Start difference. First operand 10092 states and 35895 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 04:43:43,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:43,343 INFO L93 Difference]: Finished difference Result 5274 states and 18133 transitions. [2022-12-14 04:43:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:43,344 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 04:43:43,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:43,389 INFO L225 Difference]: With dead ends: 5274 [2022-12-14 04:43:43,390 INFO L226 Difference]: Without dead ends: 5274 [2022-12-14 04:43:43,390 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 04:43:43,391 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:43,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:43:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2022-12-14 04:43:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 5274. [2022-12-14 04:43:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5274 states, 4821 states have (on average 3.7612528521053723) internal successors, (18133), 5273 states have internal predecessors, (18133), 0 states have call successors, (0), 0 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 04:43:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5274 states to 5274 states and 18133 transitions. [2022-12-14 04:43:43,571 INFO L78 Accepts]: Start accepts. Automaton has 5274 states and 18133 transitions. Word has length 4 [2022-12-14 04:43:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:43,571 INFO L495 AbstractCegarLoop]: Abstraction has 5274 states and 18133 transitions. [2022-12-14 04:43:43,572 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 04:43:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5274 states and 18133 transitions. [2022-12-14 04:43:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 04:43:43,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:43,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 04:43:43,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:43,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:43,774 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash 31662320, now seen corresponding path program 1 times [2022-12-14 04:43:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:43,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833814933] [2022-12-14 04:43:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:43,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 04:43:43,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:43,782 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:43,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:44,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 04:43:44,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:44,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 04:43:44,091 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 04:43:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:43:44,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:44,119 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:44,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833814933] [2022-12-14 04:43:44,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833814933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:44,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:44,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 04:43:44,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375424996] [2022-12-14 04:43:44,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:44,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:43:44,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:44,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:43:44,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:43:44,121 INFO L87 Difference]: Start difference. First operand 5274 states and 18133 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 04:43:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:44,230 INFO L93 Difference]: Finished difference Result 1734 states and 5635 transitions. [2022-12-14 04:43:44,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:44,230 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 04:43:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:44,237 INFO L225 Difference]: With dead ends: 1734 [2022-12-14 04:43:44,237 INFO L226 Difference]: Without dead ends: 1734 [2022-12-14 04:43:44,238 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 04:43:44,239 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:44,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2022-12-14 04:43:44,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1734. [2022-12-14 04:43:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1668 states have (on average 3.378297362110312) internal successors, (5635), 1733 states have internal predecessors, (5635), 0 states have call successors, (0), 0 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 04:43:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 5635 transitions. [2022-12-14 04:43:44,271 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 5635 transitions. Word has length 4 [2022-12-14 04:43:44,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:44,271 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 5635 transitions. [2022-12-14 04:43:44,271 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 04:43:44,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 5635 transitions. [2022-12-14 04:43:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 04:43:44,272 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:44,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:44,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:44,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:44,474 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:44,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1788561653, now seen corresponding path program 1 times [2022-12-14 04:43:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:44,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645967697] [2022-12-14 04:43:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:44,479 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 04:43:44,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:44,483 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:44,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:44,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 04:43:44,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:44,713 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 04:43:44,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:44,714 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645967697] [2022-12-14 04:43:44,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645967697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:44,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:44,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:43:44,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11659013] [2022-12-14 04:43:44,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:44,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:43:44,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:44,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:43:44,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:43:44,715 INFO L87 Difference]: Start difference. First operand 1734 states and 5635 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 04:43:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:44,854 INFO L93 Difference]: Finished difference Result 847 states and 2222 transitions. [2022-12-14 04:43:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-12-14 04:43:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:44,856 INFO L225 Difference]: With dead ends: 847 [2022-12-14 04:43:44,856 INFO L226 Difference]: Without dead ends: 847 [2022-12-14 04:43:44,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 04:43:44,857 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:44,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-12-14 04:43:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2022-12-14 04:43:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 799 states have (on average 2.780976220275344) internal successors, (2222), 846 states have internal predecessors, (2222), 0 states have call successors, (0), 0 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 04:43:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 2222 transitions. [2022-12-14 04:43:44,868 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 2222 transitions. Word has length 10 [2022-12-14 04:43:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:44,869 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 2222 transitions. [2022-12-14 04:43:44,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 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 04:43:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 2222 transitions. [2022-12-14 04:43:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 04:43:44,870 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:44,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:44,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:45,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:45,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1452942196, now seen corresponding path program 1 times [2022-12-14 04:43:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:45,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759639075] [2022-12-14 04:43:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:45,072 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 04:43:45,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:45,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:45,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:45,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 04:43:45,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:45,223 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 04:43:45,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:45,224 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:45,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759639075] [2022-12-14 04:43:45,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759639075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:45,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:45,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:43:45,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773359596] [2022-12-14 04:43:45,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:45,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:43:45,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:45,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:43:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:43:45,226 INFO L87 Difference]: Start difference. First operand 847 states and 2222 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 04:43:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:45,414 INFO L93 Difference]: Finished difference Result 276 states and 576 transitions. [2022-12-14 04:43:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:43:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 04:43:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:45,415 INFO L225 Difference]: With dead ends: 276 [2022-12-14 04:43:45,415 INFO L226 Difference]: Without dead ends: 276 [2022-12-14 04:43:45,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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 04:43:45,416 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:45,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:43:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-12-14 04:43:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2022-12-14 04:43:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 258 states have (on average 2.2325581395348837) internal successors, (576), 275 states have internal predecessors, (576), 0 states have call successors, (0), 0 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 04:43:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 576 transitions. [2022-12-14 04:43:45,421 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 576 transitions. Word has length 13 [2022-12-14 04:43:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:45,421 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 576 transitions. [2022-12-14 04:43:45,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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 04:43:45,422 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 576 transitions. [2022-12-14 04:43:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 04:43:45,423 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:45,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:45,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:45,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:45,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:45,626 INFO L85 PathProgramCache]: Analyzing trace with hash 440759694, now seen corresponding path program 1 times [2022-12-14 04:43:45,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:45,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305290699] [2022-12-14 04:43:45,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:45,630 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 04:43:45,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:45,633 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:45,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:45,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 04:43:45,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:45,831 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 04:43:45,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:45,831 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:45,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305290699] [2022-12-14 04:43:45,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305290699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:45,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:45,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 04:43:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128521277] [2022-12-14 04:43:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:45,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:43:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:43:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:43:45,832 INFO L87 Difference]: Start difference. First operand 276 states and 576 transitions. Second operand has 5 states, 5 states have (on average 3.2) 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 04:43:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:46,074 INFO L93 Difference]: Finished difference Result 151 states and 336 transitions. [2022-12-14 04:43:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 04:43:46,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) 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 04:43:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:46,075 INFO L225 Difference]: With dead ends: 151 [2022-12-14 04:43:46,075 INFO L226 Difference]: Without dead ends: 151 [2022-12-14 04:43:46,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 04:43:46,076 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:46,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 04:43:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-14 04:43:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-12-14 04:43:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 2.2857142857142856) internal successors, (336), 150 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:43:46,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 336 transitions. [2022-12-14 04:43:46,079 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 336 transitions. Word has length 16 [2022-12-14 04:43:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:46,080 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 336 transitions. [2022-12-14 04:43:46,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) 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 04:43:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 336 transitions. [2022-12-14 04:43:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 04:43:46,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:46,081 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 04:43:46,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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)] Ended with exit code 0 [2022-12-14 04:43:46,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:46,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:46,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:46,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1767858979, now seen corresponding path program 1 times [2022-12-14 04:43:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:46,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866583117] [2022-12-14 04:43:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:46,287 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 04:43:46,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:46,290 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:46,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:46,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 04:43:46,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:46,611 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 04:43:46,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:46,611 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:46,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866583117] [2022-12-14 04:43:46,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866583117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:46,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:46,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:43:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951714186] [2022-12-14 04:43:46,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 04:43:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 04:43:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 04:43:46,613 INFO L87 Difference]: Start difference. First operand 151 states and 336 transitions. Second operand has 3 states, 2 states have (on average 10.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 04:43:46,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:46,714 INFO L93 Difference]: Finished difference Result 150 states and 335 transitions. [2022-12-14 04:43:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 04:43:46,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.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 04:43:46,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:46,715 INFO L225 Difference]: With dead ends: 150 [2022-12-14 04:43:46,715 INFO L226 Difference]: Without dead ends: 150 [2022-12-14 04:43:46,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 04:43:46,716 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:46,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-14 04:43:46,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-12-14 04:43:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 147 states have (on average 2.2789115646258504) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:43:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 335 transitions. [2022-12-14 04:43:46,718 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 335 transitions. Word has length 20 [2022-12-14 04:43:46,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:46,718 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 335 transitions. [2022-12-14 04:43:46,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.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 04:43:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 335 transitions. [2022-12-14 04:43:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 04:43:46,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:46,719 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 04:43:46,727 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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)] Ended with exit code 0 [2022-12-14 04:43:46,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:46,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:46,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1767858980, now seen corresponding path program 1 times [2022-12-14 04:43:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:46,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473621048] [2022-12-14 04:43:46,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:46,925 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 04:43:46,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:46,928 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:46,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:47,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 04:43:47,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:47,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 04:43:47,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:47,147 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:47,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473621048] [2022-12-14 04:43:47,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473621048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:47,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:47,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 04:43:47,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535160233] [2022-12-14 04:43:47,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:47,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 04:43:47,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:47,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 04:43:47,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 04:43:47,149 INFO L87 Difference]: Start difference. First operand 150 states and 335 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 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 04:43:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:47,301 INFO L93 Difference]: Finished difference Result 149 states and 334 transitions. [2022-12-14 04:43:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:43:47,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 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 04:43:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:47,302 INFO L225 Difference]: With dead ends: 149 [2022-12-14 04:43:47,302 INFO L226 Difference]: Without dead ends: 149 [2022-12-14 04:43:47,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 04:43:47,302 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:47,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-12-14 04:43:47,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-12-14 04:43:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 2.272108843537415) internal successors, (334), 148 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:43:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 334 transitions. [2022-12-14 04:43:47,306 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 334 transitions. Word has length 20 [2022-12-14 04:43:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:47,306 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 334 transitions. [2022-12-14 04:43:47,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 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 04:43:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 334 transitions. [2022-12-14 04:43:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:43:47,307 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:47,307 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] [2022-12-14 04:43:47,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:47,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:47,509 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1030949516, now seen corresponding path program 1 times [2022-12-14 04:43:47,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:47,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468437844] [2022-12-14 04:43:47,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 04:43:47,513 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 04:43:47,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:47,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:47,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 04:43:47,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 04:43:47,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 04:43:47,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:47,720 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468437844] [2022-12-14 04:43:47,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468437844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:47,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:47,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 04:43:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539388297] [2022-12-14 04:43:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:47,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 04:43:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 04:43:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 04:43:47,723 INFO L87 Difference]: Start difference. First operand 149 states and 334 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:47,859 INFO L93 Difference]: Finished difference Result 191 states and 415 transitions. [2022-12-14 04:43:47,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 04:43:47,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 04:43:47,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:47,860 INFO L225 Difference]: With dead ends: 191 [2022-12-14 04:43:47,860 INFO L226 Difference]: Without dead ends: 191 [2022-12-14 04:43:47,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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 04:43:47,861 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:47,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 04:43:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-14 04:43:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 187. [2022-12-14 04:43:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 185 states have (on average 2.227027027027027) internal successors, (412), 186 states have internal predecessors, (412), 0 states have call successors, (0), 0 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 04:43:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 412 transitions. [2022-12-14 04:43:47,866 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 412 transitions. Word has length 21 [2022-12-14 04:43:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:47,866 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 412 transitions. [2022-12-14 04:43:47,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 412 transitions. [2022-12-14 04:43:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:43:47,867 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:47,867 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] [2022-12-14 04:43:47,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:48,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:48,069 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:48,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1892355962, now seen corresponding path program 2 times [2022-12-14 04:43:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:48,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162854342] [2022-12-14 04:43:48,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 04:43:48,070 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 04:43:48,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:48,071 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:48,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:48,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 04:43:48,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:43:48,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 04:43:48,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:48,500 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 45 treesize of output 33 [2022-12-14 04:43:48,666 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 56 treesize of output 36 [2022-12-14 04:43:48,925 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 86 treesize of output 74 [2022-12-14 04:43:49,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 31 treesize of output 15 [2022-12-14 04:43:49,323 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 04:43:49,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:49,323 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:49,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162854342] [2022-12-14 04:43:49,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162854342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:49,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:49,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 04:43:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213932342] [2022-12-14 04:43:49,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:49,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 04:43:49,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 04:43:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 04:43:49,325 INFO L87 Difference]: Start difference. First operand 187 states and 412 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:49,950 INFO L93 Difference]: Finished difference Result 337 states and 701 transitions. [2022-12-14 04:43:49,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:43:49,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 04:43:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:49,952 INFO L225 Difference]: With dead ends: 337 [2022-12-14 04:43:49,952 INFO L226 Difference]: Without dead ends: 337 [2022-12-14 04:43:49,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-14 04:43:49,953 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:49,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 6 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 04:43:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-12-14 04:43:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 202. [2022-12-14 04:43:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 200 states have (on average 2.245) internal successors, (449), 201 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:43:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 449 transitions. [2022-12-14 04:43:49,959 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 449 transitions. Word has length 21 [2022-12-14 04:43:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:49,959 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 449 transitions. [2022-12-14 04:43:49,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 449 transitions. [2022-12-14 04:43:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:43:49,961 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:49,961 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] [2022-12-14 04:43:49,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:50,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:50,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:50,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:50,164 INFO L85 PathProgramCache]: Analyzing trace with hash -107022196, now seen corresponding path program 3 times [2022-12-14 04:43:50,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:50,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604917553] [2022-12-14 04:43:50,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 04:43:50,166 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 04:43:50,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:50,169 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:50,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:50,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 04:43:50,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:43:50,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 04:43:50,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:50,678 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 45 treesize of output 33 [2022-12-14 04:43:50,807 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 04:43:51,096 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 04:43:51,337 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 86 treesize of output 74 [2022-12-14 04:43:51,692 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 31 treesize of output 15 [2022-12-14 04:43:51,769 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 04:43:51,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:51,769 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604917553] [2022-12-14 04:43:51,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604917553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:51,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:51,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:43:51,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361265392] [2022-12-14 04:43:51,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:51,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 04:43:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:51,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 04:43:51,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:43:51,770 INFO L87 Difference]: Start difference. First operand 202 states and 449 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:52,450 INFO L93 Difference]: Finished difference Result 278 states and 604 transitions. [2022-12-14 04:43:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:43:52,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 04:43:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:52,452 INFO L225 Difference]: With dead ends: 278 [2022-12-14 04:43:52,452 INFO L226 Difference]: Without dead ends: 278 [2022-12-14 04:43:52,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:43:52,452 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:52,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 04:43:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-12-14 04:43:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 208. [2022-12-14 04:43:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 206 states have (on average 2.2524271844660193) internal successors, (464), 207 states have internal predecessors, (464), 0 states have call successors, (0), 0 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 04:43:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 464 transitions. [2022-12-14 04:43:52,456 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 464 transitions. Word has length 21 [2022-12-14 04:43:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:52,456 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 464 transitions. [2022-12-14 04:43:52,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 464 transitions. [2022-12-14 04:43:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:43:52,457 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:52,457 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] [2022-12-14 04:43:52,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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)] Forceful destruction successful, exit code 0 [2022-12-14 04:43:52,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:52,658 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -236060378, now seen corresponding path program 4 times [2022-12-14 04:43:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:52,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404724314] [2022-12-14 04:43:52,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 04:43:52,659 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 04:43:52,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:52,660 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:52,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:52,812 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 04:43:52,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 04:43:52,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 04:43:52,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 04:43:52,987 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 45 treesize of output 33 [2022-12-14 04:43:53,091 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 04:43:53,329 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 04:43:53,476 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 04:43:53,856 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 04:43:53,927 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 04:43:53,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 04:43:53,928 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 04:43:53,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404724314] [2022-12-14 04:43:53,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404724314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 04:43:53,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 04:43:53,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 04:43:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426114853] [2022-12-14 04:43:53,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 04:43:53,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 04:43:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 04:43:53,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 04:43:53,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 04:43:53,929 INFO L87 Difference]: Start difference. First operand 208 states and 464 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:54,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 04:43:54,642 INFO L93 Difference]: Finished difference Result 303 states and 644 transitions. [2022-12-14 04:43:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 04:43:54,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-12-14 04:43:54,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 04:43:54,643 INFO L225 Difference]: With dead ends: 303 [2022-12-14 04:43:54,644 INFO L226 Difference]: Without dead ends: 303 [2022-12-14 04:43:54,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-14 04:43:54,644 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 04:43:54,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 6 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 04:43:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-12-14 04:43:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 199. [2022-12-14 04:43:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 197 states have (on average 2.238578680203046) internal successors, (441), 198 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 04:43:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 441 transitions. [2022-12-14 04:43:54,649 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 441 transitions. Word has length 21 [2022-12-14 04:43:54,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 04:43:54,649 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 441 transitions. [2022-12-14 04:43:54,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 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 04:43:54,649 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 441 transitions. [2022-12-14 04:43:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 04:43:54,650 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 04:43:54,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] [2022-12-14 04:43:54,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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)] Forceful destruction successful, exit code 0 [2022-12-14 04:43:54,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:54,852 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-14 04:43:54,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 04:43:54,853 INFO L85 PathProgramCache]: Analyzing trace with hash 570138746, now seen corresponding path program 5 times [2022-12-14 04:43:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 04:43:54,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147940714] [2022-12-14 04:43:54,855 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-14 04:43:54,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 04:43:54,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 04:43:54,858 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:54,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:55,067 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 04:43:55,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-14 04:43:55,067 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 04:43:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 04:43:55,242 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-12-14 04:43:55,242 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 04:43:55,243 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-12-14 04:43:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-12-14 04:43:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-12-14 04:43:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-12-14 04:43:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-12-14 04:43:55,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-12-14 04:43:55,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-12-14 04:43:55,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-12-14 04:43:55,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-12-14 04:43:55,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-12-14 04:43:55,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-12-14 04:43:55,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-12-14 04:43:55,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-12-14 04:43:55,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-12-14 04:43:55,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-12-14 04:43:55,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-12-14 04:43:55,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-12-14 04:43:55,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-12-14 04:43:55,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-12-14 04:43:55,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:55,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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 04:43:55,459 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 04:43:55,474 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-14 04:43:55,474 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 04:43:55,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:43:55 BasicIcfg [2022-12-14 04:43:55,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 04:43:55,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 04:43:55,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 04:43:55,539 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 04:43:55,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:43:21" (3/4) ... [2022-12-14 04:43:55,542 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 04:43:55,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 04:43:55,542 INFO L158 Benchmark]: Toolchain (without parser) took 36083.52ms. Allocated memory was 83.9MB in the beginning and 994.1MB in the end (delta: 910.2MB). Free memory was 60.6MB in the beginning and 360.7MB in the end (delta: -300.1MB). Peak memory consumption was 613.3MB. Max. memory is 16.1GB. [2022-12-14 04:43:55,542 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 04:43:55,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.52ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 54.3MB in the end (delta: 6.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2022-12-14 04:43:55,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.42ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 51.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 04:43:55,543 INFO L158 Benchmark]: Boogie Preprocessor took 31.89ms. Allocated memory is still 83.9MB. Free memory was 51.8MB in the beginning and 49.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 04:43:55,543 INFO L158 Benchmark]: RCFGBuilder took 1061.13ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 31.8MB in the end (delta: 17.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2022-12-14 04:43:55,543 INFO L158 Benchmark]: TraceAbstraction took 34400.85ms. Allocated memory was 83.9MB in the beginning and 994.1MB in the end (delta: 910.2MB). Free memory was 31.2MB in the beginning and 360.7MB in the end (delta: -329.5MB). Peak memory consumption was 580.4MB. Max. memory is 16.1GB. [2022-12-14 04:43:55,543 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 994.1MB. Free memory was 360.7MB in the beginning and 360.7MB in the end (delta: 2.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 04:43:55,544 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.14ms. Allocated memory is still 56.6MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.52ms. Allocated memory is still 83.9MB. Free memory was 60.4MB in the beginning and 54.3MB in the end (delta: 6.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.42ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 51.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.89ms. Allocated memory is still 83.9MB. Free memory was 51.8MB in the beginning and 49.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1061.13ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 31.8MB in the end (delta: 17.5MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34400.85ms. Allocated memory was 83.9MB in the beginning and 994.1MB in the end (delta: 910.2MB). Free memory was 31.2MB in the beginning and 360.7MB in the end (delta: -329.5MB). Peak memory consumption was 580.4MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 994.1MB. Free memory was 360.7MB in the beginning and 360.7MB in the end (delta: 2.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.8s, 190 PlacesBefore, 85 PlacesAfterwards, 182 TransitionsBefore, 76 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 8 FixpointIterations, 70 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 173 TotalNumberOfCompositions, 29039 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12664, independent: 12177, independent conditional: 0, independent unconditional: 12177, dependent: 394, dependent conditional: 0, dependent unconditional: 394, unknown: 93, unknown conditional: 0, unknown unconditional: 93] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4811, independent: 4729, independent conditional: 0, independent unconditional: 4729, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4811, independent: 4127, independent conditional: 0, independent unconditional: 4127, dependent: 684, dependent conditional: 0, dependent unconditional: 684, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 684, independent: 602, independent conditional: 0, independent unconditional: 602, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2256, independent: 1462, independent conditional: 0, independent unconditional: 1462, dependent: 523, dependent conditional: 0, dependent unconditional: 523, unknown: 272, unknown conditional: 0, unknown unconditional: 272] ], Cache Queries: [ total: 12664, independent: 7448, independent conditional: 0, independent unconditional: 7448, dependent: 321, dependent conditional: 0, dependent unconditional: 321, unknown: 4895, unknown conditional: 0, unknown unconditional: 4895] , Statistics on independence cache: Total cache size (in pairs): 813, Positive cache size: 783, Positive conditional cache size: 0, Positive unconditional cache size: 783, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 8, Unknown conditional cache size: 0, Unknown unconditional cache size: 8 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((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_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$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(&t2216, ((void *)0), P0, ((void *)0))=-2, t2216={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((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_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$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(&t2217, ((void *)0), P1, ((void *)0))=-1, t2216={7:0}, t2217={14: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((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_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$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(&t2218, ((void *)0), P2, ((void *)0))=0, t2216={7:0}, t2217={14:0}, t2218={15: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] 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) [L810] EXPR 3 \read(x) [L810] 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) [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 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_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$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=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L824] 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_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$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=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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_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$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, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] 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) [L768] EXPR 1 \read(x) [L768] 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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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_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$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, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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_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$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=5, weak$$choice1=0, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L792] 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) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] 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) [L792] 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) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __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_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$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=5, weak$$choice1=0, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L827] 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) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] 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) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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=1, __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_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$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=5, weak$$choice1=0, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __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_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$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=1, main$tmp_guard1=0, t2216={7:0}, t2217={14:0}, t2218={15:0}, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_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_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$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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=2, weak$$choice2=2, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] - 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: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 854]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 240 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 34.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1105 IncrementalHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 18 mSDtfsCounter, 1105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51276occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 313 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2686 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1943 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 04:43:55,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12d0c412-f188-42d0-9a6e-15eb7c7c9ebb/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