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_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c30ebe1 [2018-12-17 14:12:38,815 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-17 14:12:38,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-17 14:12:38,829 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-17 14:12:38,830 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-17 14:12:38,831 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-17 14:12:38,832 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-17 14:12:38,834 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-17 14:12:38,836 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-17 14:12:38,837 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-17 14:12:38,838 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-17 14:12:38,838 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-17 14:12:38,839 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-17 14:12:38,840 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-17 14:12:38,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-17 14:12:38,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-17 14:12:38,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-17 14:12:38,845 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-17 14:12:38,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-17 14:12:38,849 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-17 14:12:38,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-17 14:12:38,851 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-17 14:12:38,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-17 14:12:38,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-17 14:12:38,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-17 14:12:38,856 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-17 14:12:38,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-17 14:12:38,858 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-17 14:12:38,858 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-17 14:12:38,860 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-17 14:12:38,860 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-17 14:12:38,861 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-17 14:12:38,861 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-17 14:12:38,862 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-17 14:12:38,863 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-17 14:12:38,863 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-17 14:12:38,864 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-17 14:12:38,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-17 14:12:38,877 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-17 14:12:38,878 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-17 14:12:38,879 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-17 14:12:38,879 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-17 14:12:38,879 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-17 14:12:38,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-17 14:12:38,880 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-17 14:12:38,880 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-17 14:12:38,880 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-17 14:12:38,880 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-17 14:12:38,881 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-17 14:12:38,881 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-17 14:12:38,882 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-17 14:12:38,882 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-17 14:12:38,882 INFO L133 SettingsManager]: * Use SBE=true [2018-12-17 14:12:38,882 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-17 14:12:38,882 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-17 14:12:38,883 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-17 14:12:38,883 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-17 14:12:38,883 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-17 14:12:38,883 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-17 14:12:38,883 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-17 14:12:38,884 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-17 14:12:38,884 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-17 14:12:38,884 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-17 14:12:38,884 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-17 14:12:38,884 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-17 14:12:38,885 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-17 14:12:38,885 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-17 14:12:38,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-17 14:12:38,885 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-17 14:12:38,886 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-17 14:12:38,886 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-17 14:12:38,886 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-17 14:12:38,886 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-17 14:12:38,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-17 14:12:38,887 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-17 14:12:38,887 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-17 14:12:38,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-17 14:12:38,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-17 14:12:38,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-17 14:12:38,941 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-17 14:12:38,942 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-17 14:12:38,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2018-12-17 14:12:38,943 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2018-12-17 14:12:38,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-17 14:12:38,992 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-17 14:12:38,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:38,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-17 14:12:38,994 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-17 14:12:39,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... [2018-12-17 14:12:39,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... [2018-12-17 14:12:39,032 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-17 14:12:39,033 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-17 14:12:39,033 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-17 14:12:39,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-17 14:12:39,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-17 14:12:39,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-17 14:12:39,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-17 14:12:39,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... [2018-12-17 14:12:39,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... [2018-12-17 14:12:39,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... [2018-12-17 14:12:39,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... [2018-12-17 14:12:39,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... [2018-12-17 14:12:39,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... [2018-12-17 14:12:39,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... [2018-12-17 14:12:39,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-17 14:12:39,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-17 14:12:39,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-17 14:12:39,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-17 14:12:39,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-17 14:12:39,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-17 14:12:39,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-17 14:12:39,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-17 14:12:39,143 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-12-17 14:12:39,725 INFO L272 CfgBuilder]: Using library mode [2018-12-17 14:12:39,726 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-17 14:12:39,726 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:39 BoogieIcfgContainer [2018-12-17 14:12:39,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-17 14:12:39,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-17 14:12:39,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-17 14:12:39,732 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-17 14:12:39,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:12:38" (1/2) ... [2018-12-17 14:12:39,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ea19ee and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:12:39, skipping insertion in model container [2018-12-17 14:12:39,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:12:39" (2/2) ... [2018-12-17 14:12:39,736 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2018-12-17 14:12:39,747 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-17 14:12:39,756 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-17 14:12:39,777 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-17 14:12:39,813 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-17 14:12:39,814 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-17 14:12:39,814 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-17 14:12:39,814 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-17 14:12:39,814 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-17 14:12:39,814 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-17 14:12:39,814 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-17 14:12:39,815 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-17 14:12:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2018-12-17 14:12:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-17 14:12:39,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:39,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-17 14:12:39,842 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-17 14:12:39,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:39,849 INFO L82 PathProgramCache]: Analyzing trace with hash 927591, now seen corresponding path program 1 times [2018-12-17 14:12:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:39,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:39,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:39,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:40,174 INFO L273 TraceCheckUtils]: 0: Hoare triple {14#true} call #t~malloc0.base, #t~malloc0.offset := ~malloc(400);~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; {16#(select |#valid| main_~q~1.base)} is VALID [2018-12-17 14:12:40,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {16#(select |#valid| main_~q~1.base)} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {16#(select |#valid| main_~q~1.base)} is VALID [2018-12-17 14:12:40,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {16#(select |#valid| main_~q~1.base)} assume #t~short2; {16#(select |#valid| main_~q~1.base)} is VALID [2018-12-17 14:12:40,186 INFO L273 TraceCheckUtils]: 3: Hoare triple {16#(select |#valid| main_~q~1.base)} assume !#valid[~q~1.base]; {15#false} is VALID [2018-12-17 14:12:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:12:40,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:12:40,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-17 14:12:40,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:40,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-17 14:12:40,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:40,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-17 14:12:40,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:40,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-17 14:12:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-17 14:12:40,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:40,241 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-12-17 14:12:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:40,343 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-12-17 14:12:40,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:12:40,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-17 14:12:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:12:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:40,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-17 14:12:40,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-17 14:12:40,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2018-12-17 14:12:40,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:40,462 INFO L225 Difference]: With dead ends: 14 [2018-12-17 14:12:40,462 INFO L226 Difference]: Without dead ends: 7 [2018-12-17 14:12:40,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-17 14:12:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-17 14:12:40,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:12:40,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:40,511 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:40,511 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:40,513 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2018-12-17 14:12:40,514 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-17 14:12:40,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:40,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:40,515 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:40,515 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-17 14:12:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:40,517 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2018-12-17 14:12:40,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-17 14:12:40,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:40,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:40,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:12:40,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:12:40,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-17 14:12:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-17 14:12:40,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-17 14:12:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:12:40,522 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-17 14:12:40,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-17 14:12:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-17 14:12:40,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-17 14:12:40,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:40,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-17 14:12:40,524 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-17 14:12:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash 927592, now seen corresponding path program 1 times [2018-12-17 14:12:40,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:40,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:40,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:40,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:40,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:40,882 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-12-17 14:12:40,908 INFO L273 TraceCheckUtils]: 0: Hoare triple {56#true} call #t~malloc0.base, #t~malloc0.offset := ~malloc(400);~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; {58#(and (= main_~q~1.offset 0) (= (select |#length| main_~q~1.base) 400))} is VALID [2018-12-17 14:12:40,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#(and (= main_~q~1.offset 0) (= (select |#length| main_~q~1.base) 400))} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {58#(and (= main_~q~1.offset 0) (= (select |#length| main_~q~1.base) 400))} is VALID [2018-12-17 14:12:40,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {58#(and (= main_~q~1.offset 0) (= (select |#length| main_~q~1.base) 400))} assume #t~short2; {58#(and (= main_~q~1.offset 0) (= (select |#length| main_~q~1.base) 400))} is VALID [2018-12-17 14:12:40,935 INFO L273 TraceCheckUtils]: 3: Hoare triple {58#(and (= main_~q~1.offset 0) (= (select |#length| main_~q~1.base) 400))} assume !(4 + ~q~1.offset <= #length[~q~1.base]); {57#false} is VALID [2018-12-17 14:12:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:12:40,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:12:40,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-17 14:12:40,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:40,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-17 14:12:40,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:40,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-17 14:12:40,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:40,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-17 14:12:40,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-17 14:12:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:40,988 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2018-12-17 14:12:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:41,040 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-17 14:12:41,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:12:41,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-17 14:12:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:12:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-17 14:12:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-17 14:12:41,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2018-12-17 14:12:41,100 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:41,101 INFO L225 Difference]: With dead ends: 13 [2018-12-17 14:12:41,101 INFO L226 Difference]: Without dead ends: 12 [2018-12-17 14:12:41,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-17 14:12:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-12-17 14:12:41,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:12:41,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 10 states. [2018-12-17 14:12:41,115 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 10 states. [2018-12-17 14:12:41,115 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 10 states. [2018-12-17 14:12:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:41,118 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-17 14:12:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-17 14:12:41,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:41,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:41,119 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 12 states. [2018-12-17 14:12:41,119 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 12 states. [2018-12-17 14:12:41,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:41,121 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-17 14:12:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-17 14:12:41,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:41,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:41,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:12:41,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:12:41,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-17 14:12:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-17 14:12:41,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 4 [2018-12-17 14:12:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:12:41,125 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-17 14:12:41,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-17 14:12:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-17 14:12:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-17 14:12:41,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:41,126 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-17 14:12:41,126 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-17 14:12:41,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1869902812, now seen corresponding path program 1 times [2018-12-17 14:12:41,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:41,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:41,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:41,193 INFO L273 TraceCheckUtils]: 0: Hoare triple {112#true} call #t~malloc0.base, #t~malloc0.offset := ~malloc(400);~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; {112#true} is VALID [2018-12-17 14:12:41,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {112#true} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {112#true} is VALID [2018-12-17 14:12:41,194 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#true} assume !#t~short2; {114#(not |main_#t~short2|)} is VALID [2018-12-17 14:12:41,196 INFO L273 TraceCheckUtils]: 3: Hoare triple {114#(not |main_#t~short2|)} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;#t~post3.base, #t~post3.offset := ~q~1.base, ~q~1.offset;~q~1.base, ~q~1.offset := #t~post3.base, #t~post3.offset + 4;havoc #t~post3.base, #t~post3.offset; {113#false} is VALID [2018-12-17 14:12:41,196 INFO L273 TraceCheckUtils]: 4: Hoare triple {113#false} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {113#false} is VALID [2018-12-17 14:12:41,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {113#false} assume #t~short2; {113#false} is VALID [2018-12-17 14:12:41,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {113#false} assume !(4 + ~q~1.offset <= #length[~q~1.base]); {113#false} is VALID [2018-12-17 14:12:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:12:41,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-17 14:12:41,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-17 14:12:41,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-17 14:12:41,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-17 14:12:41,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-17 14:12:41,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-17 14:12:41,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:41,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-17 14:12:41,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-17 14:12:41,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:41,214 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 3 states. [2018-12-17 14:12:41,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:41,342 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-17 14:12:41,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-17 14:12:41,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-17 14:12:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-17 14:12:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-17 14:12:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-17 14:12:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-17 14:12:41,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2018-12-17 14:12:41,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-17 14:12:41,387 INFO L225 Difference]: With dead ends: 17 [2018-12-17 14:12:41,387 INFO L226 Difference]: Without dead ends: 10 [2018-12-17 14:12:41,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-17 14:12:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-17 14:12:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-17 14:12:41,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-17 14:12:41,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2018-12-17 14:12:41,398 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2018-12-17 14:12:41,398 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2018-12-17 14:12:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:41,400 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-17 14:12:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-17 14:12:41,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:41,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:41,401 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2018-12-17 14:12:41,401 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2018-12-17 14:12:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-17 14:12:41,403 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-17 14:12:41,403 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-17 14:12:41,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-17 14:12:41,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-17 14:12:41,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-17 14:12:41,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-17 14:12:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-17 14:12:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-17 14:12:41,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-17 14:12:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-17 14:12:41,406 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-17 14:12:41,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-17 14:12:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-17 14:12:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-17 14:12:41,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-17 14:12:41,407 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-17 14:12:41,407 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATIONPRE_CONDITION, mainErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2018-12-17 14:12:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-17 14:12:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 342113753, now seen corresponding path program 1 times [2018-12-17 14:12:41,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-17 14:12:41,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:41,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-17 14:12:41,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-17 14:12:41,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-17 14:12:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-17 14:12:41,584 INFO L273 TraceCheckUtils]: 0: Hoare triple {169#true} call #t~malloc0.base, #t~malloc0.offset := ~malloc(400);~p~1.base, ~p~1.offset := #t~malloc0.base, #t~malloc0.offset;~q~1.base, ~q~1.offset := ~p~1.base, ~p~1.offset; {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} is VALID [2018-12-17 14:12:41,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} is VALID [2018-12-17 14:12:41,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} assume #t~short2; {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} is VALID [2018-12-17 14:12:41,622 INFO L273 TraceCheckUtils]: 3: Hoare triple {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} SUMMARY for call #t~mem1 := read~int(~q~1.base, ~q~1.offset, 4); srcloc: L16 {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} is VALID [2018-12-17 14:12:41,636 INFO L273 TraceCheckUtils]: 4: Hoare triple {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} #t~short2 := #t~mem1 >= 0; {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} is VALID [2018-12-17 14:12:41,649 INFO L273 TraceCheckUtils]: 5: Hoare triple {171#(and (= 400 (select |#length| main_~q~1.base)) (= main_~q~1.offset 0))} assume !!#t~short2;havoc #t~mem1;havoc #t~short2;#t~post3.base, #t~post3.offset := ~q~1.base, ~q~1.offset;~q~1.base, ~q~1.offset := #t~post3.base, #t~post3.offset + 4;havoc #t~post3.base, #t~post3.offset; {172#(and (<= main_~q~1.offset 4) (= (select |#length| main_~q~1.base) 400))} is VALID [2018-12-17 14:12:41,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {172#(and (<= main_~q~1.offset 4) (= (select |#length| main_~q~1.base) 400))} #t~short2 := ~q~1.offset < ~p~1.offset + 400; {172#(and (<= main_~q~1.offset 4) (= (select |#length| main_~q~1.base) 400))} is VALID [2018-12-17 14:12:41,671 INFO L273 TraceCheckUtils]: 7: Hoare triple {172#(and (<= main_~q~1.offset 4) (= (select |#length| main_~q~1.base) 400))} assume #t~short2; {172#(and (<= main_~q~1.offset 4) (= (select |#length| main_~q~1.base) 400))} is VALID [2018-12-17 14:12:41,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {172#(and (<= main_~q~1.offset 4) (= (select |#length| main_~q~1.base) 400))} assume !(4 + ~q~1.offset <= #length[~q~1.base]); {170#false} is VALID [2018-12-17 14:12:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-17 14:12:41,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-17 14:12:41,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-17 14:12:41,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-17 14:12:41,677 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [10], [11], [19] [2018-12-17 14:12:41,721 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-17 14:12:41,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-17 14:12:41,752 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:419) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:410) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:137) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:382) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-17 14:12:41,758 INFO L168 Benchmark]: Toolchain (without parser) took 2766.75 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 95.1 MB). Peak memory consumption was 95.1 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:41,760 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:41,760 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:41,761 INFO L168 Benchmark]: Boogie Preprocessor took 28.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-17 14:12:41,762 INFO L168 Benchmark]: RCFGBuilder took 661.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:41,763 INFO L168 Benchmark]: TraceAbstraction took 2028.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. [2018-12-17 14:12:41,769 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.08 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.45 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 661.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2028.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 74.0 MB). Peak memory consumption was 74.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:140) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...