./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d04e0a263780757f9d0a81eb77d81932d95f9f5fc37920c99d442b84c4e5091a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 01:39:57,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 01:39:57,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 01:39:57,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 01:39:57,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 01:39:57,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 01:39:57,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 01:39:57,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 01:39:57,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 01:39:57,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 01:39:57,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 01:39:57,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 01:39:57,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 01:39:57,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 01:39:57,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 01:39:57,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 01:39:57,318 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 01:39:57,319 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 01:39:57,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 01:39:57,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 01:39:57,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 01:39:57,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 01:39:57,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 01:39:57,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 01:39:57,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 01:39:57,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 01:39:57,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 01:39:57,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 01:39:57,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 01:39:57,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 01:39:57,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 01:39:57,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 01:39:57,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 01:39:57,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 01:39:57,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 01:39:57,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 01:39:57,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 01:39:57,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 01:39:57,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 01:39:57,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 01:39:57,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 01:39:57,352 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 01:39:57,380 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 01:39:57,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 01:39:57,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 01:39:57,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 01:39:57,385 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 01:39:57,385 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 01:39:57,386 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 01:39:57,386 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 01:39:57,386 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 01:39:57,386 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 01:39:57,387 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 01:39:57,387 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 01:39:57,387 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 01:39:57,388 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 01:39:57,388 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 01:39:57,388 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 01:39:57,389 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 01:39:57,389 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 01:39:57,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 01:39:57,390 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 01:39:57,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 01:39:57,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 01:39:57,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 01:39:57,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 01:39:57,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 01:39:57,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 01:39:57,393 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 01:39:57,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 01:39:57,394 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 01:39:57,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 01:39:57,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 01:39:57,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 01:39:57,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:39:57,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 01:39:57,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 01:39:57,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 01:39:57,397 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 01:39:57,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 01:39:57,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 01:39:57,398 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 01:39:57,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 01:39:57,398 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/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_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P 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 ! call(reach_error())) ) 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 -> d04e0a263780757f9d0a81eb77d81932d95f9f5fc37920c99d442b84c4e5091a [2021-11-21 01:39:57,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 01:39:57,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 01:39:57,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 01:39:57,730 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 01:39:57,731 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 01:39:57,732 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2021-11-21 01:39:57,812 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/data/a0e0947ea/839f60b8ba9d40d9b8d18863df53268d/FLAG29fd2c6df [2021-11-21 01:39:58,335 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 01:39:58,335 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2021-11-21 01:39:58,344 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/data/a0e0947ea/839f60b8ba9d40d9b8d18863df53268d/FLAG29fd2c6df [2021-11-21 01:39:58,705 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/data/a0e0947ea/839f60b8ba9d40d9b8d18863df53268d [2021-11-21 01:39:58,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 01:39:58,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 01:39:58,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 01:39:58,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 01:39:58,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 01:39:58,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:39:58" (1/1) ... [2021-11-21 01:39:58,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20850f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:58, skipping insertion in model container [2021-11-21 01:39:58,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:39:58" (1/1) ... [2021-11-21 01:39:58,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 01:39:58,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 01:39:58,962 WARN L230 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_39cd27d8-fdea-4e1b-b3dc-89732073599e/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1126,1139] [2021-11-21 01:39:58,971 WARN L230 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_39cd27d8-fdea-4e1b-b3dc-89732073599e/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1880,1893] [2021-11-21 01:39:58,976 WARN L230 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_39cd27d8-fdea-4e1b-b3dc-89732073599e/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[2401,2414] [2021-11-21 01:39:58,981 WARN L230 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_39cd27d8-fdea-4e1b-b3dc-89732073599e/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[3193,3206] [2021-11-21 01:39:58,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:39:58,992 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 01:39:59,010 WARN L230 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_39cd27d8-fdea-4e1b-b3dc-89732073599e/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1126,1139] [2021-11-21 01:39:59,014 WARN L230 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_39cd27d8-fdea-4e1b-b3dc-89732073599e/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[1880,1893] [2021-11-21 01:39:59,018 WARN L230 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_39cd27d8-fdea-4e1b-b3dc-89732073599e/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[2401,2414] [2021-11-21 01:39:59,022 WARN L230 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_39cd27d8-fdea-4e1b-b3dc-89732073599e/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c[3193,3206] [2021-11-21 01:39:59,025 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 01:39:59,040 INFO L208 MainTranslator]: Completed translation [2021-11-21 01:39:59,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59 WrapperNode [2021-11-21 01:39:59,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 01:39:59,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 01:39:59,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 01:39:59,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 01:39:59,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,085 INFO L137 Inliner]: procedures = 15, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2021-11-21 01:39:59,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 01:39:59,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 01:39:59,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 01:39:59,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 01:39:59,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,109 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 01:39:59,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 01:39:59,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 01:39:59,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 01:39:59,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (1/1) ... [2021-11-21 01:39:59,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 01:39:59,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:39:59,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 01:39:59,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 01:39:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 01:39:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 01:39:59,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-21 01:39:59,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 01:39:59,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 01:39:59,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-21 01:39:59,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-21 01:39:59,350 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 01:39:59,352 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 01:39:59,551 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 01:39:59,564 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 01:39:59,565 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-21 01:39:59,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:39:59 BoogieIcfgContainer [2021-11-21 01:39:59,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 01:39:59,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 01:39:59,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 01:39:59,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 01:39:59,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:39:58" (1/3) ... [2021-11-21 01:39:59,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70978bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:39:59, skipping insertion in model container [2021-11-21 01:39:59,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:39:59" (2/3) ... [2021-11-21 01:39:59,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70978bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:39:59, skipping insertion in model container [2021-11-21 01:39:59,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:39:59" (3/3) ... [2021-11-21 01:39:59,576 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2021-11-21 01:39:59,582 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 01:39:59,583 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-21 01:39:59,636 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 01:39:59,644 INFO L339 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 01:39:59,645 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-21 01:39:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:39:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-21 01:39:59,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:39:59,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:39:59,669 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-21 01:39:59,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:39:59,675 INFO L85 PathProgramCache]: Analyzing trace with hash -238958999, now seen corresponding path program 1 times [2021-11-21 01:39:59,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:39:59,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282842011] [2021-11-21 01:39:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:39:59,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:39:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:00,017 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:40:00,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282842011] [2021-11-21 01:40:00,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282842011] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:40:00,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:40:00,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 01:40:00,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285887414] [2021-11-21 01:40:00,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:40:00,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:40:00,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:40:00,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:40:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:40:00,061 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.7) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 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, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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) [2021-11-21 01:40:00,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:40:00,100 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2021-11-21 01:40:00,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:40:00,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 [2021-11-21 01:40:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:40:00,112 INFO L225 Difference]: With dead ends: 47 [2021-11-21 01:40:00,112 INFO L226 Difference]: Without dead ends: 29 [2021-11-21 01:40:00,115 INFO L932 BasicCegarLoop]: 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 [2021-11-21 01:40:00,120 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:40:00,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 58 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:40:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-21 01:40:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-11-21 01:40:00,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-11-21 01:40:00,158 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 8 [2021-11-21 01:40:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:40:00,159 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-11-21 01:40:00,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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) [2021-11-21 01:40:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2021-11-21 01:40:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-21 01:40:00,160 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:40:00,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:40:00,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 01:40:00,162 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-21 01:40:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:40:00,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1055861953, now seen corresponding path program 1 times [2021-11-21 01:40:00,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:40:00,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088267776] [2021-11-21 01:40:00,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:40:00,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:40:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:00,206 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:40:00,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088267776] [2021-11-21 01:40:00,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088267776] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:40:00,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:40:00,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 01:40:00,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678505599] [2021-11-21 01:40:00,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:40:00,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:40:00,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:40:00,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:40:00,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:40:00,211 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2021-11-21 01:40:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:40:00,246 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2021-11-21 01:40:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:40:00,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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 [2021-11-21 01:40:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:40:00,249 INFO L225 Difference]: With dead ends: 55 [2021-11-21 01:40:00,249 INFO L226 Difference]: Without dead ends: 34 [2021-11-21 01:40:00,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:40:00,251 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:40:00,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:40:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-11-21 01:40:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2021-11-21 01:40:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-11-21 01:40:00,260 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2021-11-21 01:40:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:40:00,260 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-11-21 01:40:00,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2021-11-21 01:40:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-11-21 01:40:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-21 01:40:00,262 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:40:00,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:40:00,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 01:40:00,263 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-21 01:40:00,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:40:00,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1125304774, now seen corresponding path program 1 times [2021-11-21 01:40:00,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:40:00,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987652085] [2021-11-21 01:40:00,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:40:00,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:40:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:00,334 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:40:00,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987652085] [2021-11-21 01:40:00,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987652085] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:40:00,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:40:00,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-21 01:40:00,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107287377] [2021-11-21 01:40:00,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:40:00,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 01:40:00,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:40:00,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 01:40:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 01:40:00,341 INFO L87 Difference]: Start difference. First operand 27 states and 31 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) [2021-11-21 01:40:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:40:00,397 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2021-11-21 01:40:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-21 01:40:00,398 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 [2021-11-21 01:40:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:40:00,399 INFO L225 Difference]: With dead ends: 48 [2021-11-21 01:40:00,399 INFO L226 Difference]: Without dead ends: 46 [2021-11-21 01:40:00,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-21 01:40:00,402 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:40:00,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 79 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:40:00,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-11-21 01:40:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2021-11-21 01:40:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-11-21 01:40:00,411 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 9 [2021-11-21 01:40:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:40:00,412 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-11-21 01:40:00,412 INFO L471 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) [2021-11-21 01:40:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-11-21 01:40:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-21 01:40:00,413 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:40:00,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:40:00,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 01:40:00,414 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-21 01:40:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:40:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash -461793925, now seen corresponding path program 1 times [2021-11-21 01:40:00,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:40:00,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22735430] [2021-11-21 01:40:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:40:00,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:40:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:00,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:40:00,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22735430] [2021-11-21 01:40:00,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22735430] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:40:00,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:40:00,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 01:40:00,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977255411] [2021-11-21 01:40:00,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:40:00,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-21 01:40:00,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:40:00,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-21 01:40:00,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:40:00,458 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:40:00,506 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2021-11-21 01:40:00,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-21 01:40:00,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-21 01:40:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:40:00,508 INFO L225 Difference]: With dead ends: 51 [2021-11-21 01:40:00,508 INFO L226 Difference]: Without dead ends: 30 [2021-11-21 01:40:00,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-21 01:40:00,514 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:40:00,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:40:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-21 01:40:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-11-21 01:40:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-11-21 01:40:00,530 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2021-11-21 01:40:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:40:00,530 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-11-21 01:40:00,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-11-21 01:40:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 01:40:00,534 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:40:00,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:40:00,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-21 01:40:00,536 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-21 01:40:00,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:40:00,536 INFO L85 PathProgramCache]: Analyzing trace with hash 67089498, now seen corresponding path program 1 times [2021-11-21 01:40:00,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:40:00,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612014732] [2021-11-21 01:40:00,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:40:00,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:40:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:02,500 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:40:02,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612014732] [2021-11-21 01:40:02,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612014732] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:40:02,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:40:02,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-21 01:40:02,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817037124] [2021-11-21 01:40:02,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:40:02,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-21 01:40:02,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:40:02,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-21 01:40:02,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-21 01:40:02,503 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:40:02,952 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2021-11-21 01:40:02,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-21 01:40:02,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-21 01:40:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:40:02,956 INFO L225 Difference]: With dead ends: 42 [2021-11-21 01:40:02,956 INFO L226 Difference]: Without dead ends: 26 [2021-11-21 01:40:02,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:40:02,960 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 50 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-21 01:40:02,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 38 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-21 01:40:02,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-21 01:40:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-11-21 01:40:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-11-21 01:40:02,967 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2021-11-21 01:40:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:40:02,968 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-11-21 01:40:02,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-11-21 01:40:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-21 01:40:02,969 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:40:02,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:40:02,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-21 01:40:02,970 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-21 01:40:02,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:40:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1399323306, now seen corresponding path program 1 times [2021-11-21 01:40:02,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:40:02,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663898604] [2021-11-21 01:40:02,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:40:02,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:40:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:03,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:40:03,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663898604] [2021-11-21 01:40:03,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663898604] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:40:03,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 01:40:03,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-21 01:40:03,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465751903] [2021-11-21 01:40:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:40:03,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 01:40:03,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:40:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 01:40:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-21 01:40:03,032 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2021-11-21 01:40:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:40:03,087 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2021-11-21 01:40:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 01:40:03,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 [2021-11-21 01:40:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:40:03,089 INFO L225 Difference]: With dead ends: 39 [2021-11-21 01:40:03,089 INFO L226 Difference]: Without dead ends: 37 [2021-11-21 01:40:03,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-21 01:40:03,091 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 42 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 01:40:03,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 92 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 01:40:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-21 01:40:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2021-11-21 01:40:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-11-21 01:40:03,098 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2021-11-21 01:40:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:40:03,098 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-21 01:40:03,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2021-11-21 01:40:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-11-21 01:40:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-21 01:40:03,099 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:40:03,100 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:40:03,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-21 01:40:03,100 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-21 01:40:03,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:40:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1507348966, now seen corresponding path program 1 times [2021-11-21 01:40:03,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:40:03,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809634480] [2021-11-21 01:40:03,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:40:03,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:40:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:03,230 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:40:03,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809634480] [2021-11-21 01:40:03,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809634480] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:40:03,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204362786] [2021-11-21 01:40:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:40:03,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:40:03,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:40:03,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:40:03,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-21 01:40:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:03,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-21 01:40:03,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:40:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:03,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:40:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:03,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204362786] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:40:03,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [479766866] [2021-11-21 01:40:03,593 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2021-11-21 01:40:03,594 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:40:03,599 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:40:03,605 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:40:03,605 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:40:03,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:40:03,729 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-21 01:40:03,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2021-11-21 01:40:03,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:40:03,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2021-11-21 01:40:07,299 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 01:40:09,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [479766866] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:40:09,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:40:09,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [6, 4, 4] total 21 [2021-11-21 01:40:09,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449928389] [2021-11-21 01:40:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:40:09,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-21 01:40:09,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:40:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-21 01:40:09,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-11-21 01:40:09,535 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:40:09,907 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2021-11-21 01:40:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-21 01:40:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-21 01:40:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:40:09,910 INFO L225 Difference]: With dead ends: 38 [2021-11-21 01:40:09,910 INFO L226 Difference]: Without dead ends: 30 [2021-11-21 01:40:09,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-11-21 01:40:09,912 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-21 01:40:09,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-21 01:40:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-21 01:40:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2021-11-21 01:40:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2021-11-21 01:40:09,919 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 18 [2021-11-21 01:40:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:40:09,919 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2021-11-21 01:40:09,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2021-11-21 01:40:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-21 01:40:09,921 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 01:40:09,921 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:40:09,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-21 01:40:10,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-21 01:40:10,145 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-21 01:40:10,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 01:40:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1799200339, now seen corresponding path program 1 times [2021-11-21 01:40:10,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 01:40:10,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450003528] [2021-11-21 01:40:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:40:10,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 01:40:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:10,414 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 01:40:10,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450003528] [2021-11-21 01:40:10,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450003528] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-21 01:40:10,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378859357] [2021-11-21 01:40:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 01:40:10,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:40:10,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 01:40:10,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 01:40:10,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-21 01:40:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 01:40:10,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-21 01:40:10,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 01:40:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:10,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 01:40:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 01:40:11,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378859357] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 01:40:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1834936178] [2021-11-21 01:40:11,102 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-21 01:40:11,102 INFO L166 IcfgInterpreter]: Building call graph [2021-11-21 01:40:11,103 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-21 01:40:11,103 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-21 01:40:11,103 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-21 01:40:11,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:40:11,159 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-11-21 01:40:11,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2021-11-21 01:40:11,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:40:11,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-21 01:40:11,243 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-21 01:40:11,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 49 [2021-11-21 01:40:17,486 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-21 01:40:20,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1834936178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 01:40:20,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-21 01:40:20,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [8, 4, 4] total 26 [2021-11-21 01:40:20,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809672838] [2021-11-21 01:40:20,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 01:40:20,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-21 01:40:20,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 01:40:20,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-21 01:40:20,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2021-11-21 01:40:20,921 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:21,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 01:40:21,760 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-11-21 01:40:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-21 01:40:21,761 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-21 01:40:21,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 01:40:21,761 INFO L225 Difference]: With dead ends: 26 [2021-11-21 01:40:21,762 INFO L226 Difference]: Without dead ends: 0 [2021-11-21 01:40:21,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2021-11-21 01:40:21,763 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-21 01:40:21,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 2 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-21 01:40:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-21 01:40:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-21 01:40:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-21 01:40:21,765 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-11-21 01:40:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 01:40:21,765 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-21 01:40:21,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 01:40:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-21 01:40:21,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-21 01:40:21,768 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2021-11-21 01:40:21,769 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2021-11-21 01:40:21,769 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2021-11-21 01:40:21,769 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2021-11-21 01:40:21,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-21 01:40:21,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 01:40:21,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-21 01:40:25,459 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 93) no Hoare annotation was computed. [2021-11-21 01:40:25,460 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2021-11-21 01:40:25,460 INFO L854 garLoopResultBuilder]: At program point L151(lines 29 152) the Hoare annotation is: false [2021-11-21 01:40:25,460 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-21 01:40:25,460 INFO L854 garLoopResultBuilder]: At program point L119(lines 98 128) the Hoare annotation is: (let ((.cse28 (select |#memory_int| 1)) (.cse3 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|)) (.cse7 (mod |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 4294967296))) (let ((.cse0 (= (select |#length| 3) 12)) (.cse1 (= 45 (select |#length| 2))) (.cse15 (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 1)) (.cse2 (= |ULTIMATE.start_main_~__tmp_1~0#1| 1)) (.cse6 (= ~__tmp_155_0~0 |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1|)) (.cse8 (= 2 (select |#length| 1))) (.cse9 (= (select |#valid| 3) 1)) (.cse10 (< .cse7 100000)) (.cse11 (= |ULTIMATE.start_main_~main__loop_entered~0#1| 1)) (.cse12 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0#1.base|)) (.cse13 (= ~__return_136~0 0)) (.cse14 (= (select |#valid| 1) 1)) (.cse5 (mod (select .cse3 (+ |ULTIMATE.start_main_~#main__array~0#1.offset| (* .cse7 4))) 4294967296)) (.cse16 (= 400000 (select |#length| |ULTIMATE.start_main_~#main__array~0#1.base|))) (.cse17 (= (select |#valid| 0) 0)) (.cse18 (= (select |#valid| 2) 1)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (= (select |#valid| |ULTIMATE.start_main_~#main__array~0#1.base|) 1)) (.cse21 (= (select .cse28 0) 48)) (.cse22 (= (select .cse28 1) 0)) (.cse23 (= ~__return_main~0 0)) (.cse24 (= |ULTIMATE.start_main_~#main__array~0#1.offset| 0)) (.cse25 (< 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0))) (or (let ((.cse4 (mod (+ 4294967295 |ULTIMATE.start_main_~main__index1~0#1|) 4294967296))) (and .cse0 .cse1 .cse2 (= (mod (select .cse3 (+ |ULTIMATE.start_main_~#main__array~0#1.offset| (* .cse4 4))) 4294967296) .cse5) .cse6 (< .cse4 .cse7) .cse8 (= ~__tmp_155_0~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse15 |ULTIMATE.start_main_~main__index1~0#1|) .cse16 (= (+ |ULTIMATE.start_main_~main__index2~0#1| 1) |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1|) .cse17 .cse18 .cse19 .cse20 .cse21 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1) .cse22 (<= (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296) (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296)) .cse23 .cse24 .cse25 .cse26)) (let ((.cse27 (mod |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 4294967296))) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse0 .cse1 (= .cse15 |ULTIMATE.start_main_~main____CPAchecker_TMP_4~0#1|) (= |ULTIMATE.start_main_~__tmp_3~0#1| 1) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| |ULTIMATE.start_main_~__tmp_3~0#1|) (= ~__tmp_155_0~0 |ULTIMATE.start_main_~__tmp_1~0#1|) .cse2 (= |ULTIMATE.start_main_~main__index2~0#1| |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1|) .cse6 (= (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_3~0#1| 1) |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1|) (= (+ |ULTIMATE.start_main_~main__index1~0#1| 1) |ULTIMATE.start_main_~main____CPAchecker_TMP_4~0#1|) .cse8 .cse9 .cse10 .cse11 .cse12 (< .cse27 .cse7) .cse13 .cse14 (= (mod (select .cse3 (+ |ULTIMATE.start_main_~#main__array~0#1.offset| (* .cse27 4))) 4294967296) .cse5) .cse16 .cse17 .cse18 .cse19 (< (mod (+ 4294967295 |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1|) 4294967296) (mod |ULTIMATE.start_main_~main____CPAchecker_TMP_4~0#1| 4294967296)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))))) [2021-11-21 01:40:25,461 INFO L861 garLoopResultBuilder]: At program point L194(lines 14 196) the Hoare annotation is: true [2021-11-21 01:40:25,461 INFO L858 garLoopResultBuilder]: For program point L62(lines 62 88) no Hoare annotation was computed. [2021-11-21 01:40:25,461 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 152) no Hoare annotation was computed. [2021-11-21 01:40:25,461 INFO L854 garLoopResultBuilder]: At program point L87(lines 62 88) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 4294967296)) (.cse3 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| 1) (= (select |#length| 3) 12) (= 45 (select |#length| 2)) (= ~__tmp_155_0~0 |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~__tmp_1~0#1| 1) (= ~__tmp_155_0~0 |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1|) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (< .cse0 100000) (= |ULTIMATE.start_main_~main__loop_entered~0#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0#1.base|) (< .cse1 .cse0) (= ~__return_136~0 0) (<= (+ |ULTIMATE.start_main_~main__index1~0#1| 1 (* 4294967296 (div |ULTIMATE.start_main_~main__index2~0#1| 4294967296))) (+ (* 4294967296 (div |ULTIMATE.start_main_~main__index1~0#1| 4294967296)) |ULTIMATE.start_main_~main__index2~0#1|)) (= (select |#valid| 1) 1) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse2 (+ |ULTIMATE.start_main_~#main__array~0#1.offset| (* .cse1 4))) 4294967296) (mod (select .cse2 (+ |ULTIMATE.start_main_~#main__array~0#1.offset| (* .cse0 4))) 4294967296))) (= (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 1) |ULTIMATE.start_main_~main__index1~0#1|) (= 400000 (select |#length| |ULTIMATE.start_main_~#main__array~0#1.base|)) (= (+ |ULTIMATE.start_main_~main__index2~0#1| 1) |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1|) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#main__array~0#1.base|) 1) (= (select .cse3 0) 48) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1) (= (select .cse3 1) 0) (= ~__return_main~0 0) (= |ULTIMATE.start_main_~#main__array~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:40:25,462 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 167) no Hoare annotation was computed. [2021-11-21 01:40:25,462 INFO L858 garLoopResultBuilder]: For program point L21(lines 21 195) no Hoare annotation was computed. [2021-11-21 01:40:25,462 INFO L854 garLoopResultBuilder]: At program point L79(lines 46 139) the Hoare annotation is: (let ((.cse24 (select |#memory_int| 1)) (.cse23 (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1))) (let ((.cse0 (= (select |#length| 3) 12)) (.cse1 (= 45 (select |#length| 2))) (.cse2 (= ~__tmp_155_0~0 |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1|)) (.cse3 (= 2 (select |#length| 1))) (.cse4 (= (select |#valid| 3) 1)) (.cse6 (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0#1.base|)) (.cse7 (let ((.cse28 (* 4294967296 (div |ULTIMATE.start_main_~main__index2~0#1| 4294967296)))) (let ((.cse25 (<= |ULTIMATE.start_main_~main__index2~0#1| (+ 99999 .cse28))) (.cse26 (<= (+ |ULTIMATE.start_main_~main__index1~0#1| 1 .cse28) (+ (* 4294967296 (div |ULTIMATE.start_main_~main__index1~0#1| 4294967296)) |ULTIMATE.start_main_~main__index2~0#1|))) (.cse27 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1))) (or (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0)) .cse25 .cse26 (not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| 0)) .cse27) (and .cse25 .cse26 .cse23 .cse27))))) (.cse9 (= ~__return_136~0 0)) (.cse10 (= (select |#valid| 1) 1)) (.cse12 (= 400000 (select |#length| |ULTIMATE.start_main_~#main__array~0#1.base|))) (.cse13 (= (select |#valid| 0) 0)) (.cse14 (= (select |#valid| 2) 1)) (.cse15 (= |#NULL.offset| 0)) (.cse16 (= (select |#valid| |ULTIMATE.start_main_~#main__array~0#1.base|) 1)) (.cse17 (= (select .cse24 0) 48)) (.cse18 (= (select .cse24 1) 0)) (.cse19 (= ~__return_main~0 0)) (.cse20 (= |ULTIMATE.start_main_~#main__array~0#1.offset| 0)) (.cse21 (< 0 |#StackHeapBarrier|)) (.cse22 (= |#NULL.base| 0))) (or (let ((.cse8 (mod |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 4294967296)) (.cse5 (mod |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 4294967296))) (and (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| 1) .cse0 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| |ULTIMATE.start_main_~__tmp_2~0#1|) .cse1 (= ~__tmp_155_0~0 |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~__tmp_1~0#1| 1) .cse2 .cse3 .cse4 (< .cse5 100000) (= |ULTIMATE.start_main_~main__loop_entered~0#1| 1) .cse6 .cse7 (< .cse8 .cse5) .cse9 .cse10 (let ((.cse11 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse11 (+ |ULTIMATE.start_main_~#main__array~0#1.offset| (* .cse8 4))) 4294967296) (mod (select .cse11 (+ |ULTIMATE.start_main_~#main__array~0#1.offset| (* .cse5 4))) 4294967296))) (= (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 1) |ULTIMATE.start_main_~main__index1~0#1|) .cse12 (= (+ |ULTIMATE.start_main_~main__index2~0#1| 1) |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| |ULTIMATE.start_main_~__tmp_2~0#1|) .cse22)) (and (= |ULTIMATE.start_main_~main__loop_entered~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse12 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse18 .cse19 .cse20 .cse21 .cse22)))) [2021-11-21 01:40:25,462 INFO L858 garLoopResultBuilder]: For program point L71(lines 71 80) no Hoare annotation was computed. [2021-11-21 01:40:25,462 INFO L854 garLoopResultBuilder]: At program point L146(lines 31 147) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div |ULTIMATE.start_main_~main__index2~0#1| 4294967296))) (.cse1 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~main__loop_entered~0#1| 0) (= (select |#length| 3) 12) (= 45 (select |#length| 2)) (= ~__tmp_155_0~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0#1.base|) (= ~__return_136~0 0) (<= |ULTIMATE.start_main_~main__index2~0#1| (+ 99999 .cse0)) (<= (+ |ULTIMATE.start_main_~main__index1~0#1| 1 .cse0) (+ (* 4294967296 (div |ULTIMATE.start_main_~main__index1~0#1| 4294967296)) |ULTIMATE.start_main_~main__index2~0#1|)) (= (select |#valid| 1) 1) (= 400000 (select |#length| |ULTIMATE.start_main_~#main__array~0#1.base|)) (= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#main__array~0#1.base|) 1) (= (select .cse1 0) 48) (= (select .cse1 1) 0) (= ~__return_main~0 0) (= |ULTIMATE.start_main_~#main__array~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:40:25,463 INFO L858 garLoopResultBuilder]: For program point L97(lines 97 132) no Hoare annotation was computed. [2021-11-21 01:40:25,463 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 147) no Hoare annotation was computed. [2021-11-21 01:40:25,463 INFO L854 garLoopResultBuilder]: At program point L172(lines 26 185) the Hoare annotation is: (let ((.cse1 (mod |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 4294967296)) (.cse0 (mod |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 4294967296)) (.cse3 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= 45 (select |#length| 2)) (= |ULTIMATE.start_main_~__tmp_3~0#1| 1) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| |ULTIMATE.start_main_~__tmp_3~0#1|) (= ~__tmp_155_0~0 |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~__tmp_1~0#1| 1) (= ~__tmp_155_0~0 |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1|) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (< .cse0 100000) (= |ULTIMATE.start_main_~main__loop_entered~0#1| 1) (< (mod |ULTIMATE.start_main_~main__index2~0#1| 4294967296) (mod |ULTIMATE.start_main_~main__index1~0#1| 4294967296)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#main__array~0#1.base|) (< .cse1 .cse0) (= ~__return_136~0 0) (= (select |#valid| 1) 1) (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0#1.base|))) (= (mod (select .cse2 (+ |ULTIMATE.start_main_~#main__array~0#1.offset| (* .cse1 4))) 4294967296) (mod (select .cse2 (+ |ULTIMATE.start_main_~#main__array~0#1.offset| (* .cse0 4))) 4294967296))) (= (+ |ULTIMATE.start_main_~main____CPAchecker_TMP_1~0#1| 1) |ULTIMATE.start_main_~main__index1~0#1|) (= 400000 (select |#length| |ULTIMATE.start_main_~#main__array~0#1.base|)) (= (+ |ULTIMATE.start_main_~main__index2~0#1| 1) |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1|) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#main__array~0#1.base|) 1) (= (select .cse3 0) 48) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 1) (= (select .cse3 1) 0) (= ~__return_main~0 0) (= |ULTIMATE.start_main_~#main__array~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2021-11-21 01:40:25,463 INFO L858 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2021-11-21 01:40:25,463 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 139) no Hoare annotation was computed. [2021-11-21 01:40:25,464 INFO L861 garLoopResultBuilder]: At program point L131(lines 97 132) the Hoare annotation is: true [2021-11-21 01:40:25,464 INFO L858 garLoopResultBuilder]: For program point L156(lines 156 184) no Hoare annotation was computed. [2021-11-21 01:40:25,464 INFO L858 garLoopResultBuilder]: For program point L57(lines 57 133) no Hoare annotation was computed. [2021-11-21 01:40:25,464 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 190) no Hoare annotation was computed. [2021-11-21 01:40:25,464 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2021-11-21 01:40:25,464 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 120) no Hoare annotation was computed. [2021-11-21 01:40:25,464 INFO L858 garLoopResultBuilder]: For program point L165(lines 165 173) no Hoare annotation was computed. [2021-11-21 01:40:25,464 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-21 01:40:25,465 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 138) no Hoare annotation was computed. [2021-11-21 01:40:25,465 INFO L858 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2021-11-21 01:40:25,465 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 179) no Hoare annotation was computed. [2021-11-21 01:40:25,465 INFO L854 garLoopResultBuilder]: At program point L92(lines 60 93) the Hoare annotation is: false [2021-11-21 01:40:25,465 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 185) no Hoare annotation was computed. [2021-11-21 01:40:25,465 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 109) no Hoare annotation was computed. [2021-11-21 01:40:25,466 INFO L858 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2021-11-21 01:40:25,466 INFO L858 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2021-11-21 01:40:25,469 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 01:40:25,470 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 01:40:25,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:40:25 BoogieIcfgContainer [2021-11-21 01:40:25,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 01:40:25,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 01:40:25,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 01:40:25,514 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 01:40:25,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:39:59" (3/4) ... [2021-11-21 01:40:25,518 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-21 01:40:25,530 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-11-21 01:40:25,531 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-21 01:40:25,531 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-21 01:40:25,532 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-21 01:40:25,588 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-21 01:40:25,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 01:40:25,589 INFO L158 Benchmark]: Toolchain (without parser) took 26879.41ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 105.5MB in the beginning and 88.8MB in the end (delta: 16.7MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2021-11-21 01:40:25,590 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 148.9MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:40:25,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.96ms. Allocated memory is still 148.9MB. Free memory was 105.4MB in the beginning and 119.1MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 01:40:25,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.63ms. Allocated memory is still 148.9MB. Free memory was 119.1MB in the beginning and 117.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 01:40:25,591 INFO L158 Benchmark]: Boogie Preprocessor took 28.42ms. Allocated memory is still 148.9MB. Free memory was 117.1MB in the beginning and 116.5MB in the end (delta: 650.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 01:40:25,592 INFO L158 Benchmark]: RCFGBuilder took 452.53ms. Allocated memory is still 148.9MB. Free memory was 115.8MB in the beginning and 103.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-21 01:40:25,592 INFO L158 Benchmark]: TraceAbstraction took 25944.62ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 102.5MB in the beginning and 94.1MB in the end (delta: 8.4MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2021-11-21 01:40:25,593 INFO L158 Benchmark]: Witness Printer took 74.63ms. Allocated memory is still 199.2MB. Free memory was 94.1MB in the beginning and 88.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-21 01:40:25,595 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.31ms. Allocated memory is still 148.9MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.96ms. Allocated memory is still 148.9MB. Free memory was 105.4MB in the beginning and 119.1MB in the end (delta: -13.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.63ms. Allocated memory is still 148.9MB. Free memory was 119.1MB in the beginning and 117.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.42ms. Allocated memory is still 148.9MB. Free memory was 117.1MB in the beginning and 116.5MB in the end (delta: 650.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 452.53ms. Allocated memory is still 148.9MB. Free memory was 115.8MB in the beginning and 103.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25944.62ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 102.5MB in the beginning and 94.1MB in the end (delta: 8.4MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. * Witness Printer took 74.63ms. Allocated memory is still 199.2MB. Free memory was 94.1MB in the beginning and 88.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 42]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 109]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 167]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 25.8s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 371 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 208 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 468 IncrementalHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 164 mSDtfsCounter, 468 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 63, 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, 8 MinimizatonAttempts, 51 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 22 NumberOfFragments, 1151 HoareAnnotationTreeSize, 9 FomulaSimplifications, 703 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 2210 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 3976 SizeOfPredicates, 4 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 12/21 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: OVERALL_TIME: 10.1s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 37, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 51, TOOLS_POST_TIME: 9.8s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 51, TOOLS_QUANTIFIERELIM_TIME: 9.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 96, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 4, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 37, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 3, LOOP_SUMMARIZER_CACHE_MISSES: 3, LOOP_SUMMARIZER_OVERALL_TIME: 2.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 475, DAG_COMPRESSION_RETAINED_NODES: 105, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 45 == unknown-#length-unknown[2]) && __tmp_1 == 1) && unknown-#memory_int-unknown[main__array][main__array + (4294967295 + main__index1) % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296) && __tmp_155_0 == main____CPAchecker_TMP_0) && (4294967295 + main__index1) % 4294967296 < main____CPAchecker_TMP_2 % 4294967296) && 2 == unknown-#length-unknown[1]) && __tmp_155_0 == 1) && \valid[3] == 1) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && main__loop_entered == 1) && unknown-#StackHeapBarrier-unknown < main__array) && __return_136 == 0) && \valid[1] == 1) && main____CPAchecker_TMP_1 + 1 == main__index1) && 400000 == unknown-#length-unknown[main__array]) && main__index2 + 1 == main____CPAchecker_TMP_2) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && \valid[main__array] == 1) && unknown-#memory_int-unknown[1][0] == 48) && __VERIFIER_assert__cond == 1) && unknown-#memory_int-unknown[1][1] == 0) && main__index2 % 4294967296 <= main__index1 % 4294967296) && __return_main == 0) && main__array == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((((((((((((((((((((((((((((__VERIFIER_assert__cond == __tmp_1 && unknown-#length-unknown[3] == 12) && 45 == unknown-#length-unknown[2]) && main____CPAchecker_TMP_1 + 1 == main____CPAchecker_TMP_4) && __tmp_3 == 1) && __VERIFIER_assert__cond == __tmp_3) && __tmp_155_0 == __tmp_1) && __tmp_1 == 1) && main__index2 == main____CPAchecker_TMP_2) && __tmp_155_0 == main____CPAchecker_TMP_0) && main____CPAchecker_TMP_3 + 1 == main____CPAchecker_TMP_2) && main__index1 + 1 == main____CPAchecker_TMP_4) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && main__loop_entered == 1) && unknown-#StackHeapBarrier-unknown < main__array) && main____CPAchecker_TMP_1 % 4294967296 < main____CPAchecker_TMP_2 % 4294967296) && __return_136 == 0) && \valid[1] == 1) && unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_1 % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296) && 400000 == unknown-#length-unknown[main__array]) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && (4294967295 + main____CPAchecker_TMP_2) % 4294967296 < main____CPAchecker_TMP_4 % 4294967296) && \valid[main__array] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && main__array == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((((((((((((((main__loop_entered == 0 && unknown-#length-unknown[3] == 12) && 45 == unknown-#length-unknown[2]) && __tmp_155_0 == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && unknown-#StackHeapBarrier-unknown < main__array) && __return_136 == 0) && main__index2 <= 99999 + 4294967296 * (main__index2 / 4294967296)) && main__index1 + 1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2) && \valid[1] == 1) && 400000 == unknown-#length-unknown[main__array]) && main____CPAchecker_TMP_0 == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && \valid[main__array] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && main__array == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((main____CPAchecker_TMP_0 == 1 && unknown-#length-unknown[3] == 12) && __VERIFIER_assert__cond == __tmp_2) && 45 == unknown-#length-unknown[2]) && __tmp_155_0 == __tmp_1) && __tmp_1 == 1) && __tmp_155_0 == main____CPAchecker_TMP_0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && main__loop_entered == 1) && unknown-#StackHeapBarrier-unknown < main__array) && (((((!(__VERIFIER_assert__cond == 0) && main__index2 <= 99999 + 4294967296 * (main__index2 / 4294967296)) && main__index1 + 1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2) && !(main____CPAchecker_TMP_0 == 0)) && __VERIFIER_assert__cond == 1) || (((main__index2 <= 99999 + 4294967296 * (main__index2 / 4294967296) && main__index1 + 1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1))) && main____CPAchecker_TMP_1 % 4294967296 < main____CPAchecker_TMP_2 % 4294967296) && __return_136 == 0) && \valid[1] == 1) && unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_1 % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296) && main____CPAchecker_TMP_1 + 1 == main__index1) && 400000 == unknown-#length-unknown[main__array]) && main__index2 + 1 == main____CPAchecker_TMP_2) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && \valid[main__array] == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && main__array == 0) && 0 < unknown-#StackHeapBarrier-unknown) && main____CPAchecker_TMP_0 == __tmp_2) && #NULL == 0) || ((((((((((((((((((((((main__loop_entered == 0 && unknown-#length-unknown[3] == 12) && 45 == unknown-#length-unknown[2]) && __tmp_155_0 == main____CPAchecker_TMP_0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && unknown-#StackHeapBarrier-unknown < main__array) && (((((!(__VERIFIER_assert__cond == 0) && main__index2 <= 99999 + 4294967296 * (main__index2 / 4294967296)) && main__index1 + 1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2) && !(main____CPAchecker_TMP_0 == 0)) && __VERIFIER_assert__cond == 1) || (((main__index2 <= 99999 + 4294967296 * (main__index2 / 4294967296) && main__index1 + 1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2) && main____CPAchecker_TMP_0 == 1) && __VERIFIER_assert__cond == 1))) && __return_136 == 0) && \valid[1] == 1) && 400000 == unknown-#length-unknown[main__array]) && main____CPAchecker_TMP_0 == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && \valid[main__array] == 1) && unknown-#memory_int-unknown[1][0] == 48) && main____CPAchecker_TMP_0 == __tmp_1) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && main__array == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((main____CPAchecker_TMP_0 == 1 && unknown-#length-unknown[3] == 12) && 45 == unknown-#length-unknown[2]) && __tmp_155_0 == __tmp_1) && __tmp_1 == 1) && __tmp_155_0 == main____CPAchecker_TMP_0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && main__loop_entered == 1) && unknown-#StackHeapBarrier-unknown < main__array) && main____CPAchecker_TMP_1 % 4294967296 < main____CPAchecker_TMP_2 % 4294967296) && __return_136 == 0) && main__index1 + 1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2) && \valid[1] == 1) && unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_1 % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296) && main____CPAchecker_TMP_1 + 1 == main__index1) && 400000 == unknown-#length-unknown[main__array]) && main__index2 + 1 == main____CPAchecker_TMP_2) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && \valid[main__array] == 1) && unknown-#memory_int-unknown[1][0] == 48) && __VERIFIER_assert__cond == 1) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && main__array == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && 45 == unknown-#length-unknown[2]) && __tmp_3 == 1) && __VERIFIER_assert__cond == __tmp_3) && __tmp_155_0 == __tmp_1) && __tmp_1 == 1) && __tmp_155_0 == main____CPAchecker_TMP_0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && main____CPAchecker_TMP_2 % 4294967296 < 100000) && main__loop_entered == 1) && main__index2 % 4294967296 < main__index1 % 4294967296) && unknown-#StackHeapBarrier-unknown < main__array) && main____CPAchecker_TMP_1 % 4294967296 < main____CPAchecker_TMP_2 % 4294967296) && __return_136 == 0) && \valid[1] == 1) && unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_1 % 4294967296 * 4] % 4294967296 == unknown-#memory_int-unknown[main__array][main__array + main____CPAchecker_TMP_2 % 4294967296 * 4] % 4294967296) && main____CPAchecker_TMP_1 + 1 == main__index1) && 400000 == unknown-#length-unknown[main__array]) && main__index2 + 1 == main____CPAchecker_TMP_2) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && \valid[main__array] == 1) && unknown-#memory_int-unknown[1][0] == 48) && __VERIFIER_assert__cond == 1) && unknown-#memory_int-unknown[1][1] == 0) && __return_main == 0) && main__array == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0 RESULT: Ultimate proved your program to be correct! [2021-11-21 01:40:25,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39cd27d8-fdea-4e1b-b3dc-89732073599e/bin/utaipan-TEXQjIfE4P/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: TRUE