./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/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 d80676b9a99131191df12fd74204f331d0509f64 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:15:49,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:15:49,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:15:49,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:15:49,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:15:49,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:15:49,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:15:49,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:15:49,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:15:49,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:15:49,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:15:49,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:15:49,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:15:49,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:15:49,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:15:49,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:15:49,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:15:49,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:15:49,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:15:49,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:15:49,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:15:49,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:15:49,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:15:49,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:15:49,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:15:49,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:15:49,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:15:49,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:15:49,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:15:49,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:15:49,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:15:49,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:15:49,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:15:49,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:15:49,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:15:49,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:15:49,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:15:49,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:15:49,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:15:49,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:15:49,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:15:49,044 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:15:49,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:15:49,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:15:49,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:15:49,058 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:15:49,058 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:15:49,058 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:15:49,058 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:15:49,058 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:15:49,059 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:15:49,059 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:15:49,059 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:15:49,059 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:15:49,059 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:15:49,059 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:15:49,060 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:15:49,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:15:49,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:15:49,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:15:49,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:15:49,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:15:49,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:15:49,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:15:49,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:15:49,061 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:15:49,061 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:15:49,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:15:49,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:15:49,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:15:49,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:15:49,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:15:49,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:15:49,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:15:49,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:15:49,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:15:49,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:15:49,064 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:15:49,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:15:49,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:15:49,064 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:15:49,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:15:49,064 INFO L138 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/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/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 -> d80676b9a99131191df12fd74204f331d0509f64 [2019-12-07 11:15:49,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:15:49,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:15:49,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:15:49,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:15:49,174 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:15:49,174 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-12-07 11:15:49,210 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/data/85fa59399/2d2c5c25177145f4bc37339557d28245/FLAGaaaeaa531 [2019-12-07 11:15:49,636 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:15:49,637 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-12-07 11:15:49,642 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/data/85fa59399/2d2c5c25177145f4bc37339557d28245/FLAGaaaeaa531 [2019-12-07 11:15:49,650 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/data/85fa59399/2d2c5c25177145f4bc37339557d28245 [2019-12-07 11:15:49,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:15:49,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:15:49,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:15:49,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:15:49,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:15:49,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b40e489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49, skipping insertion in model container [2019-12-07 11:15:49,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:15:49,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:15:49,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:15:49,836 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:15:49,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:15:49,868 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:15:49,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49 WrapperNode [2019-12-07 11:15:49,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:15:49,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:15:49,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:15:49,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:15:49,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,882 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:15:49,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:15:49,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:15:49,899 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:15:49,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... [2019-12-07 11:15:49,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:15:49,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:15:49,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:15:49,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:15:49,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/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 [2019-12-07 11:15:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:15:49,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:15:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:15:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:15:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:15:50,171 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:15:50,171 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 11:15:50,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:15:50 BoogieIcfgContainer [2019-12-07 11:15:50,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:15:50,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:15:50,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:15:50,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:15:50,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:15:49" (1/3) ... [2019-12-07 11:15:50,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1497d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:15:50, skipping insertion in model container [2019-12-07 11:15:50,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:15:49" (2/3) ... [2019-12-07 11:15:50,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1497d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:15:50, skipping insertion in model container [2019-12-07 11:15:50,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:15:50" (3/3) ... [2019-12-07 11:15:50,177 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-12-07 11:15:50,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:15:50,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-07 11:15:50,196 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-07 11:15:50,210 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:15:50,210 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:15:50,211 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:15:50,211 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:15:50,211 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:15:50,211 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:15:50,211 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:15:50,211 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:15:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-07 11:15:50,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 11:15:50,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:50,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:50,225 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:50,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash -238958999, now seen corresponding path program 1 times [2019-12-07 11:15:50,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:50,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521295248] [2019-12-07 11:15:50,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:50,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521295248] [2019-12-07 11:15:50,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:50,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:15:50,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710457102] [2019-12-07 11:15:50,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:50,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:50,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:50,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:50,366 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-07 11:15:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:50,388 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2019-12-07 11:15:50,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:50,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 11:15:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:50,396 INFO L225 Difference]: With dead ends: 47 [2019-12-07 11:15:50,396 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 11:15:50,398 INFO L630 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 [2019-12-07 11:15:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 11:15:50,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-12-07 11:15:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 11:15:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-12-07 11:15:50,421 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 8 [2019-12-07 11:15:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:50,421 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-12-07 11:15:50,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-12-07 11:15:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:15:50,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:50,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:50,422 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:50,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:50,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1055861953, now seen corresponding path program 1 times [2019-12-07 11:15:50,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:50,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942596682] [2019-12-07 11:15:50,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:50,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942596682] [2019-12-07 11:15:50,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:50,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:15:50,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334905881] [2019-12-07 11:15:50,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:50,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:50,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:50,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:50,445 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-12-07 11:15:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:50,472 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2019-12-07 11:15:50,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:50,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 11:15:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:50,473 INFO L225 Difference]: With dead ends: 55 [2019-12-07 11:15:50,473 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 11:15:50,474 INFO L630 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 [2019-12-07 11:15:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 11:15:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-12-07 11:15:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 11:15:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-12-07 11:15:50,479 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2019-12-07 11:15:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:50,479 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-12-07 11:15:50,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-12-07 11:15:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:15:50,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:50,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:50,480 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:50,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:50,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1125304774, now seen corresponding path program 1 times [2019-12-07 11:15:50,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:50,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503147265] [2019-12-07 11:15:50,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:50,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503147265] [2019-12-07 11:15:50,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:50,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:15:50,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730541158] [2019-12-07 11:15:50,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:15:50,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:50,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:15:50,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:15:50,510 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-12-07 11:15:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:50,537 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-12-07 11:15:50,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:15:50,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 11:15:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:50,538 INFO L225 Difference]: With dead ends: 48 [2019-12-07 11:15:50,538 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 11:15:50,538 INFO L630 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 [2019-12-07 11:15:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 11:15:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2019-12-07 11:15:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 11:15:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-12-07 11:15:50,543 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 9 [2019-12-07 11:15:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:50,543 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-12-07 11:15:50,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:15:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-12-07 11:15:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 11:15:50,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:50,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:50,544 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash -461793925, now seen corresponding path program 1 times [2019-12-07 11:15:50,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:50,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262395304] [2019-12-07 11:15:50,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:50,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:50,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262395304] [2019-12-07 11:15:50,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:50,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:15:50,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965458784] [2019-12-07 11:15:50,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:15:50,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:15:50,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:15:50,563 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2019-12-07 11:15:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:50,587 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-12-07 11:15:50,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:15:50,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 11:15:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:50,588 INFO L225 Difference]: With dead ends: 51 [2019-12-07 11:15:50,589 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 11:15:50,589 INFO L630 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 [2019-12-07 11:15:50,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 11:15:50,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-12-07 11:15:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 11:15:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-12-07 11:15:50,592 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 10 [2019-12-07 11:15:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:50,592 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-12-07 11:15:50,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:15:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-12-07 11:15:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:15:50,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:50,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:50,593 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:50,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:50,593 INFO L82 PathProgramCache]: Analyzing trace with hash 67089498, now seen corresponding path program 1 times [2019-12-07 11:15:50,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:50,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504306767] [2019-12-07 11:15:50,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:51,206 WARN L192 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 86 [2019-12-07 11:15:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:51,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504306767] [2019-12-07 11:15:51,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:51,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:15:51,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901873701] [2019-12-07 11:15:51,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:15:51,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:51,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:15:51,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:15:51,257 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 8 states. [2019-12-07 11:15:51,536 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 44 [2019-12-07 11:15:51,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:51,557 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2019-12-07 11:15:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:15:51,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 11:15:51,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:51,558 INFO L225 Difference]: With dead ends: 42 [2019-12-07 11:15:51,558 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 11:15:51,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:15:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 11:15:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-12-07 11:15:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 11:15:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-12-07 11:15:51,562 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 15 [2019-12-07 11:15:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:51,562 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-12-07 11:15:51,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:15:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-12-07 11:15:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:15:51,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:51,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:51,563 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:51,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1399323306, now seen corresponding path program 1 times [2019-12-07 11:15:51,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:51,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456419723] [2019-12-07 11:15:51,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:15:51,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456419723] [2019-12-07 11:15:51,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:15:51,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:15:51,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531980249] [2019-12-07 11:15:51,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:15:51,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:15:51,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:15:51,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:15:51,596 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2019-12-07 11:15:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:15:51,637 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-12-07 11:15:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:15:51,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-12-07 11:15:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:15:51,638 INFO L225 Difference]: With dead ends: 39 [2019-12-07 11:15:51,638 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 11:15:51,639 INFO L630 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 [2019-12-07 11:15:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 11:15:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 23. [2019-12-07 11:15:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 11:15:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-12-07 11:15:51,643 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 16 [2019-12-07 11:15:51,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:15:51,644 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-12-07 11:15:51,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:15:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-12-07 11:15:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:15:51,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:15:51,645 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:15:51,645 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:15:51,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:15:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1507348966, now seen corresponding path program 1 times [2019-12-07 11:15:51,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:15:51,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865758833] [2019-12-07 11:15:51,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:15:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:15:57,660 WARN L192 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-12-07 11:16:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:16:04,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865758833] [2019-12-07 11:16:04,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195165243] [2019-12-07 11:16:04,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:16:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:16:04,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:16:04,296 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:16:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:16:06,468 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:16:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:16:10,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2042953180] [2019-12-07 11:16:10,889 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2019-12-07 11:16:10,890 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:16:10,893 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:16:10,898 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:16:10,898 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:16:11,225 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:16:13,427 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-12-07 11:16:17,725 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-12-07 11:16:25,234 WARN L192 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-07 11:16:28,205 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:16:28,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:16:28,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2019-12-07 11:16:28,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318600526] [2019-12-07 11:16:28,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:16:28,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:16:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:16:28,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=513, Unknown=9, NotChecked=0, Total=650 [2019-12-07 11:16:28,207 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-12-07 11:16:36,090 WARN L192 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-12-07 11:16:46,222 WARN L192 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-12-07 11:16:57,160 WARN L192 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-12-07 11:17:13,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:17:13,746 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-12-07 11:17:13,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:17:13,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-07 11:17:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:17:13,747 INFO L225 Difference]: With dead ends: 27 [2019-12-07 11:17:13,747 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:17:13,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 72.5s TimeCoverageRelationStatistics Valid=165, Invalid=689, Unknown=16, NotChecked=0, Total=870 [2019-12-07 11:17:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:17:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:17:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:17:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:17:13,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-12-07 11:17:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:17:13,749 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:17:13,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:17:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:17:13,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:17:13,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:17:13,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:17:18,699 WARN L192 SmtUtils]: Spent 4.68 s on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 11:17:18,762 INFO L249 CegarLoopResult]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-12-07 11:17:18,762 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L242 CegarLoopResult]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 11:17:18,763 INFO L246 CegarLoopResult]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-12-07 11:17:18,764 INFO L242 CegarLoopResult]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-12-07 11:17:18,764 INFO L242 CegarLoopResult]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse12 (* 4294967296 .cse3)) (.cse2 (div ULTIMATE.start_main_~main__index2~0 4294967296))) (let ((.cse1 (* 4294967296 .cse2)) (.cse10 (+ ULTIMATE.start_main_~main__index2~0 .cse12)) (.cse4 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) (.cse11 (<= ULTIMATE.start_main_~main__index1~0 (+ .cse12 99999)))) (or (let ((.cse0 (div (+ ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296))) (and (<= ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 .cse0) 100000)) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse1 99999)) (<= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 4294967295)) (* ULTIMATE.start_main_~main__index1~0 4294967294) (* .cse2 (- 4294967296)) (* .cse3 4294967296) (* .cse0 4294967296) 429483844598116) 18446744073709551616)) 1)) .cse4 (or (let ((.cse9 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse7 (select .cse9 (+ (* ULTIMATE.start_main_~main__index2~0 4) (* .cse2 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|))) (.cse8 (select .cse9 (+ (* ULTIMATE.start_main_~main__index1~0 4) (* .cse3 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|)))) (let ((.cse6 (+ .cse7 (* 4294967296 (div .cse8 4294967296)))) (.cse5 (+ (* 4294967296 (div .cse7 4294967296)) .cse8))) (and (<= .cse5 .cse6) (<= .cse6 .cse5))))) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse1) .cse10)) .cse11)) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse1 1) .cse10) .cse4 .cse11))))) [2019-12-07 11:17:18,764 INFO L249 CegarLoopResult]: At program point L189(lines 9 191) the Hoare annotation is: true [2019-12-07 11:17:18,764 INFO L246 CegarLoopResult]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-12-07 11:17:18,764 INFO L246 CegarLoopResult]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-12-07 11:17:18,764 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-12-07 11:17:18,764 INFO L242 CegarLoopResult]: At program point L82(lines 57 83) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_main_~main__index2~0 4294967296))) (let ((.cse1 (* 4294967296 .cse3)) (.cse2 (div ULTIMATE.start_main_~main__index1~0 4294967296)) (.cse0 (div (+ ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296))) (and (<= ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 .cse0) 100000)) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse1 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 .cse2))) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse1 99999)) (<= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 4294967295)) (* ULTIMATE.start_main_~main__index1~0 4294967294) (* .cse3 (- 4294967296)) (* .cse2 4294967296) (* .cse0 4294967296) 429483844598116) 18446744073709551616)) 1)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))))) [2019-12-07 11:17:18,764 INFO L246 CegarLoopResult]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-12-07 11:17:18,765 INFO L242 CegarLoopResult]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (let ((.cse1 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (or (and (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1) .cse1) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)) .cse1 (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))))) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)))) [2019-12-07 11:17:18,765 INFO L246 CegarLoopResult]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-12-07 11:17:18,765 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:17:18,765 INFO L242 CegarLoopResult]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (= ULTIMATE.start_main_~main__loop_entered~0 0) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1))) [2019-12-07 11:17:18,765 INFO L246 CegarLoopResult]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-12-07 11:17:18,765 INFO L246 CegarLoopResult]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-12-07 11:17:18,765 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-12-07 11:17:18,765 INFO L242 CegarLoopResult]: At program point L167(lines 21 180) the Hoare annotation is: (let ((.cse0 (div (+ ULTIMATE.start_main_~main__index1~0 (- 1)) 4294967296))) (and (<= ULTIMATE.start_main_~main__index1~0 (+ (* 4294967296 .cse0) 100000)) (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= ULTIMATE.start_main_~main__index1~0 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 4294967296)) (* ULTIMATE.start_main_~main__index1~0 4294967295) (* .cse0 4294967296) 429483844598115) 18446744073709551616)) 1)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) [2019-12-07 11:17:18,765 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-12-07 11:17:18,766 INFO L246 CegarLoopResult]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-12-07 11:17:18,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,784 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,786 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:17:18 BoogieIcfgContainer [2019-12-07 11:17:18,790 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:17:18,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:17:18,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:17:18,790 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:17:18,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:15:50" (3/4) ... [2019-12-07 11:17:18,794 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:17:18,803 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-12-07 11:17:18,803 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 11:17:18,804 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 11:17:18,854 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4af95ce6-c1c3-4c69-b9c0-4b65464beae5/bin/utaipan/witness.graphml [2019-12-07 11:17:18,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:17:18,855 INFO L168 Benchmark]: Toolchain (without parser) took 89202.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.6 MB in the beginning and 916.1 MB in the end (delta: 28.5 MB). Peak memory consumption was 175.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:18,855 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:17:18,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:18,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.33 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:18,856 INFO L168 Benchmark]: Boogie Preprocessor took 17.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:17:18,856 INFO L168 Benchmark]: RCFGBuilder took 255.87 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:18,856 INFO L168 Benchmark]: TraceAbstraction took 88617.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 29.4 MB). Free memory was 1.1 GB in the beginning and 923.4 MB in the end (delta: 162.3 MB). Peak memory consumption was 191.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:18,856 INFO L168 Benchmark]: Witness Printer took 63.91 ms. Allocated memory is still 1.2 GB. Free memory was 923.4 MB in the beginning and 916.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:17:18,858 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.33 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.18 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 255.87 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88617.05 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 29.4 MB). Free memory was 1.1 GB in the beginning and 923.4 MB in the end (delta: 162.3 MB). Peak memory consumption was 191.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.91 ms. Allocated memory is still 1.2 GB. Free memory was 923.4 MB in the beginning and 916.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && ((main____CPAchecker_TMP_0 == 1 && 1 == __VERIFIER_assert__cond) || ((!(0 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(main____CPAchecker_TMP_0 == 0)))) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((main__index1 <= 4294967296 * ((main__index1 + -1) / 4294967296) + 100000 && !(0 == __VERIFIER_assert__cond)) && main__index1 <= main__index2 + 4294967296 * ((main__index2 * -4294967296 + main__index1 * 4294967295 + (main__index1 + -1) / 4294967296 * 4294967296 + 429483844598115) / 18446744073709551616) + 1) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2019-12-07 11:17:18,862 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,862 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,863 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,864 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 11:17:18,865 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((main__index1 <= 4294967296 * ((main__index1 + -1) / 4294967296) + 100000 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__index1 <= main__index2 + 4294967296 * ((main__index2 * -4294967295 + main__index1 * 4294967294 + main__index2 / 4294967296 * -4294967296 + main__index1 / 4294967296 * 4294967296 + (main__index1 + -1) / 4294967296 * 4294967296 + 429483844598116) / 18446744073709551616) + 1) && 1 == __VERIFIER_assert__cond) && ((4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] <= unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) <= 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296))) && main__index1 <= 4294967296 * (main__index1 / 4294967296) + 99999) || (((!(0 == __VERIFIER_assert__cond) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && 1 == __VERIFIER_assert__cond) && main__index1 <= 4294967296 * (main__index1 / 4294967296) + 99999) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((main__index1 <= 4294967296 * ((main__index1 + -1) / 4294967296) + 100000 && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__index1 <= main__index2 + 4294967296 * ((main__index2 * -4294967295 + main__index1 * 4294967294 + main__index2 / 4294967296 * -4294967296 + main__index1 / 4294967296 * 4294967296 + (main__index1 + -1) / 4294967296 * 4294967296 + 429483844598116) / 18446744073709551616) + 1) && 1 == __VERIFIER_assert__cond) && !(main____CPAchecker_TMP_0 == 0) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__loop_entered == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main____CPAchecker_TMP_0 == 1 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 4 error locations. Result: SAFE, OverallTime: 83.7s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 46.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, HoareTripleCheckerStatistics: 172 SDtfs, 201 SDslu, 195 SDs, 0 SdLazy, 172 SolverSat, 15 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 73.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 19 NumberOfFragments, 455 HoareAnnotationTreeSize, 9 FomulaSimplifications, 733 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 101 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 44786 SizeOfPredicates, 4 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...