java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:48:48,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:48:48,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:48:48,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:48:48,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:48:48,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:48:48,143 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:48:48,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:48:48,149 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:48:48,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:48:48,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:48:48,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:48:48,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:48:48,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:48:48,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:48:48,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:48:48,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:48:48,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:48:48,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:48:48,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:48:48,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:48:48,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:48:48,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:48:48,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:48:48,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:48:48,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:48:48,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:48:48,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:48:48,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:48:48,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:48:48,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:48:48,185 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:48:48,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:48:48,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:48:48,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:48:48,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:48:48,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:48:48,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:48:48,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:48:48,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:48:48,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:48:48,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:48:48,207 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:48:48,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:48:48,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:48:48,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:48:48,209 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:48:48,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:48:48,209 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:48:48,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:48:48,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:48:48,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:48:48,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:48:48,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:48:48,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:48:48,211 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:48:48,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:48:48,211 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:48:48,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:48:48,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:48:48,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:48:48,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:48:48,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:48:48,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:48:48,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:48:48,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:48:48,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:48:48,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:48:48,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:48:48,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:48:48,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:48:48,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:48:48,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:48:48,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:48:48,276 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:48:48,277 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:48:48,277 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2019-09-03 19:48:48,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79cbe265/505f51b82cb243cc9f1e5120fba31b83/FLAGa98665d01 [2019-09-03 19:48:48,777 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:48:48,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2019-09-03 19:48:48,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79cbe265/505f51b82cb243cc9f1e5120fba31b83/FLAGa98665d01 [2019-09-03 19:48:49,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e79cbe265/505f51b82cb243cc9f1e5120fba31b83 [2019-09-03 19:48:49,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:48:49,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:48:49,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:48:49,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:48:49,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:48:49,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:48:49" (1/1) ... [2019-09-03 19:48:49,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad31ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49, skipping insertion in model container [2019-09-03 19:48:49,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:48:49" (1/1) ... [2019-09-03 19:48:49,194 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:48:49,211 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:48:49,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:48:49,409 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:48:49,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:48:49,446 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:48:49,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49 WrapperNode [2019-09-03 19:48:49,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:48:49,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:48:49,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:48:49,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:48:49,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49" (1/1) ... [2019-09-03 19:48:49,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49" (1/1) ... [2019-09-03 19:48:49,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49" (1/1) ... [2019-09-03 19:48:49,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49" (1/1) ... [2019-09-03 19:48:49,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49" (1/1) ... [2019-09-03 19:48:49,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49" (1/1) ... [2019-09-03 19:48:49,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49" (1/1) ... [2019-09-03 19:48:49,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:48:49,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:48:49,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:48:49,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:48:49,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-03 19:48:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:48:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:48:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:48:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:48:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:48:49,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:48:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:48:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-03 19:48:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:48:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-03 19:48:49,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-03 19:48:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-03 19:48:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:48:49,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:48:49,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-03 19:48:49,847 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:48:49,848 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:48:49,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:48:49 BoogieIcfgContainer [2019-09-03 19:48:49,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:48:49,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:48:49,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:48:49,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:48:49,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:48:49" (1/3) ... [2019-09-03 19:48:49,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224608a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:48:49, skipping insertion in model container [2019-09-03 19:48:49,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:48:49" (2/3) ... [2019-09-03 19:48:49,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224608a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:48:49, skipping insertion in model container [2019-09-03 19:48:49,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:48:49" (3/3) ... [2019-09-03 19:48:49,876 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i [2019-09-03 19:48:49,900 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:48:49,916 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:48:49,947 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:48:49,970 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:48:49,970 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:48:49,971 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:48:49,971 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:48:49,971 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:48:49,971 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:48:49,971 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:48:49,971 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:48:49,971 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:48:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-03 19:48:49,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 19:48:49,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:49,990 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:49,992 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:49,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1079158542, now seen corresponding path program 1 times [2019-09-03 19:48:49,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:49,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:48:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:48:50,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:48:50,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:48:50,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:48:50,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:48:50,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:48:50,237 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2019-09-03 19:48:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:50,373 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2019-09-03 19:48:50,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:48:50,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-03 19:48:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:50,386 INFO L225 Difference]: With dead ends: 56 [2019-09-03 19:48:50,386 INFO L226 Difference]: Without dead ends: 30 [2019-09-03 19:48:50,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:48:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-03 19:48:50,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-09-03 19:48:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:48:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-03 19:48:50,446 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2019-09-03 19:48:50,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:50,447 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-03 19:48:50,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:48:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-03 19:48:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:48:50,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:50,450 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:50,451 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:50,453 INFO L82 PathProgramCache]: Analyzing trace with hash -476045897, now seen corresponding path program 1 times [2019-09-03 19:48:50,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:50,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:50,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:48:50,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:50,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:48:50,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:48:50,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:48:50,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:48:50,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:48:50,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:48:50,544 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2019-09-03 19:48:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:50,559 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2019-09-03 19:48:50,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:48:50,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-03 19:48:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:50,562 INFO L225 Difference]: With dead ends: 36 [2019-09-03 19:48:50,562 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 19:48:50,564 INFO L628 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-09-03 19:48:50,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 19:48:50,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-03 19:48:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 19:48:50,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-09-03 19:48:50,576 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2019-09-03 19:48:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:50,576 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-09-03 19:48:50,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:48:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-09-03 19:48:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:48:50,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:50,578 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:50,578 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:50,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1393486425, now seen corresponding path program 1 times [2019-09-03 19:48:50,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:50,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:50,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:48:50,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:48:50,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:48:50,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-03 19:48:50,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:48:50,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:48:50,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:48:50,828 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 9 states. [2019-09-03 19:48:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:48:51,021 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-09-03 19:48:51,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:48:51,021 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-09-03 19:48:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:48:51,023 INFO L225 Difference]: With dead ends: 38 [2019-09-03 19:48:51,023 INFO L226 Difference]: Without dead ends: 36 [2019-09-03 19:48:51,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:48:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-03 19:48:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2019-09-03 19:48:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-03 19:48:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-09-03 19:48:51,031 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2019-09-03 19:48:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:48:51,031 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-09-03 19:48:51,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:48:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-09-03 19:48:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:48:51,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:48:51,033 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:48:51,033 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:48:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:48:51,034 INFO L82 PathProgramCache]: Analyzing trace with hash 618852702, now seen corresponding path program 1 times [2019-09-03 19:48:51,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:48:51,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:48:51,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:51,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:48:51,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:48:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:51,688 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 48 [2019-09-03 19:48:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:48:51,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:48:51,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-09-03 19:48:51,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:48:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:48:51,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:48:51,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:49:34,680 WARN L188 SmtUtils]: Spent 42.28 s on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-09-03 19:49:43,100 WARN L188 SmtUtils]: Spent 5.96 s on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2019-09-03 19:49:43,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:43,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:43,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:43,209 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:49:43,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:43,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:49:43,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-03 19:49:43,234 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:43,417 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:45,496 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (= (select .cse0 (+ (* 4 (mod main_~index2~0 4294967296)) |main_~#array~0.offset|)) (select .cse0 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)))) [2019-09-03 19:49:45,964 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:45,968 INFO L235 Elim1Store]: Index analysis took 2750 ms [2019-09-03 19:49:45,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 69 [2019-09-03 19:49:45,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:48,089 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:48,127 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:48,144 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:48,146 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:48,147 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:48,149 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-03 19:49:48,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 63 [2019-09-03 19:49:48,152 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:48,507 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-03 19:49:48,508 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-03 19:49:50,090 WARN L188 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-09-03 19:49:50,092 INFO L567 ElimStorePlain]: treesize reduction 78, result has 37.1 percent of original size [2019-09-03 19:49:50,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-03 19:49:50,099 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:461, output treesize:7 [2019-09-03 19:49:50,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:49:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:49:50,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:49:50,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 12 [2019-09-03 19:49:50,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 19:49:50,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 19:49:50,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:49:50,191 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2019-09-03 19:49:51,930 WARN L188 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-09-03 19:49:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:49:54,665 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-03 19:49:54,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 19:49:54,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-09-03 19:49:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:49:54,667 INFO L225 Difference]: With dead ends: 34 [2019-09-03 19:49:54,668 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:49:54,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 53.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:49:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:49:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:49:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:49:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:49:54,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-09-03 19:49:54,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:49:54,671 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:49:54,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 19:49:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:49:54,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:49:54,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:49:57,147 WARN L188 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-09-03 19:50:03,518 WARN L188 SmtUtils]: Spent 6.37 s on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-03 19:50:03,614 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:50:03,615 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:50:03,615 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:50:03,615 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:50:03,615 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:50:03,615 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:50:03,615 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:50:03,615 INFO L439 ceAbstractionStarter]: At program point L31-2(lines 31 37) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (or (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ .cse0 99999)) (= 0 main_~loop_entered~0)) (let ((.cse1 (+ main_~index2~0 1))) (and (<= (+ (* 4294967296 (div .cse1 4294967296)) main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (let ((.cse2 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse2 (+ (* 4 (mod .cse1 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select .cse2 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296))) (<= main_~index2~0 (+ .cse0 99998)))))) [2019-09-03 19:50:03,615 INFO L443 ceAbstractionStarter]: For program point L31-3(lines 20 47) no Hoare annotation was computed. [2019-09-03 19:50:03,616 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2019-09-03 19:50:03,616 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 19 47) no Hoare annotation was computed. [2019-09-03 19:50:03,616 INFO L439 ceAbstractionStarter]: At program point L40-2(lines 40 44) the Hoare annotation is: (or (let ((.cse2 (+ main_~index2~0 1))) (let ((.cse0 (* 4294967296 (div .cse2 4294967296)))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (<= main_~index2~0 (+ .cse0 99998)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* 4 (mod .cse2 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296)))))) (let ((.cse3 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse3 99999)) (<= (+ .cse3 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296))))))) [2019-09-03 19:50:03,616 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (let ((.cse1 (<= (+ .cse0 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))) (or (and (<= main_~index2~0 (+ .cse0 99998)) .cse1) (and (<= main_~index2~0 (+ .cse0 99999)) .cse1 (= 0 main_~loop_entered~0))))) [2019-09-03 19:50:03,616 INFO L443 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2019-09-03 19:50:03,616 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: true [2019-09-03 19:50:03,616 INFO L439 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (let ((.cse4 (+ main_~index2~0 1))) (let ((.cse0 (* 4294967296 (div .cse4 4294967296))) (.cse2 (* 4294967296 (div |main_#t~mem7| 4294967296))) (.cse1 (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|))) (and (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) main_~index2~0 1)) (< .cse1 (+ .cse2 |main_#t~mem8| 1)) (<= main_~index2~0 (+ .cse0 99998)) (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse3 (+ (* 4 (mod .cse4 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select .cse3 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296))) (<= (mod main_~index2~0 4294967296) (mod main_~index1~0 4294967296)) (<= (+ .cse2 |main_#t~mem8|) .cse1)))) [2019-09-03 19:50:03,617 INFO L443 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2019-09-03 19:50:03,617 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2019-09-03 19:50:03,617 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2019-09-03 19:50:03,617 INFO L443 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2019-09-03 19:50:03,617 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2019-09-03 19:50:03,617 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2019-09-03 19:50:03,617 INFO L443 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2019-09-03 19:50:03,618 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2019-09-03 19:50:03,626 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,627 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,632 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,632 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,635 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:50:03 BoogieIcfgContainer [2019-09-03 19:50:03,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:50:03,639 INFO L168 Benchmark]: Toolchain (without parser) took 74460.01 ms. Allocated memory was 140.0 MB in the beginning and 260.6 MB in the end (delta: 120.6 MB). Free memory was 87.7 MB in the beginning and 211.9 MB in the end (delta: -124.2 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:03,640 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:50:03,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.74 ms. Allocated memory is still 140.0 MB. Free memory was 87.5 MB in the beginning and 77.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:03,642 INFO L168 Benchmark]: Boogie Preprocessor took 117.92 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 77.3 MB in the beginning and 176.1 MB in the end (delta: -98.8 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:03,643 INFO L168 Benchmark]: RCFGBuilder took 289.29 ms. Allocated memory is still 199.2 MB. Free memory was 176.1 MB in the beginning and 161.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:03,644 INFO L168 Benchmark]: TraceAbstraction took 73777.54 ms. Allocated memory was 199.2 MB in the beginning and 260.6 MB in the end (delta: 61.3 MB). Free memory was 161.0 MB in the beginning and 211.9 MB in the end (delta: -50.9 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:03,648 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.44 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 267.74 ms. Allocated memory is still 140.0 MB. Free memory was 87.5 MB in the beginning and 77.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.92 ms. Allocated memory was 140.0 MB in the beginning and 199.2 MB in the end (delta: 59.2 MB). Free memory was 77.3 MB in the beginning and 176.1 MB in the end (delta: -98.8 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 289.29 ms. Allocated memory is still 199.2 MB. Free memory was 176.1 MB in the beginning and 161.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73777.54 ms. Allocated memory was 199.2 MB in the beginning and 260.6 MB in the end (delta: 61.3 MB). Free memory was 161.0 MB in the beginning and 211.9 MB in the end (delta: -50.9 MB). Peak memory consumption was 116.9 MB. Max. memory is 7.1 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant [2019-09-03 19:50:03,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,660 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,661 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,661 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && index2 <= 4294967296 * ((index2 + 1) / 4294967296) + 99998) && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) || (index2 <= 4294967296 * (index2 / 4294967296) + 99999 && 4294967296 * (index2 / 4294967296) + index1 + 1 <= index2 + 4294967296 * (index1 / 4294967296)) - InvariantResult [Line: 31]: Loop Invariant [2019-09-03 19:50:03,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,662 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-03 19:50:03,663 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((index1 <= 4294967296 * (index1 / 4294967296) + 99999 && index2 <= 4294967296 * (index2 / 4294967296) + 99999) && 0 == loop_entered) || ((4294967296 * ((index2 + 1) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2 + 1 && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) && index2 <= 4294967296 * (index2 / 4294967296) + 99998) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 73.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 8.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 69 SDtfs, 39 SDslu, 213 SDs, 0 SdLazy, 180 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 53.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 336 HoareAnnotationTreeSize, 15 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 214 FormulaSimplificationTreeSizeReductionInter, 8.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 59.2s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 21498 SizeOfPredicates, 7 NumberOfNonLiveVariables, 74 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 9/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...