./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.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_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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_8231c939-f839-4da5-a27d-71cf96d90c2c/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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- 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 13:04:20,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:04:20,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:04:20,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:04:20,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:04:20,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:04:20,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:04:20,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:04:20,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:04:20,734 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:04:20,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:04:20,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:04:20,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:04:20,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:04:20,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:04:20,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:04:20,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:04:20,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:04:20,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:04:20,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:04:20,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:04:20,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:04:20,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:04:20,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:04:20,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:04:20,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:04:20,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:04:20,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:04:20,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:04:20,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:04:20,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:04:20,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:04:20,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:04:20,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:04:20,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:04:20,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:04:20,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:04:20,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:04:20,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:04:20,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:04:20,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:04:20,761 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 13:04:20,779 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:04:20,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:04:20,779 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:04:20,779 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:04:20,780 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:04:20,780 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:04:20,780 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:04:20,780 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:04:20,780 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:04:20,781 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:04:20,781 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:04:20,781 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:04:20,781 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:04:20,781 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:04:20,781 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:04:20,782 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:04:20,782 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:04:20,782 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:04:20,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 13:04:20,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 13:04:20,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:04:20,783 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:04:20,783 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 13:04:20,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:04:20,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:04:20,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:04:20,784 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 13:04:20,784 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 13:04:20,784 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 13:04:20,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:04:20,784 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 13:04:20,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:04:20,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:04:20,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:04:20,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:04:20,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:04:20,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:04:20,785 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:04:20,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:04:20,786 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:04:20,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:04:20,786 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:04:20,786 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_8231c939-f839-4da5-a27d-71cf96d90c2c/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_8231c939-f839-4da5-a27d-71cf96d90c2c/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 -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2022-12-14 13:04:20,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:04:21,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:04:21,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:04:21,012 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:04:21,012 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:04:21,014 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2022-12-14 13:04:23,641 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:04:23,785 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:04:23,786 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2022-12-14 13:04:23,793 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/data/e23c3b22b/3d80a96a226c4eb29df5f3283a679d22/FLAGf70097d95 [2022-12-14 13:04:23,803 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/data/e23c3b22b/3d80a96a226c4eb29df5f3283a679d22 [2022-12-14 13:04:23,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:04:23,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:04:23,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:04:23,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:04:23,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:04:23,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:04:23" (1/1) ... [2022-12-14 13:04:23,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3604c897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:23, skipping insertion in model container [2022-12-14 13:04:23,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:04:23" (1/1) ... [2022-12-14 13:04:23,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:04:23,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:04:24,011 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2022-12-14 13:04:24,015 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2022-12-14 13:04:24,016 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2022-12-14 13:04:24,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:04:24,028 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:04:24,051 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2022-12-14 13:04:24,051 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2022-12-14 13:04:24,053 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2022-12-14 13:04:24,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:04:24,070 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:04:24,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24 WrapperNode [2022-12-14 13:04:24,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:04:24,071 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:04:24,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:04:24,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:04:24,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,110 INFO L138 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-12-14 13:04:24,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:04:24,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:04:24,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:04:24,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:04:24,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,137 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:04:24,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:04:24,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:04:24,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:04:24,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (1/1) ... [2022-12-14 13:04:24,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:04:24,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:04:24,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:04:24,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:04:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 13:04:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 13:04:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 13:04:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:04:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 13:04:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 13:04:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 13:04:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:04:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:04:24,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:04:24,281 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:04:24,283 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:04:24,571 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:04:24,634 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:04:24,634 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 13:04:24,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:04:24 BoogieIcfgContainer [2022-12-14 13:04:24,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:04:24,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:04:24,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:04:24,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:04:24,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:04:23" (1/3) ... [2022-12-14 13:04:24,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279001f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:04:24, skipping insertion in model container [2022-12-14 13:04:24,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:24" (2/3) ... [2022-12-14 13:04:24,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@279001f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:04:24, skipping insertion in model container [2022-12-14 13:04:24,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:04:24" (3/3) ... [2022-12-14 13:04:24,646 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2022-12-14 13:04:24,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:04:24,665 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-12-14 13:04:24,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:04:24,703 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;@d5bc37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:04:24,703 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2022-12-14 13:04:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 49 states have (on average 2.4489795918367347) internal successors, (120), 104 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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 13:04:24,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 13:04:24,711 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:24,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 13:04:24,711 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:24,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash 7537, now seen corresponding path program 1 times [2022-12-14 13:04:24,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:24,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870842572] [2022-12-14 13:04:24,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:24,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:24,860 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 13:04:24,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:24,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870842572] [2022-12-14 13:04:24,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870842572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:24,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:24,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:04:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924589395] [2022-12-14 13:04:24,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:24,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:04:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:04:24,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:04:24,890 INFO L87 Difference]: Start difference. First operand has 105 states, 49 states have (on average 2.4489795918367347) internal successors, (120), 104 states have internal predecessors, (120), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states 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 13:04:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:24,997 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-12-14 13:04:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:04:24,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 13:04:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:25,005 INFO L225 Difference]: With dead ends: 105 [2022-12-14 13:04:25,006 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 13:04:25,007 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 13:04:25,009 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:25,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 54 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 13:04:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2022-12-14 13:04:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 99 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 13:04:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-12-14 13:04:25,036 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 2 [2022-12-14 13:04:25,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:25,036 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-12-14 13:04:25,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states 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 13:04:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-12-14 13:04:25,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 13:04:25,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:25,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 13:04:25,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:04:25,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:25,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:25,038 INFO L85 PathProgramCache]: Analyzing trace with hash 7538, now seen corresponding path program 1 times [2022-12-14 13:04:25,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:25,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710421865] [2022-12-14 13:04:25,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:25,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:25,097 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 13:04:25,098 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:25,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710421865] [2022-12-14 13:04:25,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710421865] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:25,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:25,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:04:25,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914602516] [2022-12-14 13:04:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:25,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:04:25,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:25,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:04:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:04:25,101 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states 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 13:04:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:25,189 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-12-14 13:04:25,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:04:25,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 13:04:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:25,190 INFO L225 Difference]: With dead ends: 114 [2022-12-14 13:04:25,190 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 13:04:25,190 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 13:04:25,191 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 84 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:25,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 60 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 13:04:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2022-12-14 13:04:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.9642857142857142) internal successors, (110), 102 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 13:04:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-12-14 13:04:25,196 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 2 [2022-12-14 13:04:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:25,196 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-12-14 13:04:25,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states 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 13:04:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-12-14 13:04:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 13:04:25,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:25,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 13:04:25,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:04:25,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:25,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:25,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1623890998, now seen corresponding path program 1 times [2022-12-14 13:04:25,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:25,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095903254] [2022-12-14 13:04:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:25,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:25,301 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 13:04:25,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:25,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095903254] [2022-12-14 13:04:25,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095903254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:25,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:25,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:04:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560513040] [2022-12-14 13:04:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:25,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:04:25,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:25,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:04:25,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:04:25,304 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 13:04:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:25,416 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2022-12-14 13:04:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:04:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-14 13:04:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:25,417 INFO L225 Difference]: With dead ends: 106 [2022-12-14 13:04:25,417 INFO L226 Difference]: Without dead ends: 106 [2022-12-14 13:04:25,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 13:04:25,419 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 135 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:25,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 42 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:25,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-12-14 13:04:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2022-12-14 13:04:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.7796610169491525) internal successors, (105), 94 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 13:04:25,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2022-12-14 13:04:25,426 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 6 [2022-12-14 13:04:25,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:25,426 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2022-12-14 13:04:25,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 13:04:25,427 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2022-12-14 13:04:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 13:04:25,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:25,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 13:04:25,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 13:04:25,427 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1623890997, now seen corresponding path program 1 times [2022-12-14 13:04:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:25,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269938207] [2022-12-14 13:04:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:25,598 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 13:04:25,598 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:25,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269938207] [2022-12-14 13:04:25,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269938207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:25,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:25,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:04:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088757671] [2022-12-14 13:04:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:25,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:04:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:04:25,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:04:25,600 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 13:04:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:25,741 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-12-14 13:04:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:04:25,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-12-14 13:04:25,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:25,743 INFO L225 Difference]: With dead ends: 125 [2022-12-14 13:04:25,743 INFO L226 Difference]: Without dead ends: 125 [2022-12-14 13:04:25,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:04:25,744 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 151 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:25,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 64 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-14 13:04:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2022-12-14 13:04:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.681159420289855) internal successors, (116), 103 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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 13:04:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2022-12-14 13:04:25,751 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 6 [2022-12-14 13:04:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:25,752 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2022-12-14 13:04:25,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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 13:04:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-12-14 13:04:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 13:04:25,752 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:25,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:25,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 13:04:25,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1486138634, now seen corresponding path program 1 times [2022-12-14 13:04:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780091972] [2022-12-14 13:04:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:25,784 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 13:04:25,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:25,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780091972] [2022-12-14 13:04:25,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780091972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:25,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:25,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:04:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028300793] [2022-12-14 13:04:25,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:25,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:04:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:25,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:04:25,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:04:25,787 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 13:04:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:25,878 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-12-14 13:04:25,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:04:25,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-12-14 13:04:25,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:25,879 INFO L225 Difference]: With dead ends: 114 [2022-12-14 13:04:25,879 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 13:04:25,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 13:04:25,881 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 102 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:25,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 94 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 13:04:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-12-14 13:04:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 101 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 13:04:25,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2022-12-14 13:04:25,887 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 8 [2022-12-14 13:04:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:25,887 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2022-12-14 13:04:25,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 13:04:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2022-12-14 13:04:25,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 13:04:25,888 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:25,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:25,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 13:04:25,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1485929393, now seen corresponding path program 1 times [2022-12-14 13:04:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:25,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949517248] [2022-12-14 13:04:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:25,975 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 13:04:25,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:25,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949517248] [2022-12-14 13:04:25,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949517248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:25,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:25,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:04:25,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847805171] [2022-12-14 13:04:25,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:25,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:04:25,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:25,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:04:25,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:04:25,977 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 13:04:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:26,083 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-12-14 13:04:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:04:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-12-14 13:04:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:26,084 INFO L225 Difference]: With dead ends: 102 [2022-12-14 13:04:26,084 INFO L226 Difference]: Without dead ends: 102 [2022-12-14 13:04:26,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:04:26,086 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:26,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-12-14 13:04:26,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-12-14 13:04:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 100 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 13:04:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-12-14 13:04:26,091 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 8 [2022-12-14 13:04:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:26,091 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-12-14 13:04:26,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 13:04:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-12-14 13:04:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 13:04:26,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:26,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:26,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 13:04:26,092 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1485929392, now seen corresponding path program 1 times [2022-12-14 13:04:26,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:26,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413975048] [2022-12-14 13:04:26,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:26,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:04:26,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:26,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413975048] [2022-12-14 13:04:26,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413975048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:26,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:26,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:04:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079981334] [2022-12-14 13:04:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:26,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:04:26,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:26,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:04:26,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:04:26,200 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 13:04:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:26,314 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-12-14 13:04:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:04:26,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-12-14 13:04:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:26,315 INFO L225 Difference]: With dead ends: 101 [2022-12-14 13:04:26,315 INFO L226 Difference]: Without dead ends: 101 [2022-12-14 13:04:26,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:04:26,316 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 10 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:26,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 169 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-14 13:04:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2022-12-14 13:04:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 95 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 13:04:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2022-12-14 13:04:26,320 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 8 [2022-12-14 13:04:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:26,320 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2022-12-14 13:04:26,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states 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 13:04:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-12-14 13:04:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 13:04:26,320 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:26,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:26,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 13:04:26,321 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:26,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1029173125, now seen corresponding path program 1 times [2022-12-14 13:04:26,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:26,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242768728] [2022-12-14 13:04:26,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:26,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:26,394 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 13:04:26,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:26,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242768728] [2022-12-14 13:04:26,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242768728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:26,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:26,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:04:26,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122696407] [2022-12-14 13:04:26,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:26,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:04:26,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:26,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:04:26,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:04:26,396 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 13:04:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:26,529 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2022-12-14 13:04:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 13:04:26,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 13:04:26,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:26,530 INFO L225 Difference]: With dead ends: 151 [2022-12-14 13:04:26,530 INFO L226 Difference]: Without dead ends: 151 [2022-12-14 13:04:26,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:04:26,531 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 191 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:26,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 148 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-14 13:04:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 103. [2022-12-14 13:04:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.52) internal successors, (114), 102 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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 13:04:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2022-12-14 13:04:26,536 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 11 [2022-12-14 13:04:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:26,537 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2022-12-14 13:04:26,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 13:04:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2022-12-14 13:04:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 13:04:26,537 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:26,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:26,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 13:04:26,538 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash -627904864, now seen corresponding path program 1 times [2022-12-14 13:04:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:26,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036879839] [2022-12-14 13:04:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:26,621 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 13:04:26,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:26,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036879839] [2022-12-14 13:04:26,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036879839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:26,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:26,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:04:26,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744947029] [2022-12-14 13:04:26,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:26,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:04:26,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:26,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:04:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:04:26,623 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 13:04:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:26,717 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-12-14 13:04:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:04:26,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 13:04:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:26,718 INFO L225 Difference]: With dead ends: 103 [2022-12-14 13:04:26,718 INFO L226 Difference]: Without dead ends: 103 [2022-12-14 13:04:26,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:04:26,719 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 33 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:26,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 129 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-14 13:04:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-12-14 13:04:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 101 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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 13:04:26,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2022-12-14 13:04:26,722 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 13 [2022-12-14 13:04:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:26,722 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2022-12-14 13:04:26,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 13:04:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-12-14 13:04:26,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 13:04:26,723 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:26,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:26,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 13:04:26,723 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:26,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:26,723 INFO L85 PathProgramCache]: Analyzing trace with hash -627904863, now seen corresponding path program 1 times [2022-12-14 13:04:26,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:26,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440112059] [2022-12-14 13:04:26,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:26,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:26,846 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 13:04:26,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:26,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440112059] [2022-12-14 13:04:26,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440112059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:26,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:26,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:04:26,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867555753] [2022-12-14 13:04:26,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:26,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:04:26,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:26,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:04:26,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:04:26,848 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 13:04:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:26,938 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2022-12-14 13:04:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:04:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 13:04:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:26,939 INFO L225 Difference]: With dead ends: 99 [2022-12-14 13:04:26,939 INFO L226 Difference]: Without dead ends: 99 [2022-12-14 13:04:26,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 13:04:26,940 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:26,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 166 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-14 13:04:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2022-12-14 13:04:26,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 13:04:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-12-14 13:04:26,944 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 13 [2022-12-14 13:04:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:26,945 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-12-14 13:04:26,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 13:04:26,945 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-12-14 13:04:26,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 13:04:26,945 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:26,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:26,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 13:04:26,946 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:26,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1418323025, now seen corresponding path program 1 times [2022-12-14 13:04:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:26,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832059207] [2022-12-14 13:04:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:27,039 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 13:04:27,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:04:27,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832059207] [2022-12-14 13:04:27,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832059207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:27,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:27,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:04:27,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540129762] [2022-12-14 13:04:27,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:27,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:04:27,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:04:27,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:04:27,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:04:27,041 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 13:04:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:27,118 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-12-14 13:04:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:04:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 13:04:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:27,119 INFO L225 Difference]: With dead ends: 95 [2022-12-14 13:04:27,119 INFO L226 Difference]: Without dead ends: 95 [2022-12-14 13:04:27,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:04:27,120 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:27,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 162 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:04:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-14 13:04:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-12-14 13:04:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.457142857142857) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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 13:04:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2022-12-14 13:04:27,123 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 16 [2022-12-14 13:04:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:27,123 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2022-12-14 13:04:27,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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 13:04:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-12-14 13:04:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 13:04:27,124 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:27,124 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 13:04:27,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 13:04:27,124 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:27,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1018130780, now seen corresponding path program 1 times [2022-12-14 13:04:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:04:27,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266294131] [2022-12-14 13:04:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:04:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:04:27,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 13:04:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:04:27,160 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 13:04:27,160 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 13:04:27,161 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2022-12-14 13:04:27,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2022-12-14 13:04:27,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2022-12-14 13:04:27,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2022-12-14 13:04:27,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2022-12-14 13:04:27,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2022-12-14 13:04:27,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2022-12-14 13:04:27,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2022-12-14 13:04:27,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2022-12-14 13:04:27,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2022-12-14 13:04:27,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2022-12-14 13:04:27,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2022-12-14 13:04:27,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2022-12-14 13:04:27,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2022-12-14 13:04:27,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2022-12-14 13:04:27,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2022-12-14 13:04:27,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2022-12-14 13:04:27,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2022-12-14 13:04:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2022-12-14 13:04:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2022-12-14 13:04:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2022-12-14 13:04:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2022-12-14 13:04:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2022-12-14 13:04:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (31 of 55 remaining) [2022-12-14 13:04:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2022-12-14 13:04:27,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2022-12-14 13:04:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2022-12-14 13:04:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2022-12-14 13:04:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2022-12-14 13:04:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2022-12-14 13:04:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2022-12-14 13:04:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2022-12-14 13:04:27,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2022-12-14 13:04:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2022-12-14 13:04:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2022-12-14 13:04:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2022-12-14 13:04:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2022-12-14 13:04:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2022-12-14 13:04:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2022-12-14 13:04:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2022-12-14 13:04:27,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2022-12-14 13:04:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (13 of 55 remaining) [2022-12-14 13:04:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (12 of 55 remaining) [2022-12-14 13:04:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (11 of 55 remaining) [2022-12-14 13:04:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2022-12-14 13:04:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2022-12-14 13:04:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (8 of 55 remaining) [2022-12-14 13:04:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (7 of 55 remaining) [2022-12-14 13:04:27,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (6 of 55 remaining) [2022-12-14 13:04:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2022-12-14 13:04:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2022-12-14 13:04:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (3 of 55 remaining) [2022-12-14 13:04:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (2 of 55 remaining) [2022-12-14 13:04:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (1 of 55 remaining) [2022-12-14 13:04:27,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (0 of 55 remaining) [2022-12-14 13:04:27,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 13:04:27,173 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:27,177 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:04:27,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:04:27 BoogieIcfgContainer [2022-12-14 13:04:27,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:04:27,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:04:27,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:04:27,195 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:04:27,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:04:24" (3/4) ... [2022-12-14 13:04:27,199 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 13:04:27,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:04:27,199 INFO L158 Benchmark]: Toolchain (without parser) took 3393.42ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 92.3MB in the beginning and 114.6MB in the end (delta: -22.3MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2022-12-14 13:04:27,199 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:04:27,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.34ms. Allocated memory is still 127.9MB. Free memory was 92.3MB in the beginning and 74.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 13:04:27,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.72ms. Allocated memory is still 127.9MB. Free memory was 74.4MB in the beginning and 72.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:04:27,200 INFO L158 Benchmark]: Boogie Preprocessor took 30.34ms. Allocated memory is still 127.9MB. Free memory was 72.3MB in the beginning and 70.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:04:27,200 INFO L158 Benchmark]: RCFGBuilder took 495.10ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 70.6MB in the beginning and 134.2MB in the end (delta: -63.6MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2022-12-14 13:04:27,201 INFO L158 Benchmark]: TraceAbstraction took 2555.11ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 115.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-12-14 13:04:27,201 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 114.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:04:27,202 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.18ms. Allocated memory is still 127.9MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.34ms. Allocated memory is still 127.9MB. Free memory was 92.3MB in the beginning and 74.4MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.72ms. Allocated memory is still 127.9MB. Free memory was 74.4MB in the beginning and 72.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.34ms. Allocated memory is still 127.9MB. Free memory was 72.3MB in the beginning and 70.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 495.10ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 70.6MB in the beginning and 134.2MB in the end (delta: -63.6MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2555.11ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 115.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 114.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: 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: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1049. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={-1:0}] [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1039] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1043] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 105 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 849 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 849 mSDsluCounter, 1221 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 681 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1462 IncrementalHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 540 mSDtfsCounter, 1462 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 120 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 383 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 13:04:27,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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_8231c939-f839-4da5-a27d-71cf96d90c2c/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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- 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 13:04:28,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:04:28,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:04:28,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:04:28,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:04:28,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:04:28,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:04:28,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:04:28,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:04:28,861 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:04:28,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:04:28,863 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:04:28,863 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:04:28,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:04:28,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:04:28,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:04:28,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:04:28,868 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:04:28,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:04:28,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:04:28,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:04:28,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:04:28,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:04:28,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:04:28,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:04:28,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:04:28,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:04:28,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:04:28,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:04:28,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:04:28,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:04:28,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:04:28,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:04:28,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:04:28,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:04:28,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:04:28,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:04:28,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:04:28,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:04:28,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:04:28,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:04:28,889 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 13:04:28,911 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:04:28,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:04:28,911 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:04:28,911 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:04:28,912 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:04:28,912 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:04:28,912 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:04:28,912 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:04:28,913 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:04:28,913 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:04:28,913 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:04:28,913 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:04:28,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 13:04:28,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 13:04:28,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:04:28,914 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:04:28,914 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 13:04:28,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:04:28,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:04:28,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:04:28,915 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 13:04:28,915 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 13:04:28,915 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 13:04:28,915 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:04:28,915 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 13:04:28,915 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 13:04:28,916 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 13:04:28,916 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:04:28,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:04:28,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:04:28,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 13:04:28,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:04:28,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:04:28,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:04:28,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:04:28,917 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 13:04:28,917 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 13:04:28,917 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:04:28,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 13:04:28,917 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_8231c939-f839-4da5-a27d-71cf96d90c2c/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_8231c939-f839-4da5-a27d-71cf96d90c2c/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 -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2022-12-14 13:04:29,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:04:29,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:04:29,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:04:29,180 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:04:29,180 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:04:29,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2022-12-14 13:04:31,809 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:04:32,031 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:04:32,031 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2022-12-14 13:04:32,041 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/data/06d949320/b897cf2b8de344ec8f26f660d83c4534/FLAG37f2bc7f7 [2022-12-14 13:04:32,054 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/data/06d949320/b897cf2b8de344ec8f26f660d83c4534 [2022-12-14 13:04:32,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:04:32,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:04:32,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:04:32,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:04:32,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:04:32,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492abe05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32, skipping insertion in model container [2022-12-14 13:04:32,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:04:32,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:04:32,327 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2022-12-14 13:04:32,331 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2022-12-14 13:04:32,333 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2022-12-14 13:04:32,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:04:32,350 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:04:32,379 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2022-12-14 13:04:32,380 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2022-12-14 13:04:32,382 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_8231c939-f839-4da5-a27d-71cf96d90c2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2022-12-14 13:04:32,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:04:32,410 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:04:32,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32 WrapperNode [2022-12-14 13:04:32,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:04:32,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:04:32,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:04:32,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:04:32,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,467 INFO L138 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 120 [2022-12-14 13:04:32,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:04:32,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:04:32,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:04:32,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:04:32,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,493 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:04:32,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:04:32,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:04:32,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:04:32,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (1/1) ... [2022-12-14 13:04:32,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:04:32,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:04:32,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:04:32,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:04:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 13:04:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 13:04:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:04:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 13:04:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 13:04:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 13:04:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 13:04:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 13:04:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:04:32,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:04:32,657 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:04:32,659 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:04:33,112 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:04:33,119 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:04:33,119 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 13:04:33,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:04:33 BoogieIcfgContainer [2022-12-14 13:04:33,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:04:33,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:04:33,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:04:33,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:04:33,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:04:32" (1/3) ... [2022-12-14 13:04:33,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749a6a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:04:33, skipping insertion in model container [2022-12-14 13:04:33,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:04:32" (2/3) ... [2022-12-14 13:04:33,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749a6a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:04:33, skipping insertion in model container [2022-12-14 13:04:33,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:04:33" (3/3) ... [2022-12-14 13:04:33,131 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2022-12-14 13:04:33,150 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:04:33,151 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-12-14 13:04:33,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:04:33,202 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;@60c0510a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:04:33,202 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2022-12-14 13:04:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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 13:04:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 13:04:33,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:33,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 13:04:33,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:33,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-12-14 13:04:33,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:33,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517833018] [2022-12-14 13:04:33,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:33,233 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 13:04:33,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:33,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:33,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:33,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 13:04:33,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:04:33,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 13:04:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:04:33,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:04:33,352 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:04:33,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517833018] [2022-12-14 13:04:33,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517833018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:33,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:33,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:04:33,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442280459] [2022-12-14 13:04:33,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:33,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:04:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:04:33,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:04:33,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:04:33,379 INFO L87 Difference]: Start difference. First operand has 119 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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 13:04:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:33,588 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2022-12-14 13:04:33,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:04:33,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-12-14 13:04:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:33,596 INFO L225 Difference]: With dead ends: 121 [2022-12-14 13:04:33,596 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 13:04:33,597 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 13:04:33,599 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:33,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 71 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:04:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 13:04:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2022-12-14 13:04:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.875) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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 13:04:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-12-14 13:04:33,631 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 3 [2022-12-14 13:04:33,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:33,631 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-12-14 13:04:33,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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 13:04:33,632 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-12-14 13:04:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 13:04:33,632 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:33,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 13:04:33,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:33,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:33,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:33,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:33,836 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-12-14 13:04:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:33,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950275656] [2022-12-14 13:04:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:33,837 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 13:04:33,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:33,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:33,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:33,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 13:04:33,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:04:34,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 13:04:34,042 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 13:04:34,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:04:34,043 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:04:34,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950275656] [2022-12-14 13:04:34,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950275656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:34,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:34,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:04:34,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162374293] [2022-12-14 13:04:34,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:34,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:04:34,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:04:34,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:04:34,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:04:34,048 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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 13:04:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:34,293 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2022-12-14 13:04:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:04:34,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-12-14 13:04:34,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:34,295 INFO L225 Difference]: With dead ends: 131 [2022-12-14 13:04:34,295 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 13:04:34,295 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 13:04:34,296 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:34,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:04:34,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 13:04:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2022-12-14 13:04:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 117 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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 13:04:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2022-12-14 13:04:34,302 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 3 [2022-12-14 13:04:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:34,303 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2022-12-14 13:04:34,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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 13:04:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2022-12-14 13:04:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 13:04:34,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:34,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:34,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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)] Forceful destruction successful, exit code 0 [2022-12-14 13:04:34,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:34,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2022-12-14 13:04:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:34,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987234837] [2022-12-14 13:04:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:34,511 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 13:04:34,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:34,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:34,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:34,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:04:34,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:04:34,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 13:04:34,730 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 13:04:34,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 13:04:34,744 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 13:04:34,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:04:34,744 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:04:34,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987234837] [2022-12-14 13:04:34,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987234837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:34,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:34,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:04:34,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081737031] [2022-12-14 13:04:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:34,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:04:34,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:04:34,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:04:34,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:04:34,747 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 13:04:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:35,001 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-12-14 13:04:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:04:35,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-12-14 13:04:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:35,003 INFO L225 Difference]: With dead ends: 125 [2022-12-14 13:04:35,003 INFO L226 Difference]: Without dead ends: 125 [2022-12-14 13:04:35,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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 13:04:35,004 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 159 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:35,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 59 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:04:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-12-14 13:04:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2022-12-14 13:04:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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 13:04:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-12-14 13:04:35,012 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 7 [2022-12-14 13:04:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:35,013 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-12-14 13:04:35,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 13:04:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-12-14 13:04:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 13:04:35,013 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:35,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:35,021 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:35,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:35,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:35,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:35,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2022-12-14 13:04:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:35,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878490839] [2022-12-14 13:04:35,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:35,220 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 13:04:35,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:35,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:35,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:35,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 13:04:35,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:04:35,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 13:04:35,476 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 13:04:35,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 13:04:35,490 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 13:04:35,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:04:35,490 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:04:35,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878490839] [2022-12-14 13:04:35,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878490839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:35,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:35,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:04:35,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762758841] [2022-12-14 13:04:35,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:35,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:04:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:04:35,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:04:35,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:04:35,493 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 13:04:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:35,831 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2022-12-14 13:04:35,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:04:35,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-12-14 13:04:35,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:35,833 INFO L225 Difference]: With dead ends: 148 [2022-12-14 13:04:35,833 INFO L226 Difference]: Without dead ends: 148 [2022-12-14 13:04:35,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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 13:04:35,834 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 148 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:35,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 85 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:04:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-12-14 13:04:35,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2022-12-14 13:04:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 118 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 13:04:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2022-12-14 13:04:35,841 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 7 [2022-12-14 13:04:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:35,842 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2022-12-14 13:04:35,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 13:04:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-12-14 13:04:35,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 13:04:35,843 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:35,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:35,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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)] Forceful destruction successful, exit code 0 [2022-12-14 13:04:36,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:36,045 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1837273936, now seen corresponding path program 1 times [2022-12-14 13:04:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:36,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804113839] [2022-12-14 13:04:36,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:36,049 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 13:04:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:36,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:36,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:36,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 13:04:36,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:04:36,187 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 13:04:36,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:04:36,188 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:04:36,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804113839] [2022-12-14 13:04:36,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804113839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:36,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:36,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:04:36,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931950584] [2022-12-14 13:04:36,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:36,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:04:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:04:36,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:04:36,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:04:36,190 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 13:04:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:36,402 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2022-12-14 13:04:36,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:04:36,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 13:04:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:36,403 INFO L225 Difference]: With dead ends: 133 [2022-12-14 13:04:36,403 INFO L226 Difference]: Without dead ends: 133 [2022-12-14 13:04:36,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 13:04:36,404 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 120 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:36,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 126 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:04:36,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-14 13:04:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2022-12-14 13:04:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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 13:04:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-12-14 13:04:36,410 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 9 [2022-12-14 13:04:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:36,410 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-12-14 13:04:36,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 13:04:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-12-14 13:04:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 13:04:36,411 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:36,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:36,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:36,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:36,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:36,614 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-12-14 13:04:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:36,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869565591] [2022-12-14 13:04:36,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:36,616 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 13:04:36,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:36,620 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:36,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:36,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 13:04:36,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:04:36,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-12-14 13:04:36,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 13:04:36,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-14 13:04:36,778 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 13:04:36,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:04:36,778 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:04:36,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869565591] [2022-12-14 13:04:36,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869565591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:36,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:36,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:04:36,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330620191] [2022-12-14 13:04:36,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:36,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:04:36,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:04:36,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:04:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:04:36,780 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 13:04:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:37,142 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-12-14 13:04:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:04:37,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 13:04:37,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:37,143 INFO L225 Difference]: With dead ends: 118 [2022-12-14 13:04:37,143 INFO L226 Difference]: Without dead ends: 118 [2022-12-14 13:04:37,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:04:37,143 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:37,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 227 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:04:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-14 13:04:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2022-12-14 13:04:37,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 115 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 13:04:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2022-12-14 13:04:37,147 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 11 [2022-12-14 13:04:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:37,147 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2022-12-14 13:04:37,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 13:04:37,147 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2022-12-14 13:04:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 13:04:37,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:37,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:37,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:37,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:37,350 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:37,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:37,351 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-12-14 13:04:37,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:37,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941316355] [2022-12-14 13:04:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:37,353 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 13:04:37,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:37,357 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:37,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:37,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 13:04:37,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:04:37,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 13:04:37,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 13:04:37,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 13:04:37,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-14 13:04:37,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 13:04:37,540 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 13:04:37,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:04:37,540 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:04:37,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941316355] [2022-12-14 13:04:37,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941316355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:37,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:37,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:04:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121932078] [2022-12-14 13:04:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:37,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 13:04:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:04:37,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 13:04:37,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:04:37,543 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 13:04:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:38,024 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2022-12-14 13:04:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 13:04:38,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 13:04:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:38,025 INFO L225 Difference]: With dead ends: 117 [2022-12-14 13:04:38,025 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 13:04:38,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-14 13:04:38,025 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:38,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 263 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:04:38,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 13:04:38,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2022-12-14 13:04:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 13:04:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2022-12-14 13:04:38,028 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 11 [2022-12-14 13:04:38,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:38,029 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2022-12-14 13:04:38,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 13:04:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2022-12-14 13:04:38,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 13:04:38,029 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:38,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:38,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:38,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:38,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:38,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:38,232 INFO L85 PathProgramCache]: Analyzing trace with hash -831409633, now seen corresponding path program 1 times [2022-12-14 13:04:38,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:38,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648135450] [2022-12-14 13:04:38,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:38,234 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 13:04:38,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:38,235 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:38,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:38,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 13:04:38,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:04:38,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 13:04:38,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 13:04:38,343 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 13:04:38,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:04:38,343 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:04:38,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648135450] [2022-12-14 13:04:38,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648135450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:38,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:38,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:04:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384214677] [2022-12-14 13:04:38,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:38,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:04:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:04:38,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:04:38,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:04:38,345 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 13:04:38,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:38,683 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2022-12-14 13:04:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:04:38,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 13:04:38,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:38,685 INFO L225 Difference]: With dead ends: 173 [2022-12-14 13:04:38,685 INFO L226 Difference]: Without dead ends: 173 [2022-12-14 13:04:38,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:04:38,685 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 84 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:38,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 210 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:04:38,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-12-14 13:04:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2022-12-14 13:04:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 116 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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 13:04:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2022-12-14 13:04:38,688 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 12 [2022-12-14 13:04:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:38,689 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2022-12-14 13:04:38,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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 13:04:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2022-12-14 13:04:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 13:04:38,689 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:38,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:38,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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)] Forceful destruction successful, exit code 0 [2022-12-14 13:04:38,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:38,891 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1081092570, now seen corresponding path program 1 times [2022-12-14 13:04:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:38,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855718307] [2022-12-14 13:04:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:38,893 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 13:04:38,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:38,894 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:38,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:04:38,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 13:04:38,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:04:38,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 13:04:39,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-14 13:04:39,033 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 13:04:39,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:04:39,033 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 13:04:39,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855718307] [2022-12-14 13:04:39,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855718307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:04:39,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:04:39,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:04:39,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798598099] [2022-12-14 13:04:39,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:04:39,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:04:39,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 13:04:39,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:04:39,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:04:39,036 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:04:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:04:39,351 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-12-14 13:04:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:04:39,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 13:04:39,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:04:39,352 INFO L225 Difference]: With dead ends: 171 [2022-12-14 13:04:39,352 INFO L226 Difference]: Without dead ends: 171 [2022-12-14 13:04:39,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:04:39,353 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 75 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:04:39,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 209 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:04:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-12-14 13:04:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 121. [2022-12-14 13:04:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 0 states 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 13:04:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2022-12-14 13:04:39,356 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 18 [2022-12-14 13:04:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:04:39,356 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2022-12-14 13:04:39,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:04:39,356 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2022-12-14 13:04:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 13:04:39,356 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:04:39,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:39,364 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:39,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:39,559 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2022-12-14 13:04:39,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:04:39,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1080781688, now seen corresponding path program 1 times [2022-12-14 13:04:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 13:04:39,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640791568] [2022-12-14 13:04:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:04:39,562 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 13:04:39,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 13:04:39,565 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:39,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:04:39,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 13:04:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 13:04:39,774 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-12-14 13:04:39,774 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 13:04:39,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2022-12-14 13:04:39,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2022-12-14 13:04:39,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2022-12-14 13:04:39,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 55 remaining) [2022-12-14 13:04:39,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2022-12-14 13:04:39,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2022-12-14 13:04:39,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2022-12-14 13:04:39,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2022-12-14 13:04:39,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2022-12-14 13:04:39,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2022-12-14 13:04:39,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2022-12-14 13:04:39,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2022-12-14 13:04:39,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2022-12-14 13:04:39,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2022-12-14 13:04:39,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2022-12-14 13:04:39,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2022-12-14 13:04:39,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2022-12-14 13:04:39,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2022-12-14 13:04:39,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2022-12-14 13:04:39,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2022-12-14 13:04:39,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2022-12-14 13:04:39,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2022-12-14 13:04:39,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2022-12-14 13:04:39,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (31 of 55 remaining) [2022-12-14 13:04:39,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2022-12-14 13:04:39,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2022-12-14 13:04:39,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2022-12-14 13:04:39,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2022-12-14 13:04:39,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2022-12-14 13:04:39,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2022-12-14 13:04:39,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2022-12-14 13:04:39,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2022-12-14 13:04:39,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2022-12-14 13:04:39,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 55 remaining) [2022-12-14 13:04:39,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 55 remaining) [2022-12-14 13:04:39,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 55 remaining) [2022-12-14 13:04:39,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 55 remaining) [2022-12-14 13:04:39,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2022-12-14 13:04:39,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2022-12-14 13:04:39,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2022-12-14 13:04:39,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2022-12-14 13:04:39,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (13 of 55 remaining) [2022-12-14 13:04:39,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (12 of 55 remaining) [2022-12-14 13:04:39,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (11 of 55 remaining) [2022-12-14 13:04:39,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2022-12-14 13:04:39,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2022-12-14 13:04:39,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (8 of 55 remaining) [2022-12-14 13:04:39,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (7 of 55 remaining) [2022-12-14 13:04:39,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (6 of 55 remaining) [2022-12-14 13:04:39,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2022-12-14 13:04:39,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2022-12-14 13:04:39,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (3 of 55 remaining) [2022-12-14 13:04:39,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (2 of 55 remaining) [2022-12-14 13:04:39,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (1 of 55 remaining) [2022-12-14 13:04:39,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (0 of 55 remaining) [2022-12-14 13:04:39,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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)] Forceful destruction successful, exit code 0 [2022-12-14 13:04:39,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 13:04:39,991 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:04:40,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:04:40,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:04:40 BoogieIcfgContainer [2022-12-14 13:04:40,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:04:40,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:04:40,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:04:40,039 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:04:40,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:04:33" (3/4) ... [2022-12-14 13:04:40,042 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 13:04:40,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:04:40,042 INFO L158 Benchmark]: Toolchain (without parser) took 7985.25ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 52.5MB in the beginning and 44.2MB in the end (delta: 8.3MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2022-12-14 13:04:40,042 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:04:40,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.00ms. Allocated memory is still 75.5MB. Free memory was 52.3MB in the beginning and 33.6MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 13:04:40,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.96ms. Allocated memory is still 75.5MB. Free memory was 33.6MB in the beginning and 54.8MB in the end (delta: -21.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 13:04:40,043 INFO L158 Benchmark]: Boogie Preprocessor took 24.10ms. Allocated memory is still 75.5MB. Free memory was 54.8MB in the beginning and 52.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:04:40,043 INFO L158 Benchmark]: RCFGBuilder took 625.43ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 52.7MB in the beginning and 66.5MB in the end (delta: -13.8MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2022-12-14 13:04:40,044 INFO L158 Benchmark]: TraceAbstraction took 6913.95ms. Allocated memory is still 92.3MB. Free memory was 65.9MB in the beginning and 44.8MB in the end (delta: 21.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2022-12-14 13:04:40,044 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 92.3MB. Free memory was 44.8MB in the beginning and 44.2MB in the end (delta: 610.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:04:40,045 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.00ms. Allocated memory is still 75.5MB. Free memory was 52.3MB in the beginning and 33.6MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.96ms. Allocated memory is still 75.5MB. Free memory was 33.6MB in the beginning and 54.8MB in the end (delta: -21.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.10ms. Allocated memory is still 75.5MB. Free memory was 54.8MB in the beginning and 52.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 625.43ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 52.7MB in the beginning and 66.5MB in the end (delta: -13.8MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6913.95ms. Allocated memory is still 92.3MB. Free memory was 65.9MB in the beginning and 44.8MB in the end (delta: 21.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 92.3MB. Free memory was 44.8MB in the beginning and 44.2MB in the end (delta: 610.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1049. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={6:0}] [L1008] list->colour = BLACK VAL [list={6:0}] [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={6:0}, list={6:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1039] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1043] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={6:0}, end->next={0:0}, list={6:0}] [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={6:0}, list={6:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 846 mSDsluCounter, 1326 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 735 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1262 IncrementalHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 591 mSDtfsCounter, 1262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 191 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 26 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 13:04:40,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8231c939-f839-4da5-a27d-71cf96d90c2c/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample