java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:33:26,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:33:26,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:33:26,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:33:26,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:33:26,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:33:26,162 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:33:26,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:33:26,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:33:26,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:33:26,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:33:26,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:33:26,176 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:33:26,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:33:26,180 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:33:26,181 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:33:26,182 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:33:26,184 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:33:26,195 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:33:26,200 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:33:26,201 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:33:26,202 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:33:26,204 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:33:26,204 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:33:26,204 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:33:26,206 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:33:26,209 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:33:26,209 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:33:26,212 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:33:26,214 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:33:26,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:33:26,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:33:26,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:33:26,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:33:26,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:33:26,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:33:26,219 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 13:33:26,244 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:33:26,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:33:26,246 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:33:26,246 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:33:26,246 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:33:26,246 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:33:26,247 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:33:26,247 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:33:26,247 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:33:26,247 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:33:26,247 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:33:26,248 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:33:26,248 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:33:26,249 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:33:26,249 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:33:26,249 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:33:26,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:33:26,251 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:33:26,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:33:26,252 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:33:26,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:33:26,252 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:33:26,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:33:26,252 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:33:26,253 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:33:26,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:33:26,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:33:26,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:33:26,254 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:33:26,254 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:33:26,254 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:33:26,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:33:26,254 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:33:26,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:33:26,256 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:33:26,256 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:33:26,256 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:33:26,256 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:33:26,257 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:33:26,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:33:26,296 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:33:26,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:33:26,301 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:33:26,301 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:33:26,302 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl [2019-02-28 13:33:26,302 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl' [2019-02-28 13:33:26,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:33:26,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:33:26,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:33:26,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:33:26,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:33:26,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/1) ... [2019-02-28 13:33:26,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/1) ... [2019-02-28 13:33:26,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:33:26,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:33:26,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:33:26,393 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:33:26,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/1) ... [2019-02-28 13:33:26,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/1) ... [2019-02-28 13:33:26,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/1) ... [2019-02-28 13:33:26,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/1) ... [2019-02-28 13:33:26,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/1) ... [2019-02-28 13:33:26,415 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/1) ... [2019-02-28 13:33:26,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/1) ... [2019-02-28 13:33:26,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:33:26,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:33:26,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:33:26,418 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:33:26,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:33:26,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:33:26,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:33:26,710 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:33:26,710 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 13:33:26,711 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:33:26 BoogieIcfgContainer [2019-02-28 13:33:26,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:33:26,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:33:26,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:33:26,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:33:26,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:26" (1/2) ... [2019-02-28 13:33:26,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f98d37c and model type n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:33:26, skipping insertion in model container [2019-02-28 13:33:26,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:33:26" (2/2) ... [2019-02-28 13:33:26,719 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c11.i_3.bpl [2019-02-28 13:33:26,728 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:33:26,737 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:33:26,754 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:33:26,790 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:33:26,790 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:33:26,790 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:33:26,791 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:33:26,791 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:33:26,791 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:33:26,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:33:26,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:33:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 13:33:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:33:26,818 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:26,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:33:26,821 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-28 13:33:26,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:26,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:26,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:26,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:27,225 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {11#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:27,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2019-02-28 13:33:27,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-02-28 13:33:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:27,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:33:27,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:33:27,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:33:27,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:33:27,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:33:27,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:33:27,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:27,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:33:27,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:33:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:33:27,281 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 13:33:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:27,378 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-28 13:33:27,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:33:27,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:33:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:33:27,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:33:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-02-28 13:33:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:33:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-02-28 13:33:27,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-02-28 13:33:27,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:27,451 INFO L225 Difference]: With dead ends: 9 [2019-02-28 13:33:27,451 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 13:33:27,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:33:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 13:33:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 13:33:27,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:33:27,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:27,553 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:27,553 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:27,555 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:33:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:33:27,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:27,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:27,557 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:27,557 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:27,559 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:33:27,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:33:27,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:27,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:27,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:33:27,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:33:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:33:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 13:33:27,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 13:33:27,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:33:27,566 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 13:33:27,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:33:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:33:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:33:27,567 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:27,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:33:27,569 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:27,570 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-28 13:33:27,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:27,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:27,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:27,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:27,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:28,130 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:28,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2019-02-28 13:33:28,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 1))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-02-28 13:33:28,154 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-28 13:33:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:28,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:28,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:33:28,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:33:28,158 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-28 13:33:28,220 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:33:28,220 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:33:28,423 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-02-28 13:33:54,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:33:54,190 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 3 different actions 27 times. Widened at 2 different actions 12 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 13:33:54,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:54,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:33:54,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:54,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-02-28 13:33:54,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:54,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:33:54,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:54,227 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 13:33:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:54,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:33:54,289 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:54,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {55#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2019-02-28 13:33:54,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {55#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-02-28 13:33:54,311 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-28 13:33:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:54,312 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:33:54,373 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-28 13:33:54,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {65#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-02-28 13:33:54,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {69#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {65#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2019-02-28 13:33:54,376 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {69#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2019-02-28 13:33:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:54,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:33:54,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-02-28 13:33:54,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:33:54,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-28 13:33:54,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:33:54,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-02-28 13:33:54,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:54,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 13:33:54,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 13:33:54,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:33:54,430 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-02-28 13:33:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:54,497 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:33:54,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:33:54,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-02-28 13:33:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:33:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:33:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-02-28 13:33:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:33:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-02-28 13:33:54,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2019-02-28 13:33:54,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:54,515 INFO L225 Difference]: With dead ends: 8 [2019-02-28 13:33:54,515 INFO L226 Difference]: Without dead ends: 6 [2019-02-28 13:33:54,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:33:54,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-28 13:33:54,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-28 13:33:54,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:33:54,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-02-28 13:33:54,529 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-28 13:33:54,530 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-28 13:33:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:54,531 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-28 13:33:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 13:33:54,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:54,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:54,532 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-02-28 13:33:54,532 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-02-28 13:33:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:54,533 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-02-28 13:33:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 13:33:54,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:54,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:54,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:33:54,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:33:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:33:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-28 13:33:54,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-28 13:33:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:33:54,535 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-28 13:33:54,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 13:33:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 13:33:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 13:33:54,536 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:54,536 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 13:33:54,536 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:54,537 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-28 13:33:54,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:54,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:54,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:54,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:54,886 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-02-28 13:33:54,945 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:54,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2019-02-28 13:33:54,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {111#(and (<= ULTIMATE.start_main_~len~5 2) (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)))} is VALID [2019-02-28 13:33:54,948 INFO L273 TraceCheckUtils]: 3: Hoare triple {111#(and (<= ULTIMATE.start_main_~len~5 2) (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2019-02-28 13:33:54,948 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#false} assume !false; {108#false} is VALID [2019-02-28 13:33:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:54,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:54,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:33:54,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:33:54,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:33:54,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:54,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:33:54,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 13:33:54,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 13:33:54,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 13:33:54,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:33:54,972 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 13:33:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:54,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:33:55,034 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:55,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2019-02-28 13:33:55,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {121#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:55,037 INFO L273 TraceCheckUtils]: 3: Hoare triple {121#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2019-02-28 13:33:55,037 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#false} assume !false; {108#false} is VALID [2019-02-28 13:33:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:55,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:33:55,459 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#false} assume !false; {108#false} is VALID [2019-02-28 13:33:55,460 INFO L273 TraceCheckUtils]: 3: Hoare triple {131#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2019-02-28 13:33:55,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {135#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {131#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2019-02-28 13:33:55,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {139#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {135#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2019-02-28 13:33:55,472 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {139#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} is VALID [2019-02-28 13:33:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:55,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:33:55,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2019-02-28 13:33:55,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:33:55,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-28 13:33:55,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:33:55,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-28 13:33:55,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:55,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 13:33:55,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 13:33:55,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-02-28 13:33:55,503 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-02-28 13:33:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:55,572 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-28 13:33:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:33:55,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-28 13:33:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:33:55,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:33:55,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-02-28 13:33:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:33:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2019-02-28 13:33:55,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 9 transitions. [2019-02-28 13:33:55,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:55,584 INFO L225 Difference]: With dead ends: 9 [2019-02-28 13:33:55,584 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 13:33:55,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-02-28 13:33:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 13:33:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 13:33:55,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:33:55,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:55,597 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:55,597 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:55,598 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 13:33:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 13:33:55,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:55,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:55,599 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:55,599 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-28 13:33:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:55,600 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-02-28 13:33:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 13:33:55,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:55,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:55,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:33:55,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:33:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:33:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-28 13:33:55,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-28 13:33:55,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:33:55,602 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-28 13:33:55,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 13:33:55,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 13:33:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 13:33:55,603 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:55,603 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-28 13:33:55,604 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:55,604 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-28 13:33:55,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:55,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:33:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:55,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:55,729 INFO L273 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:55,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2019-02-28 13:33:55,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:55,733 INFO L273 TraceCheckUtils]: 3: Hoare triple {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {188#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 3))} is VALID [2019-02-28 13:33:55,735 INFO L273 TraceCheckUtils]: 4: Hoare triple {188#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 3))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {184#false} is VALID [2019-02-28 13:33:55,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#false} assume !false; {184#false} is VALID [2019-02-28 13:33:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:55,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:55,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:33:55,737 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:33:55,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:33:55,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:55,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:33:55,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 13:33:55,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 13:33:55,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 13:33:55,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 13:33:55,758 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 13:33:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:55,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:33:55,824 INFO L273 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:55,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2019-02-28 13:33:55,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:55,827 INFO L273 TraceCheckUtils]: 3: Hoare triple {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {201#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:55,829 INFO L273 TraceCheckUtils]: 4: Hoare triple {201#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {184#false} is VALID [2019-02-28 13:33:55,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#false} assume !false; {184#false} is VALID [2019-02-28 13:33:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:55,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:33:56,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#false} assume !false; {184#false} is VALID [2019-02-28 13:33:56,014 INFO L273 TraceCheckUtils]: 4: Hoare triple {211#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {184#false} is VALID [2019-02-28 13:33:56,030 INFO L273 TraceCheckUtils]: 3: Hoare triple {215#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {211#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2019-02-28 13:33:56,038 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {215#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2019-02-28 13:33:56,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {223#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {219#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} is VALID [2019-02-28 13:33:56,042 INFO L273 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {223#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} is VALID [2019-02-28 13:33:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:56,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:33:56,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2019-02-28 13:33:56,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:33:56,062 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-28 13:33:56,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:33:56,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-28 13:33:56,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:56,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 13:33:56,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 13:33:56,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-02-28 13:33:56,123 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-02-28 13:33:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:56,257 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-28 13:33:56,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 13:33:56,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-28 13:33:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:33:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:33:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-02-28 13:33:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 13:33:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-02-28 13:33:56,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2019-02-28 13:33:56,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:56,270 INFO L225 Difference]: With dead ends: 10 [2019-02-28 13:33:56,270 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 13:33:56,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-02-28 13:33:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 13:33:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 13:33:56,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:33:56,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-02-28 13:33:56,277 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-28 13:33:56,278 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-28 13:33:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:56,279 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:33:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:33:56,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:56,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:56,280 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-02-28 13:33:56,280 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-02-28 13:33:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:56,281 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 13:33:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:33:56,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:56,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:56,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:33:56,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:33:56,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:33:56,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 13:33:56,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-28 13:33:56,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:33:56,283 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 13:33:56,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 13:33:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 13:33:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 13:33:56,284 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:56,284 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-28 13:33:56,284 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:56,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:56,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-28 13:33:56,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:56,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:56,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 13:33:56,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:56,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:56,522 INFO L273 TraceCheckUtils]: 0: Hoare triple {273#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:56,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2019-02-28 13:33:56,525 INFO L273 TraceCheckUtils]: 2: Hoare triple {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:56,526 INFO L273 TraceCheckUtils]: 3: Hoare triple {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:56,532 INFO L273 TraceCheckUtils]: 4: Hoare triple {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {279#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 4))} is VALID [2019-02-28 13:33:56,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 4))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {274#false} is VALID [2019-02-28 13:33:56,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#false} assume !false; {274#false} is VALID [2019-02-28 13:33:56,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:56,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:56,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:33:56,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 13:33:56,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 13:33:56,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:56,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:33:56,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:56,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:33:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:56,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 13:33:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:56,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:33:56,721 INFO L273 TraceCheckUtils]: 0: Hoare triple {273#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:56,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2019-02-28 13:33:56,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:56,724 INFO L273 TraceCheckUtils]: 3: Hoare triple {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} is VALID [2019-02-28 13:33:56,725 INFO L273 TraceCheckUtils]: 4: Hoare triple {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {295#(and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))} is VALID [2019-02-28 13:33:56,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {295#(and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {274#false} is VALID [2019-02-28 13:33:56,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#false} assume !false; {274#false} is VALID [2019-02-28 13:33:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:56,727 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:33:56,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#false} assume !false; {274#false} is VALID [2019-02-28 13:33:56,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {305#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {274#false} is VALID [2019-02-28 13:33:56,807 INFO L273 TraceCheckUtils]: 4: Hoare triple {309#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {305#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2019-02-28 13:33:56,808 INFO L273 TraceCheckUtils]: 3: Hoare triple {313#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {309#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2019-02-28 13:33:56,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {313#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} is VALID [2019-02-28 13:33:56,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {321#(< (mod (+ ULTIMATE.start_main_~len~5 4) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {317#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} is VALID [2019-02-28 13:33:56,810 INFO L273 TraceCheckUtils]: 0: Hoare triple {273#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {321#(< (mod (+ ULTIMATE.start_main_~len~5 4) 4294967296) 5)} is VALID [2019-02-28 13:33:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:56,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:33:56,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2019-02-28 13:33:56,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:33:56,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-28 13:33:56,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:33:56,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-28 13:33:56,841 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:56,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 13:33:56,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 13:33:56,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-28 13:33:56,842 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-02-28 13:33:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:56,940 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-28 13:33:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 13:33:56,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-28 13:33:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:33:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:33:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-02-28 13:33:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:33:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-02-28 13:33:56,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2019-02-28 13:33:56,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:56,960 INFO L225 Difference]: With dead ends: 9 [2019-02-28 13:33:56,960 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 13:33:56,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-28 13:33:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 13:33:56,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 13:33:56,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:33:56,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-28 13:33:56,962 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:33:56,962 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:33:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:56,962 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:33:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:33:56,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:56,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:56,963 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:33:56,963 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:33:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:56,963 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:33:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:33:56,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:56,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:56,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:33:56,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:33:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 13:33:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 13:33:56,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-02-28 13:33:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:33:56,964 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 13:33:56,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 13:33:56,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:33:56,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:56,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 13:33:57,050 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2019-02-28 13:33:57,051 INFO L444 ceAbstractionStarter]: At program point L31(lines 31 41) the Hoare annotation is: false [2019-02-28 13:33:57,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2019-02-28 13:33:57,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2019-02-28 13:33:57,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-02-28 13:33:57,051 INFO L444 ceAbstractionStarter]: At program point L40(lines 17 40) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5)) (and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1)) (and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5)) (and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5)) (and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))) [2019-02-28 13:33:57,052 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-28 13:33:57,055 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-28 13:33:57,055 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-28 13:33:57,055 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-28 13:33:57,055 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-28 13:33:57,061 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 01:33:57 BoogieIcfgContainer [2019-02-28 13:33:57,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 13:33:57,062 INFO L168 Benchmark]: Toolchain (without parser) took 30711.03 ms. Allocated memory was 142.1 MB in the beginning and 453.5 MB in the end (delta: 311.4 MB). Free memory was 109.6 MB in the beginning and 143.9 MB in the end (delta: -34.4 MB). Peak memory consumption was 277.1 MB. Max. memory is 7.1 GB. [2019-02-28 13:33:57,063 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 142.1 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 13:33:57,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.63 ms. Allocated memory is still 142.1 MB. Free memory was 109.4 MB in the beginning and 107.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-28 13:33:57,065 INFO L168 Benchmark]: Boogie Preprocessor took 24.66 ms. Allocated memory is still 142.1 MB. Free memory was 107.8 MB in the beginning and 106.8 MB in the end (delta: 966.6 kB). Peak memory consumption was 966.6 kB. Max. memory is 7.1 GB. [2019-02-28 13:33:57,065 INFO L168 Benchmark]: RCFGBuilder took 293.44 ms. Allocated memory is still 142.1 MB. Free memory was 106.6 MB in the beginning and 97.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-02-28 13:33:57,066 INFO L168 Benchmark]: TraceAbstraction took 30348.98 ms. Allocated memory was 142.1 MB in the beginning and 453.5 MB in the end (delta: 311.4 MB). Free memory was 96.9 MB in the beginning and 143.9 MB in the end (delta: -47.1 MB). Peak memory consumption was 264.4 MB. Max. memory is 7.1 GB. [2019-02-28 13:33:57,070 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 142.1 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.63 ms. Allocated memory is still 142.1 MB. Free memory was 109.4 MB in the beginning and 107.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.66 ms. Allocated memory is still 142.1 MB. Free memory was 107.8 MB in the beginning and 106.8 MB in the end (delta: 966.6 kB). Peak memory consumption was 966.6 kB. Max. memory is 7.1 GB. * RCFGBuilder took 293.44 ms. Allocated memory is still 142.1 MB. Free memory was 106.6 MB in the beginning and 97.1 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30348.98 ms. Allocated memory was 142.1 MB in the beginning and 453.5 MB in the end (delta: 311.4 MB). Free memory was 96.9 MB in the beginning and 143.9 MB in the end (delta: -47.1 MB). Peak memory consumption was 264.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((main_~len~5 <= 0 && 0 <= main_~len~5) || (1 <= main_~len~5 && main_~len~5 <= 1)) || (main_~len~5 <= 2 && 2 <= main_~len~5)) || (main_~len~5 <= 3 && 3 <= main_~len~5)) || (4 <= main_~len~5 && main_~len~5 <= 4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 30.2s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 0 SDslu, 11 SDs, 0 SdLazy, 76 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 26.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 37 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 12 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 0/60 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...