./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 604294306b5c2c89672e57997bbce546f96c9935 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 07:01:39,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 07:01:39,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 07:01:39,121 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 07:01:39,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 07:01:39,122 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 07:01:39,123 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 07:01:39,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 07:01:39,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 07:01:39,125 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 07:01:39,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 07:01:39,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 07:01:39,126 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 07:01:39,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 07:01:39,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 07:01:39,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 07:01:39,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 07:01:39,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 07:01:39,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 07:01:39,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 07:01:39,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 07:01:39,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 07:01:39,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 07:01:39,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 07:01:39,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 07:01:39,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 07:01:39,135 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 07:01:39,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 07:01:39,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 07:01:39,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 07:01:39,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 07:01:39,137 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 07:01:39,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 07:01:39,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 07:01:39,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 07:01:39,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 07:01:39,138 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 07:01:39,145 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 07:01:39,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 07:01:39,146 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 07:01:39,146 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 07:01:39,146 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 07:01:39,147 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 07:01:39,147 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 07:01:39,147 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 07:01:39,147 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 07:01:39,147 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 07:01:39,147 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 07:01:39,147 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 07:01:39,147 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 07:01:39,148 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 07:01:39,148 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 07:01:39,149 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 07:01:39,149 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 07:01:39,149 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 07:01:39,149 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 07:01:39,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:01:39,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 07:01:39,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 07:01:39,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 07:01:39,149 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 07:01:39,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 07:01:39,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 07:01:39,150 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 07:01:39,150 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan 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(__VERIFIER_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 -> 604294306b5c2c89672e57997bbce546f96c9935 [2018-12-02 07:01:39,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 07:01:39,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 07:01:39,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 07:01:39,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 07:01:39,179 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 07:01:39,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-12-02 07:01:39,225 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/data/4effbf364/c4e92b81a0514713a911cabcb4f653ad/FLAGb82dde6ad [2018-12-02 07:01:39,653 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 07:01:39,654 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-12-02 07:01:39,657 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/data/4effbf364/c4e92b81a0514713a911cabcb4f653ad/FLAGb82dde6ad [2018-12-02 07:01:39,666 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/data/4effbf364/c4e92b81a0514713a911cabcb4f653ad [2018-12-02 07:01:39,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 07:01:39,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 07:01:39,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 07:01:39,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 07:01:39,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 07:01:39,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1782ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39, skipping insertion in model container [2018-12-02 07:01:39,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 07:01:39,689 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 07:01:39,781 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:01:39,784 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 07:01:39,799 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 07:01:39,811 INFO L195 MainTranslator]: Completed translation [2018-12-02 07:01:39,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39 WrapperNode [2018-12-02 07:01:39,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 07:01:39,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 07:01:39,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 07:01:39,812 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 07:01:39,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 07:01:39,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 07:01:39,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 07:01:39,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 07:01:39,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... [2018-12-02 07:01:39,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 07:01:39,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 07:01:39,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 07:01:39,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 07:01:39,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 07:01:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 07:01:39,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 07:01:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 07:01:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 07:01:39,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 07:01:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 07:01:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 07:01:39,900 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 07:01:39,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 07:01:40,027 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 07:01:40,027 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-02 07:01:40,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:01:40 BoogieIcfgContainer [2018-12-02 07:01:40,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 07:01:40,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 07:01:40,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 07:01:40,030 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 07:01:40,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:01:39" (1/3) ... [2018-12-02 07:01:40,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8b96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:01:40, skipping insertion in model container [2018-12-02 07:01:40,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:01:39" (2/3) ... [2018-12-02 07:01:40,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8b96e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:01:40, skipping insertion in model container [2018-12-02 07:01:40,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:01:40" (3/3) ... [2018-12-02 07:01:40,032 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-12-02 07:01:40,038 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 07:01:40,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 07:01:40,051 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 07:01:40,069 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 07:01:40,069 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 07:01:40,069 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 07:01:40,069 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 07:01:40,069 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 07:01:40,070 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 07:01:40,070 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 07:01:40,070 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 07:01:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-02 07:01:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 07:01:40,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:01:40,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:01:40,085 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:01:40,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:01:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2018-12-02 07:01:40,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:01:40,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:01:40,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:01:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:01:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:01:40,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:01:40,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:01:40,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:01:40,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:01:40,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:01:40,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:01:40,201 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-12-02 07:01:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:01:40,220 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2018-12-02 07:01:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:01:40,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 07:01:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:01:40,227 INFO L225 Difference]: With dead ends: 51 [2018-12-02 07:01:40,227 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 07:01:40,229 INFO L631 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 [2018-12-02 07:01:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 07:01:40,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-02 07:01:40,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 07:01:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-12-02 07:01:40,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2018-12-02 07:01:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:01:40,251 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-12-02 07:01:40,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:01:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-12-02 07:01:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 07:01:40,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:01:40,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:01:40,252 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:01:40,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:01:40,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2018-12-02 07:01:40,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:01:40,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:01:40,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:01:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:01:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:01:40,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:01:40,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 07:01:40,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:01:40,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 07:01:40,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 07:01:40,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 07:01:40,285 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2018-12-02 07:01:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:01:40,313 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-12-02 07:01:40,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 07:01:40,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-02 07:01:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:01:40,315 INFO L225 Difference]: With dead ends: 51 [2018-12-02 07:01:40,315 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 07:01:40,315 INFO L631 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 [2018-12-02 07:01:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 07:01:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-12-02 07:01:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 07:01:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-02 07:01:40,319 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2018-12-02 07:01:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:01:40,319 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-02 07:01:40,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 07:01:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-02 07:01:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 07:01:40,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:01:40,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:01:40,319 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:01:40,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:01:40,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2018-12-02 07:01:40,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:01:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:01:40,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:01:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:01:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:01:40,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:01:40,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:01:40,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:01:40,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:01:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:01:40,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:01:40,343 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-12-02 07:01:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:01:40,371 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-12-02 07:01:40,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:01:40,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 07:01:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:01:40,372 INFO L225 Difference]: With dead ends: 60 [2018-12-02 07:01:40,372 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 07:01:40,372 INFO L631 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 [2018-12-02 07:01:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 07:01:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-12-02 07:01:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 07:01:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 07:01:40,375 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-12-02 07:01:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:01:40,375 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 07:01:40,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:01:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-02 07:01:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 07:01:40,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:01:40,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:01:40,376 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:01:40,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:01:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2018-12-02 07:01:40,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:01:40,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:01:40,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:01:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:01:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:01:40,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:01:40,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 07:01:40,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:01:40,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 07:01:40,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 07:01:40,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 07:01:40,395 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-12-02 07:01:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:01:40,416 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-12-02 07:01:40,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 07:01:40,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-02 07:01:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:01:40,417 INFO L225 Difference]: With dead ends: 54 [2018-12-02 07:01:40,417 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 07:01:40,418 INFO L631 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 [2018-12-02 07:01:40,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 07:01:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-12-02 07:01:40,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-02 07:01:40,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-12-02 07:01:40,420 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2018-12-02 07:01:40,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:01:40,420 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-02 07:01:40,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 07:01:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-12-02 07:01:40,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 07:01:40,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:01:40,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:01:40,421 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:01:40,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:01:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2018-12-02 07:01:40,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:01:40,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:01:40,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:40,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:01:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:01:40,954 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 83 [2018-12-02 07:01:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:01:40,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:01:40,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 07:01:40,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:01:40,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 07:01:40,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 07:01:40,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:01:40,999 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2018-12-02 07:01:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:01:41,252 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-12-02 07:01:41,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 07:01:41,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-02 07:01:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:01:41,254 INFO L225 Difference]: With dead ends: 46 [2018-12-02 07:01:41,254 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 07:01:41,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-12-02 07:01:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 07:01:41,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-02 07:01:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 07:01:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-02 07:01:41,258 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2018-12-02 07:01:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:01:41,259 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-02 07:01:41,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 07:01:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-02 07:01:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 07:01:41,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:01:41,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:01:41,260 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:01:41,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:01:41,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2018-12-02 07:01:41,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:01:41,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:41,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:01:41,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:41,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:01:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:01:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:01:41,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 07:01:41,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 07:01:41,293 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 07:01:41,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 07:01:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 07:01:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 07:01:41,294 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2018-12-02 07:01:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:01:41,333 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-02 07:01:41,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 07:01:41,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-02 07:01:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:01:41,334 INFO L225 Difference]: With dead ends: 42 [2018-12-02 07:01:41,334 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 07:01:41,334 INFO L631 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 [2018-12-02 07:01:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 07:01:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-12-02 07:01:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 07:01:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-02 07:01:41,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2018-12-02 07:01:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:01:41,337 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-02 07:01:41,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 07:01:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-02 07:01:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 07:01:41,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 07:01:41,338 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 07:01:41,338 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 07:01:41,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:01:41,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2018-12-02 07:01:41,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 07:01:41,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:41,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:01:41,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 07:01:41,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 07:01:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:01:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:01:41,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:01:41,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 07:01:41,408 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-02 07:01:41,410 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [62], [66], [69], [70], [72], [91], [92], [93] [2018-12-02 07:01:41,429 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 07:01:41,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 07:01:41,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 07:01:41,518 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 120 root evaluator evaluations with a maximum evaluation depth of 6. Performed 120 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 36 variables. [2018-12-02 07:01:41,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 07:01:41,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 07:01:41,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 07:01:41,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 07:01:41,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 07:01:41,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 07:01:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 07:01:41,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 07:01:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:01:41,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 07:01:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 07:01:41,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 07:01:41,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-12-02 07:01:41,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 07:01:41,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 07:01:41,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 07:01:41,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 07:01:41,651 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-12-02 07:01:42,761 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-12-02 07:01:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 07:01:47,452 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-02 07:01:47,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 07:01:47,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-02 07:01:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 07:01:47,458 INFO L225 Difference]: With dead ends: 30 [2018-12-02 07:01:47,458 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 07:01:47,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-02 07:01:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 07:01:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 07:01:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 07:01:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 07:01:47,459 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-02 07:01:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 07:01:47,459 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 07:01:47,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 07:01:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 07:01:47,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 07:01:47,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 07:01:49,619 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-12-02 07:01:57,889 WARN L180 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-12-02 07:01:58,049 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-12-02 07:01:58,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-02 07:01:58,096 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-02 07:01:58,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 07:01:58,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 07:01:58,096 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 07:01:58,096 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 07:01:58,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 07:01:58,096 INFO L451 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2018-12-02 07:01:58,096 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2018-12-02 07:01:58,097 INFO L444 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (and (let ((.cse5 (div main_~main__index2~0 4294967296)) (.cse6 (div main_~main__index1~0 4294967296))) (or (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse3 (select .cse4 (+ (* (- 17179869184) .cse6) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse2 (select .cse4 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse5))))) (let ((.cse1 (+ (* 4294967296 (div .cse3 4294967296)) .cse2)) (.cse0 (+ (* 4294967296 (div .cse2 4294967296)) .cse3))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))))) (<= (+ main_~main__index1~0 (* 4294967296 .cse5)) (+ (* 4294967296 .cse6) main_~main__index2~0)))) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) (+ (- main_~main__index2~0) 99998)) 4294967296)) 1))) (= main_~main__loop_entered~0 0)) [2018-12-02 07:01:58,097 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-12-02 07:01:58,097 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2018-12-02 07:01:58,097 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-12-02 07:01:58,097 INFO L444 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse9 (div main_~main__index1~0 4294967296)) (.cse8 (div main_~main__index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse8)) (.cse2 (+ (* 4294967296 .cse9) main_~main__index2~0)) (.cse1 (= main_~__VERIFIER_assert__cond~0 1))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) (<= main_~main__index2~0 (+ .cse0 99999)) .cse1 (<= (+ main_~main__index1~0 .cse0 1) .cse2)) (and (or (let ((.cse7 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse6 (select .cse7 (+ (* (- 17179869184) .cse9) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse5 (select .cse7 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse8))))) (let ((.cse4 (+ (* 4294967296 (div .cse6 4294967296)) .cse5)) (.cse3 (+ (* 4294967296 (div .cse5 4294967296)) .cse6))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))))) (<= (+ main_~main__index1~0 .cse0) .cse2)) .cse1 (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) (+ (- main_~main__index2~0) 99998)) 4294967296)) 1)))))) [2018-12-02 07:01:58,097 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-12-02 07:01:58,097 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-12-02 07:01:58,098 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-12-02 07:01:58,098 INFO L444 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= main_~main__index1~0 (+ main_~main__index2~0 (* 4294967296 (div (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) (+ (- main_~main__index2~0) 99998)) 4294967296)) 1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) [2018-12-02 07:01:58,098 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2018-12-02 07:01:58,098 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2018-12-02 07:01:58,098 INFO L444 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse0 (<= main_~main__index2~0 (+ .cse2 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1))) (or (and .cse0 .cse1 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= 0 main_~__VERIFIER_assert__cond~1))) (and (= main_~main____CPAchecker_TMP_0~0 1) .cse0 .cse1))) (<= (+ main_~main__index1~0 .cse2 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-12-02 07:01:58,098 INFO L448 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2018-12-02 07:01:58,098 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-02 07:01:58,098 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-12-02 07:01:58,098 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-12-02 07:01:58,098 INFO L444 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-12-02 07:01:58,098 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2018-12-02 07:01:58,099 INFO L444 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-12-02 07:01:58,099 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2018-12-02 07:01:58,099 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: true [2018-12-02 07:01:58,099 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-12-02 07:01:58,099 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-12-02 07:01:58,099 INFO L444 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-12-02 07:01:58,099 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-12-02 07:01:58,099 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-12-02 07:01:58,099 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-12-02 07:01:58,103 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,104 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,105 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,109 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,110 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,111 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,112 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:01:58 BoogieIcfgContainer [2018-12-02 07:01:58,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 07:01:58,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 07:01:58,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 07:01:58,117 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 07:01:58,117 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:01:40" (3/4) ... [2018-12-02 07:01:58,119 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 07:01:58,123 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 07:01:58,123 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 07:01:58,126 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-02 07:01:58,126 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-02 07:01:58,126 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 07:01:58,158 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9f50246c-cc97-491a-856d-ea3ed4bd5446/bin-2019/utaipan/witness.graphml [2018-12-02 07:01:58,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 07:01:58,159 INFO L168 Benchmark]: Toolchain (without parser) took 18491.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 962.4 MB in the beginning and 772.9 MB in the end (delta: 189.6 MB). Peak memory consumption was 301.3 MB. Max. memory is 11.5 GB. [2018-12-02 07:01:58,160 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 07:01:58,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.31 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 07:01:58,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-02 07:01:58,160 INFO L168 Benchmark]: Boogie Preprocessor took 14.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 07:01:58,160 INFO L168 Benchmark]: RCFGBuilder took 158.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2018-12-02 07:01:58,161 INFO L168 Benchmark]: TraceAbstraction took 18088.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 777.1 MB in the end (delta: 307.4 MB). Peak memory consumption was 307.4 MB. Max. memory is 11.5 GB. [2018-12-02 07:01:58,161 INFO L168 Benchmark]: Witness Printer took 42.34 ms. Allocated memory is still 1.1 GB. Free memory was 777.1 MB in the beginning and 772.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2018-12-02 07:01:58,162 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.31 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18088.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 777.1 MB in the end (delta: 307.4 MB). Peak memory consumption was 307.4 MB. Max. memory is 11.5 GB. * Witness Printer took 42.34 ms. Allocated memory is still 1.1 GB. Free memory was 777.1 MB in the beginning and 772.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2018-12-02 07:01:58,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,165 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,166 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,167 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,168 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) + unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] <= 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] && 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) + unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2) && __VERIFIER_assert__cond == 1) && main__index1 <= main__index2 + 4294967296 * ((4294967296 * ((main__index1 + -1) / 4294967296) + (-main__index2 + 99998)) / 4294967296) + 1) || main__loop_entered == 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2018-12-02 07:01:58,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,177 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,178 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,179 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 07:01:58,180 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((!(0 == __VERIFIER_assert__cond) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) + unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] <= 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] && 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) + unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2) && __VERIFIER_assert__cond == 1) && main__index1 <= main__index2 + 4294967296 * ((4294967296 * ((main__index1 + -1) / 4294967296) + (-main__index2 + 99998)) / 4294967296) + 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && !(0 == main____CPAchecker_TMP_0)) && main__index1 <= main__index2 + 4294967296 * ((4294967296 * ((main__index1 + -1) / 4294967296) + (-main__index2 + 99998)) / 4294967296) + 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main____CPAchecker_TMP_0 == 1 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(0 == __VERIFIER_assert__cond)) || ((main____CPAchecker_TMP_0 == 1 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. SAFE Result, 18.0s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 10.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 200 SDtfs, 179 SDslu, 261 SDs, 0 SdLazy, 148 SolverSat, 20 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 46 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 529 HoareAnnotationTreeSize, 12 FomulaSimplifications, 644 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 131 FormulaSimplificationTreeSizeReductionInter, 10.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 58845 SizeOfPredicates, 3 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...