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/heapseparator/speedup-poc-dd-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-824f902 [2018-12-19 12:07:43,054 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 12:07:43,056 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 12:07:43,074 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 12:07:43,074 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 12:07:43,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 12:07:43,078 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 12:07:43,080 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 12:07:43,082 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 12:07:43,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 12:07:43,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 12:07:43,086 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 12:07:43,088 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 12:07:43,091 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 12:07:43,092 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 12:07:43,093 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 12:07:43,101 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 12:07:43,103 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 12:07:43,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 12:07:43,112 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 12:07:43,114 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 12:07:43,115 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 12:07:43,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 12:07:43,118 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 12:07:43,119 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 12:07:43,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 12:07:43,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 12:07:43,122 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 12:07:43,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 12:07:43,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 12:07:43,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 12:07:43,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 12:07:43,127 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 12:07:43,127 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 12:07:43,128 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 12:07:43,129 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 12:07:43,129 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-19 12:07:43,141 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 12:07:43,142 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 12:07:43,144 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 12:07:43,144 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 12:07:43,145 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 12:07:43,145 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 12:07:43,145 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 12:07:43,145 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 12:07:43,145 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-19 12:07:43,146 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 12:07:43,146 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-19 12:07:43,146 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-19 12:07:43,146 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 12:07:43,146 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 12:07:43,149 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 12:07:43,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 12:07:43,150 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 12:07:43,150 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 12:07:43,150 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 12:07:43,150 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 12:07:43,151 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 12:07:43,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 12:07:43,151 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 12:07:43,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 12:07:43,151 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 12:07:43,154 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 12:07:43,154 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 12:07:43,154 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 12:07:43,154 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 12:07:43,155 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 12:07:43,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 12:07:43,155 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:07:43,155 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 12:07:43,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 12:07:43,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 12:07:43,156 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 12:07:43,156 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 12:07:43,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 12:07:43,157 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 12:07:43,157 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 12:07:43,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 12:07:43,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 12:07:43,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 12:07:43,208 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 12:07:43,208 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 12:07:43,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2018-12-19 12:07:43,210 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2018-12-19 12:07:43,256 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 12:07:43,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 12:07:43,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 12:07:43,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 12:07:43,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 12:07:43,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/1) ... [2018-12-19 12:07:43,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/1) ... [2018-12-19 12:07:43,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 12:07:43,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 12:07:43,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 12:07:43,326 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 12:07:43,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/1) ... [2018-12-19 12:07:43,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/1) ... [2018-12-19 12:07:43,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/1) ... [2018-12-19 12:07:43,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/1) ... [2018-12-19 12:07:43,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/1) ... [2018-12-19 12:07:43,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/1) ... [2018-12-19 12:07:43,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/1) ... [2018-12-19 12:07:43,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 12:07:43,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 12:07:43,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 12:07:43,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 12:07:43,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (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-19 12:07:43,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-19 12:07:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-19 12:07:44,032 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-19 12:07:44,032 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-19 12:07:44,037 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:07:44 BoogieIcfgContainer [2018-12-19 12:07:44,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 12:07:44,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 12:07:44,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 12:07:44,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 12:07:44,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:07:43" (1/2) ... [2018-12-19 12:07:44,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700bb8ba and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:07:44, skipping insertion in model container [2018-12-19 12:07:44,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:07:44" (2/2) ... [2018-12-19 12:07:44,046 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2018-12-19 12:07:44,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 12:07:44,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-19 12:07:44,089 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-19 12:07:44,134 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 12:07:44,134 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 12:07:44,134 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 12:07:44,135 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 12:07:44,135 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 12:07:44,135 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 12:07:44,135 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 12:07:44,135 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 12:07:44,151 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-19 12:07:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-19 12:07:44,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:44,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-19 12:07:44,162 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:44,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:44,169 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2018-12-19 12:07:44,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:44,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:44,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:44,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:44,419 INFO L273 TraceCheckUtils]: 0: Hoare triple {12#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:07:44,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {13#false} is VALID [2018-12-19 12:07:44,437 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-19 12:07:44,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:07:44,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-19 12:07:44,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:07:44,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 12:07:44,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:44,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 12:07:44,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:44,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 12:07:44,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 12:07:44,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:07:44,482 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-19 12:07:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:44,777 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-19 12:07:44,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:07:44,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 12:07:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:07:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-12-19 12:07:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:07:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-12-19 12:07:44,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2018-12-19 12:07:44,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:44,905 INFO L225 Difference]: With dead ends: 17 [2018-12-19 12:07:44,905 INFO L226 Difference]: Without dead ends: 12 [2018-12-19 12:07:44,909 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-19 12:07:44,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-19 12:07:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2018-12-19 12:07:44,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:44,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2018-12-19 12:07:44,988 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2018-12-19 12:07:44,989 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2018-12-19 12:07:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:44,992 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-19 12:07:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-12-19 12:07:44,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:44,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:44,993 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2018-12-19 12:07:44,994 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2018-12-19 12:07:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:44,996 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-19 12:07:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-12-19 12:07:44,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:44,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:44,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:44,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:07:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-19 12:07:45,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2018-12-19 12:07:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:45,005 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-19 12:07:45,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 12:07:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-19 12:07:45,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:07:45,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:45,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:07:45,006 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:45,007 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2018-12-19 12:07:45,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:45,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:45,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:45,201 INFO L273 TraceCheckUtils]: 0: Hoare triple {70#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:45,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:45,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {71#false} is VALID [2018-12-19 12:07:45,229 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-19 12:07:45,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:07:45,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-19 12:07:45,230 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:07:45,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-19 12:07:45,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:45,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 12:07:45,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:45,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 12:07:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 12:07:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:07:45,276 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2018-12-19 12:07:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:45,521 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-19 12:07:45,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:07:45,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-19 12:07:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:07:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-19 12:07:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:07:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-19 12:07:45,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2018-12-19 12:07:45,694 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-19 12:07:45,696 INFO L225 Difference]: With dead ends: 12 [2018-12-19 12:07:45,697 INFO L226 Difference]: Without dead ends: 11 [2018-12-19 12:07:45,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:07:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-19 12:07:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-19 12:07:45,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:45,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 9 states. [2018-12-19 12:07:45,704 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 9 states. [2018-12-19 12:07:45,705 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 9 states. [2018-12-19 12:07:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:45,708 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2018-12-19 12:07:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2018-12-19 12:07:45,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:45,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:45,709 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states. [2018-12-19 12:07:45,709 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states. [2018-12-19 12:07:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:45,711 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2018-12-19 12:07:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2018-12-19 12:07:45,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:45,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:45,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:45,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-19 12:07:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-12-19 12:07:45,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2018-12-19 12:07:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:45,715 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2018-12-19 12:07:45,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 12:07:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2018-12-19 12:07:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:07:45,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:45,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:07:45,716 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:45,717 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2018-12-19 12:07:45,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:45,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:45,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:45,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:45,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:45,836 INFO L273 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {124#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:07:45,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {124#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:45,840 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {123#false} is VALID [2018-12-19 12:07:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:45,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:45,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:45,843 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 12:07:45,845 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2018-12-19 12:07:45,888 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:45,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:46,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:46,009 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:07:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:46,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:46,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:46,017 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 [2018-12-19 12:07:46,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:46,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:46,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:46,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:46,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:46,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:07:46,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:46,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:46,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:07:46,353 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:46,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:46,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:46,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:46,460 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:19, output treesize:22 [2018-12-19 12:07:46,474 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:46,474 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (store (store (store |v_#memory_int_17| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|)) [2018-12-19 12:07:46,475 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:46,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:46,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:46,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:46,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:46,723 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-12-19 12:07:46,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-19 12:07:46,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:46,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:46,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-19 12:07:46,986 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:46,986 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_18| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_18| ULTIMATE.start_main_p1 (+ .cse0 1))) (= (select |v_#memory_int_18| ULTIMATE.start_main_p3) 0) (= .cse0 0) (= (select |v_#memory_int_18| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:46,987 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:47,057 INFO L273 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {129#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:07:47,059 INFO L273 TraceCheckUtils]: 1: Hoare triple {129#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {133#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:07:47,060 INFO L273 TraceCheckUtils]: 2: Hoare triple {133#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} assume !(#memory_int[main_p1] >= 0); {123#false} is VALID [2018-12-19 12:07:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:47,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:47,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {123#false} is VALID [2018-12-19 12:07:47,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {140#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:47,107 INFO L273 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {140#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} is VALID [2018-12-19 12:07:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:47,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 12:07:47,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-19 12:07:47,137 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:07:47,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 12:07:47,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:47,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:07:47,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:47,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:07:47,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:07:47,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:07:47,150 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2018-12-19 12:07:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:47,289 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2018-12-19 12:07:47,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:07:47,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-19 12:07:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-19 12:07:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-19 12:07:47,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2018-12-19 12:07:47,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:47,324 INFO L225 Difference]: With dead ends: 13 [2018-12-19 12:07:47,325 INFO L226 Difference]: Without dead ends: 12 [2018-12-19 12:07:47,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:07:47,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-19 12:07:47,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-12-19 12:07:47,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:47,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 11 states. [2018-12-19 12:07:47,346 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 11 states. [2018-12-19 12:07:47,346 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 11 states. [2018-12-19 12:07:47,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:47,348 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2018-12-19 12:07:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2018-12-19 12:07:47,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:47,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:47,349 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states. [2018-12-19 12:07:47,349 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states. [2018-12-19 12:07:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:47,351 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2018-12-19 12:07:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2018-12-19 12:07:47,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:47,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:47,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:47,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-19 12:07:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2018-12-19 12:07:47,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2018-12-19 12:07:47,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:47,354 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2018-12-19 12:07:47,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:07:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2018-12-19 12:07:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:07:47,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:47,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:07:47,356 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:47,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:47,356 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2018-12-19 12:07:47,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:47,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:47,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:47,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:47,551 INFO L273 TraceCheckUtils]: 0: Hoare triple {199#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {201#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:07:47,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {202#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:07:47,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {202#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {200#false} is VALID [2018-12-19 12:07:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:47,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:47,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:47,555 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 12:07:47,556 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2018-12-19 12:07:47,558 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:47,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:47,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:47,598 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 3. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:07:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:47,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:47,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:47,599 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 [2018-12-19 12:07:47,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:47,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:47,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:47,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:47,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:47,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:07:47,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:47,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:47,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:07:47,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:47,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:47,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:47,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:47,755 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-19 12:07:47,758 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:47,758 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, ULTIMATE.start_main_p3]. (and (= (store (store (store |v_#memory_int_20| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:47,758 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:47,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:47,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:47,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:47,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:47,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-19 12:07:47,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:47,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:47,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-19 12:07:47,949 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:47,950 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_21| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_21| ULTIMATE.start_main_p1) 0) (= (store |v_#memory_int_21| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= .cse0 0) (= (select |v_#memory_int_21| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:47,950 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:47,978 INFO L273 TraceCheckUtils]: 0: Hoare triple {199#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {206#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:47,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {210#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:07:47,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} assume !(#memory_int[main_p1] >= 0); {200#false} is VALID [2018-12-19 12:07:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:47,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:48,077 INFO L273 TraceCheckUtils]: 2: Hoare triple {214#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {200#false} is VALID [2018-12-19 12:07:48,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {218#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {214#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:48,106 INFO L273 TraceCheckUtils]: 0: Hoare triple {199#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {218#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:48,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:48,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-19 12:07:48,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:48,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-19 12:07:48,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:48,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:07:48,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:48,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:07:48,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:07:48,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:07:48,145 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2018-12-19 12:07:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:48,609 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2018-12-19 12:07:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-19 12:07:48,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-19 12:07:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-12-19 12:07:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-12-19 12:07:48,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2018-12-19 12:07:48,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:48,691 INFO L225 Difference]: With dead ends: 24 [2018-12-19 12:07:48,692 INFO L226 Difference]: Without dead ends: 23 [2018-12-19 12:07:48,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-19 12:07:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-19 12:07:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2018-12-19 12:07:48,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:48,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 13 states. [2018-12-19 12:07:48,718 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 13 states. [2018-12-19 12:07:48,719 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 13 states. [2018-12-19 12:07:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:48,721 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2018-12-19 12:07:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2018-12-19 12:07:48,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:48,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:48,722 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 23 states. [2018-12-19 12:07:48,722 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 23 states. [2018-12-19 12:07:48,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:48,725 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2018-12-19 12:07:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2018-12-19 12:07:48,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:48,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:48,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:48,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-19 12:07:48,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-12-19 12:07:48,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2018-12-19 12:07:48,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:48,728 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2018-12-19 12:07:48,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 12:07:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2018-12-19 12:07:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:07:48,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:48,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:07:48,729 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:48,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:48,730 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2018-12-19 12:07:48,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:48,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:48,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:48,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:48,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:48,770 INFO L273 TraceCheckUtils]: 0: Hoare triple {318#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2018-12-19 12:07:48,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume #memory_int[main_p1] >= 0; {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2018-12-19 12:07:48,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume #memory_int[main_p2] <= 0; {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2018-12-19 12:07:48,772 INFO L273 TraceCheckUtils]: 3: Hoare triple {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume !(#memory_int[main_p3] >= 0); {319#false} is VALID [2018-12-19 12:07:48,773 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-19 12:07:48,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:07:48,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-19 12:07:48,773 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:07:48,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-19 12:07:48,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:48,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 12:07:48,783 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-19 12:07:48,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 12:07:48,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 12:07:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:07:48,784 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2018-12-19 12:07:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:48,883 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2018-12-19 12:07:48,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:07:48,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-19 12:07:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:07:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-19 12:07:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:07:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-12-19 12:07:48,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2018-12-19 12:07:48,923 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-19 12:07:48,925 INFO L225 Difference]: With dead ends: 15 [2018-12-19 12:07:48,925 INFO L226 Difference]: Without dead ends: 12 [2018-12-19 12:07:48,926 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-19 12:07:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-19 12:07:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-19 12:07:48,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:48,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-12-19 12:07:48,977 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-19 12:07:48,977 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-19 12:07:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:48,980 INFO L93 Difference]: Finished difference Result 12 states and 29 transitions. [2018-12-19 12:07:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2018-12-19 12:07:48,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:48,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:48,980 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-19 12:07:48,980 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-19 12:07:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:48,981 INFO L93 Difference]: Finished difference Result 12 states and 29 transitions. [2018-12-19 12:07:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2018-12-19 12:07:48,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:48,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:48,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:48,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-19 12:07:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-12-19 12:07:48,984 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2018-12-19 12:07:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:48,984 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2018-12-19 12:07:48,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 12:07:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2018-12-19 12:07:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:07:48,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:48,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:07:48,985 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2018-12-19 12:07:48,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:48,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:48,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:49,110 INFO L273 TraceCheckUtils]: 0: Hoare triple {386#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {388#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:49,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {388#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {389#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:49,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {389#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {389#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:49,112 INFO L273 TraceCheckUtils]: 3: Hoare triple {389#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {387#false} is VALID [2018-12-19 12:07:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:49,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:49,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:07:49,114 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2018-12-19 12:07:49,118 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:49,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:49,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:49,147 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:07:49,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:49,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:49,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:49,148 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 [2018-12-19 12:07:49,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:49,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:49,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:49,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:49,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:49,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:07:49,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:49,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:49,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:07:49,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:49,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:49,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:49,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:49,261 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-19 12:07:49,264 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:49,264 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, ULTIMATE.start_main_p3]. (and (= (store (store (store |v_#memory_int_23| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:49,265 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:49,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:49,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:49,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:49,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:49,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-19 12:07:49,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:49,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:49,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-19 12:07:49,390 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:49,390 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|, ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_24| ULTIMATE.start_main_p1))) (and (= 0 (select |v_#memory_int_24| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_24| ULTIMATE.start_main_p3)) (= 0 .cse0) (= (store |v_#memory_int_24| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:49,390 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:49,428 INFO L273 TraceCheckUtils]: 0: Hoare triple {386#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {393#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:49,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {393#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:49,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume #memory_int[main_p1] >= 0; {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:49,431 INFO L273 TraceCheckUtils]: 3: Hoare triple {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume !(#memory_int[main_p2] <= 0); {387#false} is VALID [2018-12-19 12:07:49,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:49,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:49,465 INFO L273 TraceCheckUtils]: 3: Hoare triple {404#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {387#false} is VALID [2018-12-19 12:07:49,469 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {404#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:49,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {411#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {404#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:49,472 INFO L273 TraceCheckUtils]: 0: Hoare triple {386#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {411#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:49,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:49,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-19 12:07:49,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:49,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-19 12:07:49,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:49,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:07:49,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:49,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:07:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:07:49,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:07:49,505 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2018-12-19 12:07:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:50,032 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2018-12-19 12:07:50,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-19 12:07:50,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-19 12:07:50,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-12-19 12:07:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-12-19 12:07:50,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2018-12-19 12:07:50,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:50,076 INFO L225 Difference]: With dead ends: 21 [2018-12-19 12:07:50,076 INFO L226 Difference]: Without dead ends: 20 [2018-12-19 12:07:50,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-19 12:07:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-19 12:07:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-19 12:07:50,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:50,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 14 states. [2018-12-19 12:07:50,108 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 14 states. [2018-12-19 12:07:50,109 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 14 states. [2018-12-19 12:07:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:50,112 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. [2018-12-19 12:07:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2018-12-19 12:07:50,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:50,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:50,113 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 20 states. [2018-12-19 12:07:50,113 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 20 states. [2018-12-19 12:07:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:50,115 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. [2018-12-19 12:07:50,116 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2018-12-19 12:07:50,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:50,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:50,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:50,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-19 12:07:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2018-12-19 12:07:50,118 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2018-12-19 12:07:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:50,119 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2018-12-19 12:07:50,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 12:07:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2018-12-19 12:07:50,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:07:50,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:50,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:07:50,120 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:50,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:50,121 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2018-12-19 12:07:50,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:50,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:50,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:50,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:50,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:50,287 INFO L273 TraceCheckUtils]: 0: Hoare triple {506#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {508#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:07:50,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {509#(and (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:07:50,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {509#(and (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {510#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:50,302 INFO L273 TraceCheckUtils]: 3: Hoare triple {510#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {507#false} is VALID [2018-12-19 12:07:50,303 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-19 12:07:50,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:50,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:50,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:07:50,304 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2018-12-19 12:07:50,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:50,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:50,325 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:50,325 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:07:50,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:50,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:50,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:50,326 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 [2018-12-19 12:07:50,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:50,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:50,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:50,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:50,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:07:50,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:07:50,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:50,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:50,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:50,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:50,471 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-19 12:07:50,475 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:50,475 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, ULTIMATE.start_main_p3]. (and (= (store (store (store |v_#memory_int_26| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:50,476 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:50,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-19 12:07:50,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:50,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:50,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-19 12:07:50,633 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:50,633 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_27| ULTIMATE.start_main_p1))) (and (= 0 (select |v_#memory_int_27| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_27| ULTIMATE.start_main_p3)) (= |#memory_int| (store |v_#memory_int_27| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:50,633 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:50,782 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-19 12:07:50,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:50,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-19 12:07:50,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:50,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:50,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-19 12:07:50,950 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:50,951 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_28| ULTIMATE.start_main_p2))) (and (= |#memory_int| (store |v_#memory_int_28| ULTIMATE.start_main_p2 (+ .cse0 (- 1)))) (= 0 .cse0) (= 0 (select |v_#memory_int_28| ULTIMATE.start_main_p3)) (= (select |v_#memory_int_28| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:50,951 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:51,023 INFO L273 TraceCheckUtils]: 0: Hoare triple {506#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {514#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:51,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {514#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {518#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:51,027 INFO L273 TraceCheckUtils]: 2: Hoare triple {518#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {522#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:07:51,034 INFO L273 TraceCheckUtils]: 3: Hoare triple {522#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} assume !(#memory_int[main_p1] >= 0); {507#false} is VALID [2018-12-19 12:07:51,034 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-19 12:07:51,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:51,116 INFO L273 TraceCheckUtils]: 3: Hoare triple {526#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {507#false} is VALID [2018-12-19 12:07:51,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {530#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {526#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:51,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {534#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {530#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:51,129 INFO L273 TraceCheckUtils]: 0: Hoare triple {506#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {534#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:51,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:51,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 12:07:51,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:51,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 12:07:51,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:51,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:07:51,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:51,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:07:51,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:07:51,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:07:51,167 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2018-12-19 12:07:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:51,779 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2018-12-19 12:07:51,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:07:51,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 12:07:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:07:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-12-19 12:07:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:07:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2018-12-19 12:07:51,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2018-12-19 12:07:51,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:51,861 INFO L225 Difference]: With dead ends: 35 [2018-12-19 12:07:51,861 INFO L226 Difference]: Without dead ends: 34 [2018-12-19 12:07:51,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:07:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-19 12:07:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2018-12-19 12:07:51,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:51,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 15 states. [2018-12-19 12:07:51,911 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 15 states. [2018-12-19 12:07:51,911 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 15 states. [2018-12-19 12:07:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:51,914 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. [2018-12-19 12:07:51,914 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2018-12-19 12:07:51,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:51,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:51,915 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 34 states. [2018-12-19 12:07:51,915 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 34 states. [2018-12-19 12:07:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:51,918 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. [2018-12-19 12:07:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2018-12-19 12:07:51,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:51,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:51,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:51,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-19 12:07:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2018-12-19 12:07:51,921 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2018-12-19 12:07:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:51,921 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2018-12-19 12:07:51,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:07:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2018-12-19 12:07:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:07:51,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:51,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:07:51,922 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2018-12-19 12:07:51,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:51,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:51,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:51,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:51,981 INFO L273 TraceCheckUtils]: 0: Hoare triple {677#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {679#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:51,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:51,992 INFO L273 TraceCheckUtils]: 2: Hoare triple {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:51,993 INFO L273 TraceCheckUtils]: 3: Hoare triple {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {678#false} is VALID [2018-12-19 12:07:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:51,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:51,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:51,994 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:07:51,994 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2018-12-19 12:07:51,995 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:51,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:52,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:52,015 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:07:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:52,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:52,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:52,016 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:07:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:52,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:52,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:52,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:52,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-19 12:07:52,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:52,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-19 12:07:52,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:52,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:52,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:52,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:52,354 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:16, output treesize:19 [2018-12-19 12:07:52,357 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:52,358 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|, ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= |#memory_int| (store (store (store |v_#memory_int_31| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:52,358 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:52,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:52,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:52,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-19 12:07:52,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:52,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:52,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-19 12:07:52,425 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:52,426 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_32| ULTIMATE.start_main_p2))) (and (= .cse0 0) (= (select |v_#memory_int_32| ULTIMATE.start_main_p3) 0) (= (store |v_#memory_int_32| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:07:52,426 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:52,468 INFO L273 TraceCheckUtils]: 0: Hoare triple {677#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {684#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:52,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {684#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {688#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} is VALID [2018-12-19 12:07:52,472 INFO L273 TraceCheckUtils]: 2: Hoare triple {688#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} assume #memory_int[main_p1] >= 0; {688#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} is VALID [2018-12-19 12:07:52,473 INFO L273 TraceCheckUtils]: 3: Hoare triple {688#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} assume !(#memory_int[main_p2] <= 0); {678#false} is VALID [2018-12-19 12:07:52,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:52,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:52,492 INFO L273 TraceCheckUtils]: 3: Hoare triple {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {678#false} is VALID [2018-12-19 12:07:52,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:52,495 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:52,497 INFO L273 TraceCheckUtils]: 0: Hoare triple {677#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {701#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} is VALID [2018-12-19 12:07:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:52,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 12:07:52,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-19 12:07:52,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:07:52,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-19 12:07:52,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:52,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:07:52,523 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-19 12:07:52,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:07:52,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:07:52,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:07:52,524 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2018-12-19 12:07:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:52,798 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2018-12-19 12:07:52,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:07:52,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-19 12:07:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-12-19 12:07:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:07:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-12-19 12:07:52,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2018-12-19 12:07:52,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:52,825 INFO L225 Difference]: With dead ends: 30 [2018-12-19 12:07:52,826 INFO L226 Difference]: Without dead ends: 29 [2018-12-19 12:07:52,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:07:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-19 12:07:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-12-19 12:07:52,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:52,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 23 states. [2018-12-19 12:07:52,914 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 23 states. [2018-12-19 12:07:52,915 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 23 states. [2018-12-19 12:07:52,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:52,918 INFO L93 Difference]: Finished difference Result 29 states and 78 transitions. [2018-12-19 12:07:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 78 transitions. [2018-12-19 12:07:52,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:52,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:52,919 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 29 states. [2018-12-19 12:07:52,919 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 29 states. [2018-12-19 12:07:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:52,922 INFO L93 Difference]: Finished difference Result 29 states and 78 transitions. [2018-12-19 12:07:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 78 transitions. [2018-12-19 12:07:52,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:52,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:52,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:52,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-19 12:07:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2018-12-19 12:07:52,925 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2018-12-19 12:07:52,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:52,925 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2018-12-19 12:07:52,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:07:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2018-12-19 12:07:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:07:52,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:52,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:07:52,927 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:52,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:52,927 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2018-12-19 12:07:52,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:52,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:52,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:52,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:53,104 INFO L273 TraceCheckUtils]: 0: Hoare triple {847#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {849#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:07:53,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {849#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {850#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2018-12-19 12:07:53,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {850#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {851#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:07:53,107 INFO L273 TraceCheckUtils]: 3: Hoare triple {851#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {848#false} is VALID [2018-12-19 12:07:53,107 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-19 12:07:53,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:53,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:53,108 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:07:53,108 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2018-12-19 12:07:53,109 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:53,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:53,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:53,122 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:07:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:53,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:53,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:53,123 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:07:53,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:53,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:53,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:53,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:53,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:53,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:07:53,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:53,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:53,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:07:53,266 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:53,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:53,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:53,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:53,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-19 12:07:53,307 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:53,307 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|]. (and (= |#memory_int| (store (store (store |v_#memory_int_34| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:53,307 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:53,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:53,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:53,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:53,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:53,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-19 12:07:53,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:53,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:53,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-19 12:07:55,449 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:55,450 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_35| ULTIMATE.start_main_p2))) (and (= 0 (select |v_#memory_int_35| ULTIMATE.start_main_p1)) (= (store |v_#memory_int_35| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= 0 .cse0) (= 0 (select |v_#memory_int_35| ULTIMATE.start_main_p3)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:55,450 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:07:55,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:55,509 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:55,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:55,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:55,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:55,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:55,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-19 12:07:55,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:55,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:55,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-19 12:07:55,556 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:55,557 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_36| ULTIMATE.start_main_p3))) (and (= (store |v_#memory_int_36| ULTIMATE.start_main_p3 (+ .cse0 1)) |#memory_int|) (= 0 (+ (select |v_#memory_int_36| ULTIMATE.start_main_p2) 1)) (= .cse0 0) (= (select |v_#memory_int_36| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:07:55,557 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2018-12-19 12:07:55,583 INFO L273 TraceCheckUtils]: 0: Hoare triple {847#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {855#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:07:55,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {855#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {859#(and (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:07:55,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {859#(and (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {863#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))))} is VALID [2018-12-19 12:07:55,587 INFO L273 TraceCheckUtils]: 3: Hoare triple {863#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))))} assume !(#memory_int[main_p1] >= 0); {848#false} is VALID [2018-12-19 12:07:55,588 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-19 12:07:55,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:55,641 INFO L273 TraceCheckUtils]: 3: Hoare triple {867#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {848#false} is VALID [2018-12-19 12:07:55,643 INFO L273 TraceCheckUtils]: 2: Hoare triple {871#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {867#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:55,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {875#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {871#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:55,647 INFO L273 TraceCheckUtils]: 0: Hoare triple {847#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {875#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:55,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:55,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 12:07:55,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:55,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 12:07:55,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:55,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:07:55,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:55,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:07:55,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:07:55,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:07:55,694 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2018-12-19 12:07:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:56,502 INFO L93 Difference]: Finished difference Result 45 states and 126 transitions. [2018-12-19 12:07:56,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-19 12:07:56,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-19 12:07:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:07:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-12-19 12:07:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:07:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-12-19 12:07:56,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2018-12-19 12:07:56,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:56,564 INFO L225 Difference]: With dead ends: 45 [2018-12-19 12:07:56,564 INFO L226 Difference]: Without dead ends: 41 [2018-12-19 12:07:56,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-19 12:07:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-19 12:07:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2018-12-19 12:07:56,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:56,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 31 states. [2018-12-19 12:07:56,740 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 31 states. [2018-12-19 12:07:56,740 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 31 states. [2018-12-19 12:07:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:56,744 INFO L93 Difference]: Finished difference Result 41 states and 116 transitions. [2018-12-19 12:07:56,744 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 116 transitions. [2018-12-19 12:07:56,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:56,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:56,745 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 41 states. [2018-12-19 12:07:56,745 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 41 states. [2018-12-19 12:07:56,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:56,747 INFO L93 Difference]: Finished difference Result 41 states and 116 transitions. [2018-12-19 12:07:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 116 transitions. [2018-12-19 12:07:56,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:56,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:56,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:56,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-19 12:07:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2018-12-19 12:07:56,750 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2018-12-19 12:07:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:56,750 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2018-12-19 12:07:56,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:07:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2018-12-19 12:07:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:07:56,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:56,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:07:56,751 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:56,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2018-12-19 12:07:56,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:56,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:56,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:56,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:56,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:56,836 INFO L273 TraceCheckUtils]: 0: Hoare triple {1089#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1091#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:56,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {1091#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1092#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:56,837 INFO L273 TraceCheckUtils]: 2: Hoare triple {1092#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1092#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:56,837 INFO L273 TraceCheckUtils]: 3: Hoare triple {1092#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1090#false} is VALID [2018-12-19 12:07:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:56,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:56,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:56,838 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:07:56,838 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2018-12-19 12:07:56,839 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:56,840 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:56,850 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:56,850 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 3. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:07:56,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:56,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:56,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:56,851 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:07:56,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:56,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:56,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:56,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:56,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-19 12:07:56,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:56,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-19 12:07:56,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:56,912 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:56,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:56,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:56,944 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2018-12-19 12:07:56,947 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:56,947 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, ULTIMATE.start_main_p1]. (and (= |#memory_int| (store (store (store |v_#memory_int_39| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:56,947 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:57,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:57,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:57,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-19 12:07:57,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:57,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:57,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-19 12:07:59,093 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:59,093 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_40| ULTIMATE.start_main_p3))) (and (= .cse0 0) (= |#memory_int| (store |v_#memory_int_40| ULTIMATE.start_main_p3 (+ .cse0 1))) (= (select |v_#memory_int_40| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:07:59,094 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:59,138 INFO L273 TraceCheckUtils]: 0: Hoare triple {1089#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1096#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:07:59,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {1096#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1100#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:59,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {1100#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume #memory_int[main_p1] >= 0; {1100#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:07:59,143 INFO L273 TraceCheckUtils]: 3: Hoare triple {1100#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume !(#memory_int[main_p2] <= 0); {1090#false} is VALID [2018-12-19 12:07:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:59,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:59,166 INFO L273 TraceCheckUtils]: 3: Hoare triple {1107#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1090#false} is VALID [2018-12-19 12:07:59,166 INFO L273 TraceCheckUtils]: 2: Hoare triple {1107#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1107#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:59,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1107#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:59,169 INFO L273 TraceCheckUtils]: 0: Hoare triple {1089#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1114#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:07:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:59,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:59,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-19 12:07:59,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:59,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-19 12:07:59,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:59,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:07:59,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:59,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:07:59,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:07:59,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:07:59,203 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2018-12-19 12:07:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:59,536 INFO L93 Difference]: Finished difference Result 38 states and 111 transitions. [2018-12-19 12:07:59,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-19 12:07:59,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-19 12:07:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:07:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-12-19 12:07:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:07:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-12-19 12:07:59,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2018-12-19 12:07:59,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:59,575 INFO L225 Difference]: With dead ends: 38 [2018-12-19 12:07:59,575 INFO L226 Difference]: Without dead ends: 37 [2018-12-19 12:07:59,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-19 12:07:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-19 12:07:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-12-19 12:07:59,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:07:59,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 31 states. [2018-12-19 12:07:59,726 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 31 states. [2018-12-19 12:07:59,726 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 31 states. [2018-12-19 12:07:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:59,728 INFO L93 Difference]: Finished difference Result 37 states and 109 transitions. [2018-12-19 12:07:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 109 transitions. [2018-12-19 12:07:59,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:59,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:59,729 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 37 states. [2018-12-19 12:07:59,729 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 37 states. [2018-12-19 12:07:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:07:59,731 INFO L93 Difference]: Finished difference Result 37 states and 109 transitions. [2018-12-19 12:07:59,731 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 109 transitions. [2018-12-19 12:07:59,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:07:59,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:07:59,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:07:59,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:07:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-19 12:07:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2018-12-19 12:07:59,734 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2018-12-19 12:07:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:07:59,734 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2018-12-19 12:07:59,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 12:07:59,734 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2018-12-19 12:07:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:07:59,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:07:59,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-19 12:07:59,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:07:59,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:59,735 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2018-12-19 12:07:59,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:07:59,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:59,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:07:59,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:07:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:59,829 INFO L273 TraceCheckUtils]: 0: Hoare triple {1310#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1312#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2018-12-19 12:07:59,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {1312#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1313#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2018-12-19 12:07:59,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {1313#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume #memory_int[main_p1] >= 0; {1313#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2018-12-19 12:07:59,832 INFO L273 TraceCheckUtils]: 3: Hoare triple {1313#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume #memory_int[main_p2] <= 0; {1313#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2018-12-19 12:07:59,833 INFO L273 TraceCheckUtils]: 4: Hoare triple {1313#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume !(#memory_int[main_p3] >= 0); {1311#false} is VALID [2018-12-19 12:07:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:07:59,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:59,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:07:59,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-19 12:07:59,834 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2018-12-19 12:07:59,835 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:07:59,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:07:59,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:07:59,848 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:07:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:07:59,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:07:59,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:07:59,849 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:07:59,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:07:59,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:07:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:07:59,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:07:59,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:07:59,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:59,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:07:59,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:59,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:59,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:07:59,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:59,949 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:59,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:59,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:59,970 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-19 12:07:59,974 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:59,974 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, ULTIMATE.start_main_p2]. (and (= |#memory_int| (store (store (store |v_#memory_int_42| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:07:59,974 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:00,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:00,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:00,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:00,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:00,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-19 12:08:00,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:00,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:00,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:00,167 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:00,168 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|, ULTIMATE.start_main_p1, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_43| ULTIMATE.start_main_p1))) (and (= (select |v_#memory_int_43| ULTIMATE.start_main_p2) 0) (= .cse0 0) (= (store |v_#memory_int_43| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= (select |v_#memory_int_43| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:08:00,168 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:00,213 INFO L273 TraceCheckUtils]: 0: Hoare triple {1310#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1317#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:08:00,215 INFO L273 TraceCheckUtils]: 1: Hoare triple {1317#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1321#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:08:00,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {1321#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p1] >= 0; {1321#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:08:00,218 INFO L273 TraceCheckUtils]: 3: Hoare triple {1321#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p2] <= 0; {1321#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:08:00,219 INFO L273 TraceCheckUtils]: 4: Hoare triple {1321#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume !(#memory_int[main_p3] >= 0); {1311#false} is VALID [2018-12-19 12:08:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:00,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:08:00,248 INFO L273 TraceCheckUtils]: 4: Hoare triple {1331#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume !(#memory_int[main_p3] >= 0); {1311#false} is VALID [2018-12-19 12:08:00,248 INFO L273 TraceCheckUtils]: 3: Hoare triple {1331#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p2] <= 0; {1331#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:00,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {1331#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p1] >= 0; {1331#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:00,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {1341#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1331#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:00,252 INFO L273 TraceCheckUtils]: 0: Hoare triple {1310#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1341#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:00,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-19 12:08:00,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-19 12:08:00,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:08:00,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 12:08:00,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:08:00,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:08:00,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:00,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:08:00,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:08:00,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:08:00,280 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 4 states. [2018-12-19 12:08:00,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:00,577 INFO L93 Difference]: Finished difference Result 38 states and 117 transitions. [2018-12-19 12:08:00,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:08:00,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 12:08:00,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:08:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:08:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-19 12:08:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:08:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2018-12-19 12:08:00,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2018-12-19 12:08:00,597 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-19 12:08:00,599 INFO L225 Difference]: With dead ends: 38 [2018-12-19 12:08:00,599 INFO L226 Difference]: Without dead ends: 35 [2018-12-19 12:08:00,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-19 12:08:00,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-19 12:08:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-19 12:08:00,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:08:00,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-12-19 12:08:00,752 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-12-19 12:08:00,752 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-12-19 12:08:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:00,754 INFO L93 Difference]: Finished difference Result 35 states and 110 transitions. [2018-12-19 12:08:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 110 transitions. [2018-12-19 12:08:00,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:00,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:00,755 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-12-19 12:08:00,755 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-12-19 12:08:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:00,757 INFO L93 Difference]: Finished difference Result 35 states and 110 transitions. [2018-12-19 12:08:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 110 transitions. [2018-12-19 12:08:00,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:00,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:00,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:08:00,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:08:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-19 12:08:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 110 transitions. [2018-12-19 12:08:00,759 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 110 transitions. Word has length 5 [2018-12-19 12:08:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:08:00,760 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 110 transitions. [2018-12-19 12:08:00,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:08:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2018-12-19 12:08:00,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:08:00,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:08:00,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-19 12:08:00,761 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:08:00,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:00,761 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2018-12-19 12:08:00,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:08:00,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:00,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:00,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:00,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:08:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:01,070 INFO L273 TraceCheckUtils]: 0: Hoare triple {1538#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1540#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:08:01,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {1540#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1540#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:08:01,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {1540#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1541#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2018-12-19 12:08:01,073 INFO L273 TraceCheckUtils]: 3: Hoare triple {1541#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} assume #memory_int[main_p1] >= 0; {1542#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:01,075 INFO L273 TraceCheckUtils]: 4: Hoare triple {1542#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1539#false} is VALID [2018-12-19 12:08:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-19 12:08:01,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:01,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:08:01,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-19 12:08:01,077 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2018-12-19 12:08:01,080 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:08:01,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:08:01,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:08:01,107 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:08:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:01,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:08:01,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:01,108 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:08:01,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:01,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:08:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:01,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:08:01,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:08:01,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:01,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:08:01,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:01,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:01,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:08:01,204 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:01,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:01,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:01,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:01,237 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-19 12:08:01,242 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:01,242 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_45|]. (and (= |#memory_int| (store (store (store |v_#memory_int_45| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:01,242 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:01,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:01,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:01,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:01,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:01,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-19 12:08:01,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:01,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:01,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:03,359 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:03,360 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_46|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_46| ULTIMATE.start_main_p1))) (and (= (select |v_#memory_int_46| ULTIMATE.start_main_p3) 0) (= (store |v_#memory_int_46| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= 0 (select |v_#memory_int_46| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 .cse0))) [2018-12-19 12:08:03,360 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:03,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:03,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:03,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:03,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:03,435 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:08:03,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2018-12-19 12:08:03,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:03,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:03,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:03,500 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:03,500 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_47| ULTIMATE.start_main_p3))) (and (= (select |v_#memory_int_47| ULTIMATE.start_main_p1) 1) (= .cse0 0) (= (store |v_#memory_int_47| ULTIMATE.start_main_p3 (+ .cse0 1)) |#memory_int|) (= (select |v_#memory_int_47| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:08:03,500 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:03,544 INFO L273 TraceCheckUtils]: 0: Hoare triple {1538#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1546#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:08:03,545 INFO L273 TraceCheckUtils]: 1: Hoare triple {1546#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1550#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:03,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {1550#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1554#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:08:03,547 INFO L273 TraceCheckUtils]: 3: Hoare triple {1554#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume #memory_int[main_p1] >= 0; {1554#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:08:03,548 INFO L273 TraceCheckUtils]: 4: Hoare triple {1554#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume !(#memory_int[main_p2] <= 0); {1539#false} is VALID [2018-12-19 12:08:03,548 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-19 12:08:03,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:08:03,682 INFO L273 TraceCheckUtils]: 4: Hoare triple {1561#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1539#false} is VALID [2018-12-19 12:08:03,683 INFO L273 TraceCheckUtils]: 3: Hoare triple {1561#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1561#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:03,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {1568#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1561#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:03,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {1572#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1568#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:03,688 INFO L273 TraceCheckUtils]: 0: Hoare triple {1538#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1572#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:03,688 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-19 12:08:03,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:08:03,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 12:08:03,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:08:03,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:08:03,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:08:03,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:08:03,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:03,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:08:03,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:08:03,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:08:03,739 INFO L87 Difference]: Start difference. First operand 34 states and 110 transitions. Second operand 8 states. [2018-12-19 12:08:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:04,336 INFO L93 Difference]: Finished difference Result 37 states and 115 transitions. [2018-12-19 12:08:04,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-19 12:08:04,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:08:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:08:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-12-19 12:08:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-12-19 12:08:04,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2018-12-19 12:08:04,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:04,445 INFO L225 Difference]: With dead ends: 37 [2018-12-19 12:08:04,445 INFO L226 Difference]: Without dead ends: 34 [2018-12-19 12:08:04,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-19 12:08:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-19 12:08:04,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-19 12:08:04,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:08:04,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-12-19 12:08:04,627 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-12-19 12:08:04,627 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-12-19 12:08:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:04,629 INFO L93 Difference]: Finished difference Result 34 states and 110 transitions. [2018-12-19 12:08:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2018-12-19 12:08:04,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:04,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:04,630 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-12-19 12:08:04,630 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-12-19 12:08:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:04,632 INFO L93 Difference]: Finished difference Result 34 states and 110 transitions. [2018-12-19 12:08:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 110 transitions. [2018-12-19 12:08:04,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:04,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:04,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:08:04,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:08:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-19 12:08:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 104 transitions. [2018-12-19 12:08:04,634 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 104 transitions. Word has length 5 [2018-12-19 12:08:04,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:08:04,634 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 104 transitions. [2018-12-19 12:08:04,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:08:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 104 transitions. [2018-12-19 12:08:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:08:04,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:08:04,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-19 12:08:04,635 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:08:04,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:04,636 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2018-12-19 12:08:04,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:08:04,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:04,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:04,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:04,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:08:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:04,803 INFO L273 TraceCheckUtils]: 0: Hoare triple {1768#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1770#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2018-12-19 12:08:04,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {1770#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {1771#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:08:04,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {1771#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1772#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:08:04,806 INFO L273 TraceCheckUtils]: 3: Hoare triple {1772#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {1772#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:08:04,806 INFO L273 TraceCheckUtils]: 4: Hoare triple {1772#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {1769#false} is VALID [2018-12-19 12:08:04,806 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-19 12:08:04,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:04,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:08:04,807 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-19 12:08:04,807 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2018-12-19 12:08:04,809 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:08:04,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:08:04,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:08:04,832 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:08:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:04,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:08:04,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:04,833 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:08:04,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:04,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:08:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:04,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:08:04,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:08:04,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:04,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:08:04,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:04,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:04,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:08:04,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:04,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:05,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:05,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:05,021 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:19, output treesize:22 [2018-12-19 12:08:05,026 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:05,027 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, ULTIMATE.start_main_p3]. (and (= (store (store (store |v_#memory_int_50| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:08:05,027 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:08:05,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-19 12:08:05,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:05,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:05,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:05,109 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:05,110 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_51| ULTIMATE.start_main_p3) 0) (= .cse0 0) (= (store |v_#memory_int_51| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_51| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:08:05,110 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:08:05,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,157 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:05,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2018-12-19 12:08:05,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:05,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:05,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-19 12:08:07,227 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:07,227 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_52| ULTIMATE.start_main_p1))) (and (= (select |v_#memory_int_52| ULTIMATE.start_main_p3) 0) (= (store |v_#memory_int_52| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= (+ (select |v_#memory_int_52| ULTIMATE.start_main_p2) 1) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 .cse0))) [2018-12-19 12:08:07,227 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2018-12-19 12:08:07,282 INFO L273 TraceCheckUtils]: 0: Hoare triple {1768#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1776#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:08:07,285 INFO L273 TraceCheckUtils]: 1: Hoare triple {1776#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {1780#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:08:07,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {1780#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1784#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:08:07,288 INFO L273 TraceCheckUtils]: 3: Hoare triple {1784#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {1784#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:08:07,289 INFO L273 TraceCheckUtils]: 4: Hoare triple {1784#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {1769#false} is VALID [2018-12-19 12:08:07,290 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-19 12:08:07,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:08:07,341 INFO L273 TraceCheckUtils]: 4: Hoare triple {1791#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1769#false} is VALID [2018-12-19 12:08:07,345 INFO L273 TraceCheckUtils]: 3: Hoare triple {1791#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1791#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:07,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {1798#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1791#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:07,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {1802#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {1798#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:07,347 INFO L273 TraceCheckUtils]: 0: Hoare triple {1768#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1802#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:07,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:08:07,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 12:08:07,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:08:07,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:08:07,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:08:07,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:08:07,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:07,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:08:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:08:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:08:07,386 INFO L87 Difference]: Start difference. First operand 32 states and 104 transitions. Second operand 8 states. [2018-12-19 12:08:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:08,395 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2018-12-19 12:08:08,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:08:08,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:08:08,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:08:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2018-12-19 12:08:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2018-12-19 12:08:08,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2018-12-19 12:08:08,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:08,469 INFO L225 Difference]: With dead ends: 45 [2018-12-19 12:08:08,470 INFO L226 Difference]: Without dead ends: 44 [2018-12-19 12:08:08,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:08:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-19 12:08:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-12-19 12:08:08,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:08:08,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2018-12-19 12:08:08,957 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2018-12-19 12:08:08,957 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2018-12-19 12:08:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:08,959 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2018-12-19 12:08:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2018-12-19 12:08:08,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:08,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:08,959 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2018-12-19 12:08:08,960 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2018-12-19 12:08:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:08,961 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2018-12-19 12:08:08,961 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2018-12-19 12:08:08,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:08,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:08,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:08:08,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:08:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-19 12:08:08,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2018-12-19 12:08:08,964 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2018-12-19 12:08:08,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:08:08,964 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2018-12-19 12:08:08,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:08:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2018-12-19 12:08:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:08:08,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:08:08,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-19 12:08:08,965 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:08:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2018-12-19 12:08:08,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:08:08,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:08,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:08,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:08,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:08:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:09,128 INFO L273 TraceCheckUtils]: 0: Hoare triple {2035#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2037#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2018-12-19 12:08:09,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {2037#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2038#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:08:09,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {2038#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 1) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2039#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:08:09,132 INFO L273 TraceCheckUtils]: 3: Hoare triple {2039#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {2039#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2018-12-19 12:08:09,132 INFO L273 TraceCheckUtils]: 4: Hoare triple {2039#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {2036#false} is VALID [2018-12-19 12:08:09,133 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-19 12:08:09,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:09,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:08:09,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-19 12:08:09,134 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2018-12-19 12:08:09,136 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:08:09,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:08:09,156 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:08:09,156 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:08:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:09,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:08:09,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:09,158 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:08:09,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:09,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:08:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:09,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:08:09,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:08:09,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-19 12:08:09,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:09,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-19 12:08:09,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:09,297 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:09,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:09,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:09,320 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2018-12-19 12:08:09,325 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:09,325 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_55|, ULTIMATE.start_main_p1]. (and (= (store (store (store |v_#memory_int_55| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:09,325 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:09,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:09,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:09,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-19 12:08:09,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:09,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:09,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-12-19 12:08:09,408 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:09,409 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_56|]. (let ((.cse0 (select |v_#memory_int_56| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_56| ULTIMATE.start_main_p3) 0) (= .cse0 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (store |v_#memory_int_56| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|))) [2018-12-19 12:08:09,409 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:09,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:09,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:09,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:09,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:09,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-19 12:08:09,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:09,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:09,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-12-19 12:08:11,521 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:11,522 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_57|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_57| ULTIMATE.start_main_p3))) (and (= .cse0 0) (= (store |v_#memory_int_57| ULTIMATE.start_main_p3 (+ .cse0 1)) |#memory_int|) (= 0 (+ (select |v_#memory_int_57| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:08:11,522 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2018-12-19 12:08:11,564 INFO L273 TraceCheckUtils]: 0: Hoare triple {2035#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2043#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:11,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {2043#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2047#(and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:11,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {2047#(and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2051#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:08:11,568 INFO L273 TraceCheckUtils]: 3: Hoare triple {2051#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {2051#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:08:11,569 INFO L273 TraceCheckUtils]: 4: Hoare triple {2051#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {2036#false} is VALID [2018-12-19 12:08:11,569 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-19 12:08:11,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:08:11,616 INFO L273 TraceCheckUtils]: 4: Hoare triple {2058#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {2036#false} is VALID [2018-12-19 12:08:11,616 INFO L273 TraceCheckUtils]: 3: Hoare triple {2058#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {2058#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:11,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {2065#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2058#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:11,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {2069#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2065#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:11,620 INFO L273 TraceCheckUtils]: 0: Hoare triple {2035#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2069#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:11,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:08:11,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 12:08:11,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:08:11,642 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:08:11,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:08:11,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:08:11,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:11,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:08:11,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:08:11,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:08:11,657 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 8 states. [2018-12-19 12:08:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:12,343 INFO L93 Difference]: Finished difference Result 45 states and 130 transitions. [2018-12-19 12:08:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:08:12,343 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-19 12:08:12,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:08:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2018-12-19 12:08:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2018-12-19 12:08:12,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2018-12-19 12:08:12,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:12,388 INFO L225 Difference]: With dead ends: 45 [2018-12-19 12:08:12,388 INFO L226 Difference]: Without dead ends: 44 [2018-12-19 12:08:12,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:08:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-19 12:08:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-12-19 12:08:12,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:08:12,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2018-12-19 12:08:12,594 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2018-12-19 12:08:12,594 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2018-12-19 12:08:12,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:12,596 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2018-12-19 12:08:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2018-12-19 12:08:12,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:12,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:12,597 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2018-12-19 12:08:12,597 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2018-12-19 12:08:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:12,599 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2018-12-19 12:08:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2018-12-19 12:08:12,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:12,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:12,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:08:12,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:08:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-19 12:08:12,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 119 transitions. [2018-12-19 12:08:12,601 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 119 transitions. Word has length 5 [2018-12-19 12:08:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:08:12,601 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 119 transitions. [2018-12-19 12:08:12,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:08:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 119 transitions. [2018-12-19 12:08:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:08:12,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:08:12,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-19 12:08:12,602 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:08:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:12,603 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2018-12-19 12:08:12,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:08:12,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:12,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:12,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:12,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:08:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:12,861 INFO L273 TraceCheckUtils]: 0: Hoare triple {2302#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2304#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (< (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:12,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {2304#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (< (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2305#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:08:12,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {2305#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2306#(and (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} is VALID [2018-12-19 12:08:12,864 INFO L273 TraceCheckUtils]: 3: Hoare triple {2306#(and (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2307#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:08:12,865 INFO L273 TraceCheckUtils]: 4: Hoare triple {2307#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {2303#false} is VALID [2018-12-19 12:08:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:12,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:12,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:08:12,866 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-19 12:08:12,867 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2018-12-19 12:08:12,868 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:08:12,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:08:12,879 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:08:12,879 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 42 root evaluator evaluations with a maximum evaluation depth of 3. Performed 42 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-19 12:08:12,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:12,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:08:12,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:12,880 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:08:12,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:12,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:08:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:12,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:08:12,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:08:12,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:12,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:08:12,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:12,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:12,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:08:12,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:12,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:13,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:13,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:13,020 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-19 12:08:13,024 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:13,024 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_60|]. (and (= (store (store (store |v_#memory_int_60| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:13,024 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:13,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:13,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:13,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:13,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:13,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-19 12:08:13,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:13,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:13,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:15,102 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:15,102 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_61|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_61| ULTIMATE.start_main_p3))) (and (= |#memory_int| (store |v_#memory_int_61| ULTIMATE.start_main_p3 (+ .cse0 1))) (= 0 (select |v_#memory_int_61| ULTIMATE.start_main_p1)) (= 0 .cse0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |v_#memory_int_61| ULTIMATE.start_main_p2) 0))) [2018-12-19 12:08:15,103 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:08:15,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,183 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:08:15,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-12-19 12:08:15,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:15,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:15,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:15,223 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:15,223 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_62|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_62| ULTIMATE.start_main_p1))) (and (= (select |v_#memory_int_62| ULTIMATE.start_main_p3) 1) (= |#memory_int| (store |v_#memory_int_62| ULTIMATE.start_main_p1 (+ .cse0 1))) (= 0 .cse0) (= (select |v_#memory_int_62| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:08:15,223 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:08:15,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:15,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-19 12:08:15,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:15,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:15,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:15,350 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:15,350 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_63|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_63| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_63| ULTIMATE.start_main_p1) 1) (= (select |v_#memory_int_63| ULTIMATE.start_main_p3) 1) (= (store |v_#memory_int_63| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= .cse0 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-19 12:08:15,350 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2018-12-19 12:08:15,374 INFO L273 TraceCheckUtils]: 0: Hoare triple {2302#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2311#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:08:15,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {2311#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2315#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:08:15,378 INFO L273 TraceCheckUtils]: 2: Hoare triple {2315#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2319#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:08:15,380 INFO L273 TraceCheckUtils]: 3: Hoare triple {2319#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2323#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2018-12-19 12:08:15,381 INFO L273 TraceCheckUtils]: 4: Hoare triple {2323#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} assume !(#memory_int[main_p1] >= 0); {2303#false} is VALID [2018-12-19 12:08:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:15,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:08:15,460 INFO L273 TraceCheckUtils]: 4: Hoare triple {2327#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {2303#false} is VALID [2018-12-19 12:08:15,462 INFO L273 TraceCheckUtils]: 3: Hoare triple {2331#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2327#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:08:15,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {2335#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2331#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:08:15,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {2339#(<= 0 (select (store (store (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2335#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:08:15,467 INFO L273 TraceCheckUtils]: 0: Hoare triple {2302#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2339#(<= 0 (select (store (store (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:08:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:15,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:08:15,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-19 12:08:15,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:08:15,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-19 12:08:15,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:08:15,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-12-19 12:08:15,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:15,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-19 12:08:15,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-19 12:08:15,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-19 12:08:15,503 INFO L87 Difference]: Start difference. First operand 36 states and 119 transitions. Second operand 10 states. [2018-12-19 12:08:16,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:16,351 INFO L93 Difference]: Finished difference Result 45 states and 132 transitions. [2018-12-19 12:08:16,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-19 12:08:16,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2018-12-19 12:08:16,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:08:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 12:08:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-12-19 12:08:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 12:08:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2018-12-19 12:08:16,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2018-12-19 12:08:16,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:16,764 INFO L225 Difference]: With dead ends: 45 [2018-12-19 12:08:16,764 INFO L226 Difference]: Without dead ends: 44 [2018-12-19 12:08:16,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-19 12:08:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-19 12:08:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 23. [2018-12-19 12:08:17,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:08:17,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 23 states. [2018-12-19 12:08:17,001 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 23 states. [2018-12-19 12:08:17,001 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 23 states. [2018-12-19 12:08:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:17,002 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2018-12-19 12:08:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 125 transitions. [2018-12-19 12:08:17,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:17,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:17,003 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 44 states. [2018-12-19 12:08:17,003 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 44 states. [2018-12-19 12:08:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:17,004 INFO L93 Difference]: Finished difference Result 44 states and 125 transitions. [2018-12-19 12:08:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 125 transitions. [2018-12-19 12:08:17,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:17,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:17,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:08:17,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:08:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-19 12:08:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2018-12-19 12:08:17,005 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2018-12-19 12:08:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:08:17,006 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2018-12-19 12:08:17,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-19 12:08:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2018-12-19 12:08:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-19 12:08:17,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:08:17,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-19 12:08:17,007 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:08:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2018-12-19 12:08:17,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:08:17,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:17,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:17,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:08:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:17,212 INFO L273 TraceCheckUtils]: 0: Hoare triple {2550#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2552#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2018-12-19 12:08:17,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {2552#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2552#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2018-12-19 12:08:17,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {2552#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2553#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:08:17,215 INFO L273 TraceCheckUtils]: 3: Hoare triple {2553#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p1] >= 0; {2553#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:08:17,215 INFO L273 TraceCheckUtils]: 4: Hoare triple {2553#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p2] <= 0; {2554#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2018-12-19 12:08:17,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {2554#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume !(#memory_int[main_p3] >= 0); {2551#false} is VALID [2018-12-19 12:08:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-19 12:08:17,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:17,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:08:17,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-19 12:08:17,217 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2018-12-19 12:08:17,218 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:08:17,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:08:17,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:08:17,232 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:08:17,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:17,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:08:17,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:17,232 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:08:17,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:17,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:08:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:17,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:08:17,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:08:17,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:17,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:08:17,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:17,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:17,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:08:17,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:17,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:17,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:17,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:17,354 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-19 12:08:17,359 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:17,360 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_67|]. (and (= (store (store (store |v_#memory_int_67| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:17,360 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:17,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:17,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:17,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:17,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:17,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-19 12:08:17,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:17,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:17,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:19,452 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:19,452 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_68|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_68| ULTIMATE.start_main_p1))) (and (= (select |v_#memory_int_68| ULTIMATE.start_main_p2) 0) (= (store |v_#memory_int_68| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= (select |v_#memory_int_68| ULTIMATE.start_main_p3) 0) (= .cse0 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:08:19,452 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:19,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:19,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:19,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:19,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:19,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:19,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:19,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-19 12:08:19,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:19,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:19,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:19,555 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:19,555 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_69|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_69| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_69| ULTIMATE.start_main_p3) 0) (= .cse0 0) (= (store |v_#memory_int_69| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_69| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:08:19,555 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:19,623 INFO L273 TraceCheckUtils]: 0: Hoare triple {2550#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2558#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:08:19,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {2558#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2562#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:19,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {2562#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2566#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:08:19,626 INFO L273 TraceCheckUtils]: 3: Hoare triple {2566#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p1] >= 0; {2566#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:08:19,627 INFO L273 TraceCheckUtils]: 4: Hoare triple {2566#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p2] <= 0; {2566#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:08:19,628 INFO L273 TraceCheckUtils]: 5: Hoare triple {2566#(and (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p2 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume !(#memory_int[main_p3] >= 0); {2551#false} is VALID [2018-12-19 12:08:19,628 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-19 12:08:19,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:08:19,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {2576#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume !(#memory_int[main_p3] >= 0); {2551#false} is VALID [2018-12-19 12:08:19,678 INFO L273 TraceCheckUtils]: 4: Hoare triple {2576#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p2] <= 0; {2576#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:19,679 INFO L273 TraceCheckUtils]: 3: Hoare triple {2576#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p1] >= 0; {2576#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:19,680 INFO L273 TraceCheckUtils]: 2: Hoare triple {2586#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2576#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:19,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {2590#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2586#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:19,684 INFO L273 TraceCheckUtils]: 0: Hoare triple {2550#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2590#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:19,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:19,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:08:19,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-19 12:08:19,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:08:19,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-19 12:08:19,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:08:19,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:08:19,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:19,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:08:19,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:08:19,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:08:19,723 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 8 states. [2018-12-19 12:08:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:20,361 INFO L93 Difference]: Finished difference Result 29 states and 74 transitions. [2018-12-19 12:08:20,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-19 12:08:20,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-19 12:08:20,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:08:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-12-19 12:08:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2018-12-19 12:08:20,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2018-12-19 12:08:20,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:20,707 INFO L225 Difference]: With dead ends: 29 [2018-12-19 12:08:20,708 INFO L226 Difference]: Without dead ends: 24 [2018-12-19 12:08:20,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-19 12:08:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-19 12:08:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-12-19 12:08:20,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:08:20,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 22 states. [2018-12-19 12:08:20,962 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 22 states. [2018-12-19 12:08:20,962 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 22 states. [2018-12-19 12:08:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:20,963 INFO L93 Difference]: Finished difference Result 24 states and 65 transitions. [2018-12-19 12:08:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 65 transitions. [2018-12-19 12:08:20,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:20,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:20,964 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states. [2018-12-19 12:08:20,964 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states. [2018-12-19 12:08:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:20,965 INFO L93 Difference]: Finished difference Result 24 states and 65 transitions. [2018-12-19 12:08:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 65 transitions. [2018-12-19 12:08:20,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:20,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:20,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:08:20,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:08:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-19 12:08:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2018-12-19 12:08:20,966 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 59 transitions. Word has length 6 [2018-12-19 12:08:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:08:20,967 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 59 transitions. [2018-12-19 12:08:20,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:08:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2018-12-19 12:08:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-19 12:08:20,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:08:20,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-19 12:08:20,968 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:08:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2018-12-19 12:08:20,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:08:20,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:20,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:20,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:20,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:08:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:21,231 INFO L273 TraceCheckUtils]: 0: Hoare triple {2730#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2732#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:08:21,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {2732#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2732#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2018-12-19 12:08:21,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {2732#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2733#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0))} is VALID [2018-12-19 12:08:21,235 INFO L273 TraceCheckUtils]: 3: Hoare triple {2733#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2734#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (<= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2018-12-19 12:08:21,236 INFO L273 TraceCheckUtils]: 4: Hoare triple {2734#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (<= (select |#memory_int| ULTIMATE.start_main_p2) 0))} assume #memory_int[main_p1] >= 0; {2735#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:21,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {2735#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {2731#false} is VALID [2018-12-19 12:08:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-19 12:08:21,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:21,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:08:21,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-19 12:08:21,238 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2018-12-19 12:08:21,239 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:08:21,239 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:08:21,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:08:21,256 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-19 12:08:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:21,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:08:21,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:21,256 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:08:21,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:21,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:08:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:21,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:08:21,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:08:21,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:21,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2018-12-19 12:08:21,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:21,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:21,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-12-19 12:08:21,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:21,352 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:21,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:21,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:21,380 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:22 [2018-12-19 12:08:21,385 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:21,385 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_72|]. (and (= |#memory_int| (store (store (store |v_#memory_int_72| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:21,385 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:21,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:21,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:21,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:21,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:21,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2018-12-19 12:08:21,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:21,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:21,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:23,535 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:23,535 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_73|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_73| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_73| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= .cse0 0) (= (select |v_#memory_int_73| ULTIMATE.start_main_p2) 0) (= 0 (select |v_#memory_int_73| ULTIMATE.start_main_p3)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:08:23,535 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:23,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,603 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2018-12-19 12:08:23,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:23,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:23,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2018-12-19 12:08:23,703 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:23,703 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_74|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_74| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_74| ULTIMATE.start_main_p1) 1) (= (store |v_#memory_int_74| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= .cse0 0) (= (select |v_#memory_int_74| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:08:23,704 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:23,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,764 INFO L683 Elim1Store]: detected equality via solver [2018-12-19 12:08:23,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:23,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-19 12:08:23,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:23,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:23,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-12-19 12:08:24,242 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:24,242 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_75|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_75| ULTIMATE.start_main_p3))) (and (= (select |v_#memory_int_75| ULTIMATE.start_main_p1) 1) (= |#memory_int| (store |v_#memory_int_75| ULTIMATE.start_main_p3 (+ .cse0 1))) (= .cse0 0) (= 0 (+ (select |v_#memory_int_75| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:08:24,242 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2018-12-19 12:08:24,294 INFO L273 TraceCheckUtils]: 0: Hoare triple {2730#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2739#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2018-12-19 12:08:24,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {2739#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2743#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:24,298 INFO L273 TraceCheckUtils]: 2: Hoare triple {2743#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2747#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:24,300 INFO L273 TraceCheckUtils]: 3: Hoare triple {2747#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2751#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:08:24,301 INFO L273 TraceCheckUtils]: 4: Hoare triple {2751#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {2751#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2018-12-19 12:08:24,302 INFO L273 TraceCheckUtils]: 5: Hoare triple {2751#(and (exists ((ULTIMATE.start_main_p1 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {2731#false} is VALID [2018-12-19 12:08:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:24,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:08:24,392 INFO L273 TraceCheckUtils]: 5: Hoare triple {2735#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {2731#false} is VALID [2018-12-19 12:08:24,393 INFO L273 TraceCheckUtils]: 4: Hoare triple {2735#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {2735#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:24,399 INFO L273 TraceCheckUtils]: 3: Hoare triple {2764#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2735#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:24,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {2768#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2764#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:24,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {2772#(<= (select (store (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2768#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:24,403 INFO L273 TraceCheckUtils]: 0: Hoare triple {2730#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2772#(<= (select (store (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2018-12-19 12:08:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:24,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:08:24,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-19 12:08:24,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:08:24,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-19 12:08:24,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:08:24,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-12-19 12:08:24,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:24,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-19 12:08:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-19 12:08:24,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-12-19 12:08:24,445 INFO L87 Difference]: Start difference. First operand 22 states and 59 transitions. Second operand 10 states. [2018-12-19 12:08:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:25,607 INFO L93 Difference]: Finished difference Result 27 states and 69 transitions. [2018-12-19 12:08:25,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-19 12:08:25,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-19 12:08:25,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:08:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 12:08:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-12-19 12:08:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 12:08:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-12-19 12:08:25,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2018-12-19 12:08:25,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:25,681 INFO L225 Difference]: With dead ends: 27 [2018-12-19 12:08:25,682 INFO L226 Difference]: Without dead ends: 26 [2018-12-19 12:08:25,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-12-19 12:08:25,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-19 12:08:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 8. [2018-12-19 12:08:25,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:08:25,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 8 states. [2018-12-19 12:08:25,867 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 8 states. [2018-12-19 12:08:25,867 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 8 states. [2018-12-19 12:08:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:25,868 INFO L93 Difference]: Finished difference Result 26 states and 67 transitions. [2018-12-19 12:08:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 67 transitions. [2018-12-19 12:08:25,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:25,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:25,869 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 26 states. [2018-12-19 12:08:25,869 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 26 states. [2018-12-19 12:08:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:25,870 INFO L93 Difference]: Finished difference Result 26 states and 67 transitions. [2018-12-19 12:08:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 67 transitions. [2018-12-19 12:08:25,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:25,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:25,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:08:25,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:08:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 16 transitions. [2018-12-19 12:08:25,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 16 transitions. Word has length 6 [2018-12-19 12:08:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:08:25,872 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 16 transitions. [2018-12-19 12:08:25,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-19 12:08:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 16 transitions. [2018-12-19 12:08:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-19 12:08:25,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:08:25,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-19 12:08:25,874 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:08:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash 897112336, now seen corresponding path program 1 times [2018-12-19 12:08:25,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:08:25,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:25,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:25,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:08:25,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:08:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:26,175 INFO L273 TraceCheckUtils]: 0: Hoare triple {2890#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2892#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)))} is VALID [2018-12-19 12:08:26,177 INFO L273 TraceCheckUtils]: 1: Hoare triple {2892#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2892#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)))} is VALID [2018-12-19 12:08:26,178 INFO L273 TraceCheckUtils]: 2: Hoare triple {2892#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2893#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= 0 (select |#memory_int| ULTIMATE.start_main_p3)))} is VALID [2018-12-19 12:08:26,179 INFO L273 TraceCheckUtils]: 3: Hoare triple {2893#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= 0 (select |#memory_int| ULTIMATE.start_main_p3)))} assume #memory_int[main_p1] >= 0; {2893#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= 0 (select |#memory_int| ULTIMATE.start_main_p3)))} is VALID [2018-12-19 12:08:26,180 INFO L273 TraceCheckUtils]: 4: Hoare triple {2893#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (<= 0 (select |#memory_int| ULTIMATE.start_main_p3)))} assume #memory_int[main_p2] <= 0; {2894#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:26,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {2894#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume !(#memory_int[main_p3] >= 0); {2891#false} is VALID [2018-12-19 12:08:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-19 12:08:26,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:26,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:08:26,182 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-19 12:08:26,182 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [18], [19] [2018-12-19 12:08:26,183 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:08:26,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:08:26,206 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:08:26,206 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 3. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:08:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:08:26,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:08:26,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:08:26,207 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:08:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:08:26,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:08:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:08:26,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:08:26,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-19 12:08:26,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2018-12-19 12:08:26,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:26,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-19 12:08:26,281 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:26,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:26,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:08:26,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:26,342 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:16, output treesize:19 [2018-12-19 12:08:26,345 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:26,345 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_79|, ULTIMATE.start_main_p1]. (and (= |#memory_int| (store (store (store |v_#memory_int_79| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:26,345 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:26,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:26,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:26,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-19 12:08:26,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:26,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:26,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2018-12-19 12:08:28,409 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:28,409 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_80|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_80| ULTIMATE.start_main_p2))) (and (= 0 .cse0) (= (store |v_#memory_int_80| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= 0 (select |v_#memory_int_80| ULTIMATE.start_main_p3)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:08:28,409 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:28,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:28,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:28,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:28,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:08:28,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-19 12:08:28,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:08:28,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:08:28,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2018-12-19 12:08:28,466 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:08:28,467 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_81|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_81| ULTIMATE.start_main_p3))) (and (= (+ (select |v_#memory_int_81| ULTIMATE.start_main_p2) 1) 0) (= (store |v_#memory_int_81| ULTIMATE.start_main_p3 (+ .cse0 1)) |#memory_int|) (= 0 .cse0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2018-12-19 12:08:28,467 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2018-12-19 12:08:28,506 INFO L273 TraceCheckUtils]: 0: Hoare triple {2890#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2898#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:28,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {2898#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2902#(and (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2018-12-19 12:08:28,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {2902#(and (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2906#(and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))))} is VALID [2018-12-19 12:08:28,517 INFO L273 TraceCheckUtils]: 3: Hoare triple {2906#(and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))))} assume #memory_int[main_p1] >= 0; {2906#(and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))))} is VALID [2018-12-19 12:08:28,517 INFO L273 TraceCheckUtils]: 4: Hoare triple {2906#(and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))))} assume #memory_int[main_p2] <= 0; {2906#(and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))))} is VALID [2018-12-19 12:08:28,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {2906#(and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (exists ((ULTIMATE.start_main_p2 Int)) (and (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))))} assume !(#memory_int[main_p3] >= 0); {2891#false} is VALID [2018-12-19 12:08:28,518 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-19 12:08:28,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:08:28,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {2894#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume !(#memory_int[main_p3] >= 0); {2891#false} is VALID [2018-12-19 12:08:28,558 INFO L273 TraceCheckUtils]: 4: Hoare triple {2894#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p2] <= 0; {2894#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:28,559 INFO L273 TraceCheckUtils]: 3: Hoare triple {2894#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p1] >= 0; {2894#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:28,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {2925#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2894#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2018-12-19 12:08:28,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {2929#(<= 0 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2925#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1))} is VALID [2018-12-19 12:08:28,561 INFO L273 TraceCheckUtils]: 0: Hoare triple {2890#true} havoc main_p1, main_p2, main_p3;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2929#(<= 0 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1))} is VALID [2018-12-19 12:08:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:08:28,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:08:28,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2018-12-19 12:08:28,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:08:28,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-19 12:08:28,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:08:28,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:08:28,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:28,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:08:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:08:28,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-19 12:08:28,600 INFO L87 Difference]: Start difference. First operand 8 states and 16 transitions. Second operand 8 states. [2018-12-19 12:08:29,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:29,268 INFO L93 Difference]: Finished difference Result 14 states and 31 transitions. [2018-12-19 12:08:29,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:08:29,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2018-12-19 12:08:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:08:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-12-19 12:08:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:08:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-12-19 12:08:29,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2018-12-19 12:08:29,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:08:29,303 INFO L225 Difference]: With dead ends: 14 [2018-12-19 12:08:29,303 INFO L226 Difference]: Without dead ends: 0 [2018-12-19 12:08:29,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:08:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-19 12:08:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-19 12:08:29,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:08:29,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-19 12:08:29,304 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:08:29,304 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:08:29,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:29,305 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:08:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:08:29,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:29,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:29,305 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:08:29,305 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:08:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:08:29,305 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:08:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:08:29,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:29,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:08:29,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:08:29,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:08:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-19 12:08:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-19 12:08:29,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2018-12-19 12:08:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:08:29,306 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-19 12:08:29,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:08:29,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:08:29,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:08:29,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-19 12:08:29,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-19 12:08:29,481 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 139 [2018-12-19 12:08:31,302 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 133 DAG size of output: 30 [2018-12-19 12:08:31,310 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-19 12:08:31,311 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 28 36) the Hoare annotation is: (let ((.cse2 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse0 (<= 0 .cse5)) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p2)) (.cse3 (< (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p3)) (.cse4 (= 0 .cse2))) (or (and .cse0 (or (and (<= .cse1 0) (<= 1 .cse2)) (and (<= (+ .cse1 1) 0) .cse3 .cse4))) (and .cse0 (= 0 .cse1) .cse3 .cse4)))) [2018-12-19 12:08:31,311 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-19 12:08:31,311 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2018-12-19 12:08:31,311 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 38) no Hoare annotation was computed. [2018-12-19 12:08:31,311 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 42) no Hoare annotation was computed. [2018-12-19 12:08:31,311 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-19 12:08:31,311 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-12-19 12:08:31,312 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2018-12-19 12:08:31,313 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-19 12:08:31,313 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-19 12:08:31,313 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-12-19 12:08:31,321 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-12-19 12:08:31,321 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2018-12-19 12:08:31,322 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-12-19 12:08:31,322 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-12-19 12:08:31,322 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-19 12:08:31,322 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-19 12:08:31,331 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:08:31 BoogieIcfgContainer [2018-12-19 12:08:31,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-19 12:08:31,333 INFO L168 Benchmark]: Toolchain (without parser) took 48075.89 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -875.3 MB). Peak memory consumption was 174.3 MB. Max. memory is 7.1 GB. [2018-12-19 12:08:31,334 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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-19 12:08:31,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.58 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-19 12:08:31,334 INFO L168 Benchmark]: Boogie Preprocessor took 26.92 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-19 12:08:31,334 INFO L168 Benchmark]: RCFGBuilder took 684.14 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-19 12:08:31,335 INFO L168 Benchmark]: TraceAbstraction took 47293.07 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -896.5 MB). Peak memory consumption was 153.1 MB. Max. memory is 7.1 GB. [2018-12-19 12:08:31,336 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.20 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 66.58 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 26.92 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 684.14 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 47293.07 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -896.5 MB). Peak memory consumption was 153.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (0 <= #memory_int[p3] && ((#memory_int[p3 := #memory_int[p3] + 1][p2] <= 0 && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]))) || (((0 <= #memory_int[p3] && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && p1 + 1 < p3) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 47.1s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 124 SDslu, 1 SDs, 0 SdLazy, 1052 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 15 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 124 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 100 HoareAnnotationTreeSize, 1 FomulaSimplifications, 5245 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 4723 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 168 ConstructedInterpolants, 45 QuantifiedInterpolants, 9722 SizeOfPredicates, 30 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 25/117 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...