java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 15:10:31,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 15:10:31,920 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 15:10:31,932 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 15:10:31,933 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 15:10:31,933 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 15:10:31,935 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 15:10:31,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 15:10:31,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 15:10:31,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 15:10:31,940 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 15:10:31,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 15:10:31,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 15:10:31,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 15:10:31,944 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 15:10:31,944 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 15:10:31,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 15:10:31,947 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 15:10:31,949 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 15:10:31,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 15:10:31,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 15:10:31,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 15:10:31,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 15:10:31,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 15:10:31,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 15:10:31,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 15:10:31,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 15:10:31,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 15:10:31,960 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 15:10:31,961 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 15:10:31,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 15:10:31,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 15:10:31,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 15:10:31,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 15:10:31,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 15:10:31,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 15:10:31,965 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 15:10:31,978 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 15:10:31,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 15:10:31,979 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 15:10:31,979 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 15:10:31,980 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 15:10:31,980 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 15:10:31,980 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 15:10:31,980 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 15:10:31,980 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 15:10:31,981 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 15:10:31,981 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 15:10:31,981 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 15:10:31,981 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 15:10:31,982 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 15:10:31,982 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 15:10:31,982 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 15:10:31,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 15:10:31,983 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 15:10:31,983 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 15:10:31,983 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 15:10:31,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 15:10:31,983 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 15:10:31,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 15:10:31,984 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 15:10:31,984 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 15:10:31,984 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 15:10:31,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 15:10:31,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 15:10:31,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 15:10:31,985 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 15:10:31,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:10:31,985 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 15:10:31,986 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 15:10:31,986 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 15:10:31,986 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 15:10:31,986 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 15:10:31,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 15:10:31,986 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 15:10:31,987 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 15:10:32,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 15:10:32,028 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 15:10:32,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 15:10:32,033 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 15:10:32,034 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 15:10:32,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-01-31 15:10:32,035 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-31 15:10:32,073 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 15:10:32,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 15:10:32,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 15:10:32,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 15:10:32,076 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 15:10:32,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/1) ... [2019-01-31 15:10:32,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/1) ... [2019-01-31 15:10:32,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 15:10:32,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 15:10:32,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 15:10:32,133 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 15:10:32,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/1) ... [2019-01-31 15:10:32,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/1) ... [2019-01-31 15:10:32,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/1) ... [2019-01-31 15:10:32,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/1) ... [2019-01-31 15:10:32,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/1) ... [2019-01-31 15:10:32,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/1) ... [2019-01-31 15:10:32,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/1) ... [2019-01-31 15:10:32,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 15:10:32,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 15:10:32,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 15:10:32,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 15:10:32,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:10:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 15:10:32,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 15:10:32,718 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 15:10:32,719 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-31 15:10:32,720 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:10:32 BoogieIcfgContainer [2019-01-31 15:10:32,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 15:10:32,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 15:10:32,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 15:10:32,725 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 15:10:32,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:10:32" (1/2) ... [2019-01-31 15:10:32,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13caad9b and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 03:10:32, skipping insertion in model container [2019-01-31 15:10:32,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:10:32" (2/2) ... [2019-01-31 15:10:32,729 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-31 15:10:32,739 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 15:10:32,747 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-31 15:10:32,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-31 15:10:32,798 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 15:10:32,798 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 15:10:32,798 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 15:10:32,798 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 15:10:32,799 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 15:10:32,799 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 15:10:32,799 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 15:10:32,799 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 15:10:32,814 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-31 15:10:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 15:10:32,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:10:32,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 15:10:32,825 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:10:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:32,831 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-31 15:10:32,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:10:32,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:32,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:32,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:32,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:10:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:33,064 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;#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 [2019-01-31 15:10:33,069 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 [2019-01-31 15:10:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:33,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 15:10:33,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 15:10:33,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:10:33,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 15:10:33,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:10:33,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:10:33,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:33,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:10:33,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:10:33,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:10:33,121 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-31 15:10:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:33,442 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-31 15:10:33,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:10:33,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 15:10:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:10:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:10:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-31 15:10:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:10:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-31 15:10:33,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2019-01-31 15:10:33,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:33,649 INFO L225 Difference]: With dead ends: 17 [2019-01-31 15:10:33,649 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 15:10:33,659 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 [2019-01-31 15:10:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 15:10:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-31 15:10:33,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:10:33,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2019-01-31 15:10:33,734 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2019-01-31 15:10:33,734 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2019-01-31 15:10:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:33,738 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 15:10:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-31 15:10:33,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:33,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:33,741 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2019-01-31 15:10:33,742 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2019-01-31 15:10:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:33,747 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 15:10:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-31 15:10:33,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:33,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:33,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:10:33,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:10:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 15:10:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-31 15:10:33,755 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-31 15:10:33,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:10:33,755 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-31 15:10:33,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:10:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-31 15:10:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:10:33,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:10:33,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:10:33,757 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:10:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-31 15:10:33,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:10:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:33,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:10:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:33,831 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;#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 [2019-01-31 15:10:33,832 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 [2019-01-31 15:10:33,833 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 [2019-01-31 15:10:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:33,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 15:10:33,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 15:10:33,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:10:33,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:10:33,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:10:33,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:10:33,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:33,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:10:33,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:10:33,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:10:33,870 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-31 15:10:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:33,934 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-31 15:10:33,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:10:33,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:10:33,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:10:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:10:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-31 15:10:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:10:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-31 15:10:33,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-31 15:10:33,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:33,965 INFO L225 Difference]: With dead ends: 12 [2019-01-31 15:10:33,965 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 15:10:33,967 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 [2019-01-31 15:10:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 15:10:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-31 15:10:33,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:10:33,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 9 states. [2019-01-31 15:10:33,980 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 9 states. [2019-01-31 15:10:33,980 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 9 states. [2019-01-31 15:10:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:33,982 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-31 15:10:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-31 15:10:33,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:33,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:33,983 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states. [2019-01-31 15:10:33,983 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states. [2019-01-31 15:10:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:33,985 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-31 15:10:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-31 15:10:33,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:33,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:33,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:10:33,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:10:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 15:10:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-31 15:10:33,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-31 15:10:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:10:33,988 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-31 15:10:33,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:10:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-31 15:10:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:10:33,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:10:33,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:10:33,990 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:10:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-31 15:10:33,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:10:33,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:33,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:33,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:10:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:34,167 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;#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 [2019-01-31 15:10:34,168 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 [2019-01-31 15:10:34,170 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 [2019-01-31 15:10:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:34,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:10:34,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:10:34,171 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 15:10:34,173 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-31 15:10:34,225 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:10:34,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:10:40,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:10:40,270 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 15:10:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:40,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:10:40,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:10:40,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 15:10:40,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:40,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:10:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:40,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:10:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:40,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 15:10:40,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:40,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:40,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-31 15:10:40,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:40,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:40,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-01-31 15:10:40,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2019-01-31 15:10:40,626 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 [2019-01-31 15:10:40,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:40,643 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:40,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:40,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 15:10:40,668 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-01-31 15:10:40,672 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:10:40,673 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, |v_#valid_5|]. (let ((.cse0 (store |v_#valid_5| ULTIMATE.start_main_p1 1))) (and (= 0 (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= (select .cse0 ULTIMATE.start_main_p2) 0) (= (store (store (store |v_#memory_int_17| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|))) [2019-01-31 15:10:40,673 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:10:40,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:40,720 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 [2019-01-31 15:10:40,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:40,767 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. [2019-01-31 15:10:40,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 15:10:40,774 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:10:40,775 WARN L398 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))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_18| ULTIMATE.start_main_p3) 0) (= .cse0 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_18| ULTIMATE.start_main_p2) 0))) [2019-01-31 15:10:40,775 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:10:40,814 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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {129#(and (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-01-31 15:10:40,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {129#(and (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} #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 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} is VALID [2019-01-31 15:10:40,817 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 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} assume !(#memory_int[main_p1] >= 0); {123#false} is VALID [2019-01-31 15:10:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:40,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:10:40,842 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 [2019-01-31 15:10:40,843 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 [2019-01-31 15:10:40,844 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;#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 [2019-01-31 15:10:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:40,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 15:10:40,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 15:10:40,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:10:40,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 15:10:40,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:10:40,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 15:10:40,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:40,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 15:10:40,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 15:10:40,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 15:10:40,871 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-31 15:10:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:40,945 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-31 15:10:40,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 15:10:40,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 15:10:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:10:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 15:10:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-31 15:10:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 15:10:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-31 15:10:40,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2019-01-31 15:10:40,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:40,981 INFO L225 Difference]: With dead ends: 13 [2019-01-31 15:10:40,981 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 15:10:40,981 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 [2019-01-31 15:10:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 15:10:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-31 15:10:40,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:10:40,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 11 states. [2019-01-31 15:10:40,992 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 11 states. [2019-01-31 15:10:40,992 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 11 states. [2019-01-31 15:10:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:40,993 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-01-31 15:10:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-31 15:10:40,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:40,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:40,994 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states. [2019-01-31 15:10:40,994 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states. [2019-01-31 15:10:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:40,996 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-01-31 15:10:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-31 15:10:40,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:40,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:40,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:10:40,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:10:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 15:10:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-31 15:10:40,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-31 15:10:40,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:10:40,998 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-31 15:10:40,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 15:10:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-31 15:10:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:10:40,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:10:41,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:10:41,000 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:10:41,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:41,000 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-31 15:10:41,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:10:41,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:41,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:41,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:10:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:41,085 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;#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 [2019-01-31 15:10:41,086 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 [2019-01-31 15:10:41,087 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 [2019-01-31 15:10:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:41,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:10:41,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:10:41,088 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 15:10:41,088 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-31 15:10:41,090 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:10:41,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:10:45,233 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:10:45,234 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 15:10:45,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:45,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:10:45,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:10:45,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 15:10:45,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:45,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:10:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:45,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:10:45,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:45,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 15:10:45,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:45,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:45,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-31 15:10:45,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:45,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:45,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-01-31 15:10:45,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2019-01-31 15:10:45,375 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 [2019-01-31 15:10:45,377 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:45,387 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:45,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:45,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 15:10:45,413 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-31 15:10:45,416 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:10:45,416 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, ULTIMATE.start_main_p3, |v_#valid_6|]. (let ((.cse0 (store |v_#valid_6| ULTIMATE.start_main_p1 1))) (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|) (= (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0) (= 0 (select .cse0 ULTIMATE.start_main_p2)))) [2019-01-31 15:10:45,417 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:10:45,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:45,468 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 [2019-01-31 15:10:45,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:45,484 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. [2019-01-31 15:10:45,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 15:10:45,941 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:10:45,941 WARN L398 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|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse0 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_21| ULTIMATE.start_main_p3) 0))) [2019-01-31 15:10:45,941 WARN L399 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) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) [2019-01-31 15:10:46,008 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;#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 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-31 15:10:46,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {210#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-01-31 15:10:46,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {200#false} is VALID [2019-01-31 15:10:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:46,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:10:46,036 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 [2019-01-31 15:10:46,037 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 [2019-01-31 15:10:46,039 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;#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 [2019-01-31 15:10:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:46,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:10:46,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 15:10:46,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:10:46,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 15:10:46,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:10:46,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 15:10:46,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:46,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 15:10:46,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 15:10:46,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 15:10:46,076 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-31 15:10:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:46,559 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-31 15:10:46,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 15:10:46,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 15:10:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:10:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:10:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-01-31 15:10:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:10:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-01-31 15:10:46,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2019-01-31 15:10:46,600 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:46,603 INFO L225 Difference]: With dead ends: 24 [2019-01-31 15:10:46,603 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 15:10:46,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 15:10:46,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 15:10:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-31 15:10:46,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:10:46,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 13 states. [2019-01-31 15:10:46,617 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 13 states. [2019-01-31 15:10:46,617 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 13 states. [2019-01-31 15:10:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:46,621 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2019-01-31 15:10:46,621 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2019-01-31 15:10:46,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:46,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:46,621 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 23 states. [2019-01-31 15:10:46,621 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 23 states. [2019-01-31 15:10:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:46,623 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2019-01-31 15:10:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2019-01-31 15:10:46,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:46,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:46,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:10:46,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:10:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 15:10:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-31 15:10:46,626 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-31 15:10:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:10:46,626 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-31 15:10:46,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 15:10:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-31 15:10:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 15:10:46,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:10:46,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 15:10:46,627 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:10:46,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-31 15:10:46,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:10:46,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:46,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:46,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:46,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:10:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:46,658 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;#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 [2019-01-31 15:10:46,659 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 [2019-01-31 15:10:46,660 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 [2019-01-31 15:10:46,660 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 [2019-01-31 15:10:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:46,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 15:10:46,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 15:10:46,661 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:10:46,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 15:10:46,661 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:10:46,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:10:46,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:46,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:10:46,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:10:46,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:10:46,672 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-31 15:10:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:46,745 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-31 15:10:46,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:10:46,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 15:10:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:10:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:10:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-31 15:10:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:10:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-31 15:10:46,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2019-01-31 15:10:46,769 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:46,770 INFO L225 Difference]: With dead ends: 15 [2019-01-31 15:10:46,770 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 15:10:46,770 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 [2019-01-31 15:10:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 15:10:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 15:10:46,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:10:46,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-31 15:10:46,809 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-31 15:10:46,809 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-31 15:10:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:46,811 INFO L93 Difference]: Finished difference Result 12 states and 29 transitions. [2019-01-31 15:10:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-31 15:10:46,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:46,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:46,812 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-31 15:10:46,812 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-31 15:10:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:46,814 INFO L93 Difference]: Finished difference Result 12 states and 29 transitions. [2019-01-31 15:10:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-31 15:10:46,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:46,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:46,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:10:46,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:10:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 15:10:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-31 15:10:46,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-31 15:10:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:10:46,816 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-31 15:10:46,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:10:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-31 15:10:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 15:10:46,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:10:46,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 15:10:46,818 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:10:46,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:46,818 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-31 15:10:46,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:10:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:46,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:46,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:10:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:46,928 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;#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 [2019-01-31 15:10:46,930 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 [2019-01-31 15:10:46,930 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 [2019-01-31 15:10:46,933 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 [2019-01-31 15:10:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:46,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:10:46,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:10:46,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 15:10:46,934 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-31 15:10:46,936 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:10:46,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:10:50,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:10:50,478 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 15:10:50,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:50,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:10:50,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:10:50,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 15:10:50,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:50,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:10:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:50,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:10:50,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-31 15:10:50,541 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 [2019-01-31 15:10:50,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:50,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:50,550 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 [2019-01-31 15:10:50,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:50,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:50,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:50,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:50,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 15:10:50,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:50,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:50,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-31 15:10:50,628 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:50,633 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:50,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 15:10:50,648 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-31 15:10:50,652 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:10:50,652 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, ULTIMATE.start_main_p3, |v_#valid_7|]. (let ((.cse0 (store |v_#valid_7| ULTIMATE.start_main_p1 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (store (store (store |v_#memory_int_23| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (= (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0))) [2019-01-31 15:10:50,652 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:10:50,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:50,711 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 [2019-01-31 15:10:50,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:50,727 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. [2019-01-31 15:10:50,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-31 15:10:51,214 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:10:51,214 WARN L398 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)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 .cse0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_24| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) [2019-01-31 15:10:51,215 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:10:51,243 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;#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 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-31 15:10:51,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {393#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} is VALID [2019-01-31 15:10:51,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} assume #memory_int[main_p1] >= 0; {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} is VALID [2019-01-31 15:10:51,246 INFO L273 TraceCheckUtils]: 3: Hoare triple {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} assume !(#memory_int[main_p2] <= 0); {387#false} is VALID [2019-01-31 15:10:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:51,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:10:51,269 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 [2019-01-31 15:10:51,270 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 [2019-01-31 15:10:51,272 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 [2019-01-31 15:10:51,273 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;#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 [2019-01-31 15:10:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:51,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:10:51,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 15:10:51,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:10:51,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 15:10:51,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:10:51,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 15:10:51,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:51,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 15:10:51,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 15:10:51,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 15:10:51,304 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-31 15:10:51,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:51,523 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-31 15:10:51,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 15:10:51,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 15:10:51,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:10:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:10:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-01-31 15:10:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:10:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-01-31 15:10:51,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2019-01-31 15:10:51,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:51,558 INFO L225 Difference]: With dead ends: 21 [2019-01-31 15:10:51,559 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 15:10:51,559 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 [2019-01-31 15:10:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 15:10:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-31 15:10:51,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:10:51,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 14 states. [2019-01-31 15:10:51,576 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 14 states. [2019-01-31 15:10:51,577 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 14 states. [2019-01-31 15:10:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:51,578 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. [2019-01-31 15:10:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-01-31 15:10:51,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:51,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:51,579 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 20 states. [2019-01-31 15:10:51,579 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 20 states. [2019-01-31 15:10:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:51,581 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. [2019-01-31 15:10:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-01-31 15:10:51,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:51,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:51,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:10:51,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:10:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 15:10:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-31 15:10:51,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-31 15:10:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:10:51,584 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-31 15:10:51,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 15:10:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-31 15:10:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 15:10:51,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:10:51,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 15:10:51,585 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:10:51,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-31 15:10:51,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:10:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:51,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:51,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:10:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:51,669 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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {508#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-01-31 15:10:51,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {509#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-01-31 15:10:51,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {509#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (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]; {510#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:10:51,672 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 [2019-01-31 15:10:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:51,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:10:51,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:10:51,674 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 15:10:51,674 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-31 15:10:51,675 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:10:51,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:10:56,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:10:56,285 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 15:10:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:56,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:10:56,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:10:56,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 15:10:56,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:56,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:10:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:56,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:10:56,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:56,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 15:10:56,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:56,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:56,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-31 15:10:56,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:56,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:56,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-01-31 15:10:56,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2019-01-31 15:10:56,527 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 [2019-01-31 15:10:56,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:56,596 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:56,602 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:10:56,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 15:10:56,616 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-31 15:10:56,622 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:10:56,622 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, ULTIMATE.start_main_p3, |v_#valid_8|]. (let ((.cse0 (store |v_#valid_8| ULTIMATE.start_main_p1 1))) (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|) (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0))) [2019-01-31 15:10:56,622 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:10:56,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:56,663 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 [2019-01-31 15:10:56,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:56,689 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. [2019-01-31 15:10:56,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 15:10:56,692 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:10:56,693 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_27| ULTIMATE.start_main_p1))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_27| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_27| ULTIMATE.start_main_p3)) (= |#memory_int| (store |v_#memory_int_27| ULTIMATE.start_main_p1 (+ .cse0 1))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= .cse0 0))) [2019-01-31 15:10:56,693 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:10:56,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:56,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:56,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:56,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:56,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:10:56,730 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 [2019-01-31 15:10:56,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:10:56,751 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. [2019-01-31 15:10:56,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-31 15:10:56,849 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:10:56,850 WARN L398 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) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_28| ULTIMATE.start_main_p3)) (= (select |v_#memory_int_28| ULTIMATE.start_main_p1) 1))) [2019-01-31 15:10:56,850 WARN L399 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)) [2019-01-31 15:10:56,870 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;#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 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-31 15:10:56,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {514#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| 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) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} is VALID [2019-01-31 15:10:56,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {518#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {522#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} is VALID [2019-01-31 15:10:56,875 INFO L273 TraceCheckUtils]: 3: Hoare triple {522#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} assume !(#memory_int[main_p1] >= 0); {507#false} is VALID [2019-01-31 15:10:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:56,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:10:56,915 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 [2019-01-31 15:10:56,916 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 [2019-01-31 15:10:56,918 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 [2019-01-31 15:10:56,920 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;#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 [2019-01-31 15:10:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:56,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:10:56,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 15:10:56,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:10:56,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 15:10:56,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:10:56,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-31 15:10:56,958 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:56,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 15:10:56,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 15:10:56,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 15:10:56,959 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-31 15:10:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:57,545 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-31 15:10:57,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 15:10:57,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 15:10:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:10:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 15:10:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2019-01-31 15:10:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 15:10:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2019-01-31 15:10:57,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2019-01-31 15:10:57,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:57,600 INFO L225 Difference]: With dead ends: 35 [2019-01-31 15:10:57,601 INFO L226 Difference]: Without dead ends: 34 [2019-01-31 15:10:57,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 15:10:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-31 15:10:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-31 15:10:57,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:10:57,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 15 states. [2019-01-31 15:10:57,626 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 15 states. [2019-01-31 15:10:57,626 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 15 states. [2019-01-31 15:10:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:57,629 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. [2019-01-31 15:10:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2019-01-31 15:10:57,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:57,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:57,630 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 34 states. [2019-01-31 15:10:57,630 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 34 states. [2019-01-31 15:10:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:57,632 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. [2019-01-31 15:10:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2019-01-31 15:10:57,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:57,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:57,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:10:57,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:10:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-31 15:10:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-31 15:10:57,635 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-31 15:10:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:10:57,635 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-31 15:10:57,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 15:10:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-31 15:10:57,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 15:10:57,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:10:57,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 15:10:57,636 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:10:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-31 15:10:57,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:10:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:57,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:10:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:10:57,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:10:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:10:57,693 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;#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 [2019-01-31 15:10:57,699 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 [2019-01-31 15:10:57,699 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 [2019-01-31 15:10:57,700 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 [2019-01-31 15:10:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:10:57,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:10:57,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:10:57,701 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 15:10:57,701 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-31 15:10:57,702 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:10:57,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:11:01,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:11:01,068 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 15:11:01,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:11:01,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:11:01,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:11:01,069 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 [2019-01-31 15:11:01,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:11:01,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:11:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:01,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:11:01,093 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 [2019-01-31 15:11:01,100 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 [2019-01-31 15:11:01,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-31 15:11:01,117 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:01,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:01,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:01,137 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. [2019-01-31 15:11:01,138 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-01-31 15:11:01,141 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:11:01,141 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|, ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (= |#memory_int| (store (store (store |v_#memory_int_31| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) [2019-01-31 15:11:01,141 WARN L399 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)) [2019-01-31 15:11:01,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:01,153 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-31 15:11:01,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:01,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:01,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 15:11:01,165 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:11:01,165 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|]. (let ((.cse0 (select |v_#memory_int_32| ULTIMATE.start_main_p2))) (and (= .cse0 0) (= (store |v_#memory_int_32| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|))) [2019-01-31 15:11:01,166 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) [2019-01-31 15:11:01,173 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;#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 [2019-01-31 15:11:01,174 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]; {687#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2019-01-31 15:11:01,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {687#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume #memory_int[main_p1] >= 0; {687#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2019-01-31 15:11:01,175 INFO L273 TraceCheckUtils]: 3: Hoare triple {687#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume !(#memory_int[main_p2] <= 0); {678#false} is VALID [2019-01-31 15:11:01,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:11:01,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:11:01,187 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 [2019-01-31 15:11:01,188 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 [2019-01-31 15:11:01,189 INFO L273 TraceCheckUtils]: 1: Hoare triple {700#(<= (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 [2019-01-31 15:11:01,190 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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {700#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} is VALID [2019-01-31 15:11:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:11:01,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 15:11:01,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-31 15:11:01,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:11:01,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 15:11:01,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:11:01,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 15:11:01,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:11:01,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 15:11:01,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 15:11:01,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-31 15:11:01,214 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-31 15:11:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:11:01,358 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-31 15:11:01,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 15:11:01,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 15:11:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:11:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 15:11:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-31 15:11:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 15:11:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-31 15:11:01,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2019-01-31 15:11:01,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:11:01,382 INFO L225 Difference]: With dead ends: 30 [2019-01-31 15:11:01,382 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 15:11:01,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-31 15:11:01,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 15:11:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-31 15:11:01,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:11:01,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 23 states. [2019-01-31 15:11:01,438 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 23 states. [2019-01-31 15:11:01,438 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 23 states. [2019-01-31 15:11:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:11:01,442 INFO L93 Difference]: Finished difference Result 29 states and 78 transitions. [2019-01-31 15:11:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 78 transitions. [2019-01-31 15:11:01,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:11:01,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:11:01,443 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 29 states. [2019-01-31 15:11:01,443 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 29 states. [2019-01-31 15:11:01,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:11:01,445 INFO L93 Difference]: Finished difference Result 29 states and 78 transitions. [2019-01-31 15:11:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 78 transitions. [2019-01-31 15:11:01,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:11:01,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:11:01,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:11:01,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:11:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 15:11:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-31 15:11:01,448 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-31 15:11:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:11:01,448 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-31 15:11:01,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 15:11:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-31 15:11:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 15:11:01,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:11:01,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 15:11:01,449 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:11:01,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:11:01,450 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-31 15:11:01,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:11:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:11:01,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:11:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:11:01,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:11:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:01,578 INFO L273 TraceCheckUtils]: 0: Hoare triple {846#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {848#(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 [2019-01-31 15:11:01,580 INFO L273 TraceCheckUtils]: 1: Hoare triple {848#(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]; {849#(and (or (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2019-01-31 15:11:01,581 INFO L273 TraceCheckUtils]: 2: Hoare triple {849#(and (or (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {850#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-01-31 15:11:01,581 INFO L273 TraceCheckUtils]: 3: Hoare triple {850#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {847#false} is VALID [2019-01-31 15:11:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:11:01,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:11:01,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:11:01,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 15:11:01,582 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-31 15:11:01,584 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:11:01,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:11:06,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:11:06,366 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 15:11:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:11:06,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:11:06,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:11:06,367 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 [2019-01-31 15:11:06,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:11:06,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:11:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:06,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:11:06,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-31 15:11:06,466 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 [2019-01-31 15:11:06,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,475 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 [2019-01-31 15:11:06,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:06,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:06,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:06,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 15:11:06,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-31 15:11:06,595 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:06,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:06,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:06,613 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-31 15:11:06,619 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:11:06,619 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|, |v_#valid_9|]. (let ((.cse0 (store |v_#valid_9| ULTIMATE.start_main_p1 1))) (and (= (select .cse0 ULTIMATE.start_main_p2) 0) (= (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0) (= |#memory_int| (store (store (store |v_#memory_int_34| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)))) [2019-01-31 15:11:06,619 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:11:06,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,660 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 [2019-01-31 15:11:06,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:06,680 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. [2019-01-31 15:11:06,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 15:11:06,694 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:11:06,694 WARN L398 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)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_35| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= 0 .cse0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_35| ULTIMATE.start_main_p3)))) [2019-01-31 15:11:06,694 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:11:06,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:06,730 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 [2019-01-31 15:11:06,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:06,750 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. [2019-01-31 15:11:06,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-31 15:11:06,858 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:11:06,858 WARN L398 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) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) [2019-01-31 15:11:06,858 WARN L399 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) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2019-01-31 15:11:06,879 INFO L273 TraceCheckUtils]: 0: Hoare triple {846#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {854#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:11:06,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {854#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {858#(and (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:11:06,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {858#(and (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {862#(and (exists ((ULTIMATE.start_main_p2 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)))} is VALID [2019-01-31 15:11:06,883 INFO L273 TraceCheckUtils]: 3: Hoare triple {862#(and (exists ((ULTIMATE.start_main_p2 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)))} assume !(#memory_int[main_p1] >= 0); {847#false} is VALID [2019-01-31 15:11:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:11:06,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:11:06,933 INFO L273 TraceCheckUtils]: 3: Hoare triple {850#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {847#false} is VALID [2019-01-31 15:11:06,934 INFO L273 TraceCheckUtils]: 2: Hoare triple {869#(or (= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 0) (<= 1 (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]; {850#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-01-31 15:11:06,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {873#(or (<= 1 (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)) (= 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]; {869#(or (= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 0) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)))} is VALID [2019-01-31 15:11:06,938 INFO L273 TraceCheckUtils]: 0: Hoare triple {846#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {873#(or (<= 1 (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)) (= 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 [2019-01-31 15:11:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:11:06,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:11:06,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 15:11:06,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:11:06,958 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 15:11:06,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:11:06,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-31 15:11:06,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:11:06,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 15:11:06,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 15:11:06,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 15:11:06,972 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-31 15:11:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:11:07,525 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-01-31 15:11:07,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 15:11:07,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 15:11:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:11:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 15:11:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-31 15:11:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 15:11:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-31 15:11:07,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2019-01-31 15:11:07,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:11:07,589 INFO L225 Difference]: With dead ends: 48 [2019-01-31 15:11:07,589 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 15:11:07,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 15:11:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 15:11:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-31 15:11:07,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:11:07,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 31 states. [2019-01-31 15:11:07,725 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 31 states. [2019-01-31 15:11:07,725 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 31 states. [2019-01-31 15:11:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:11:07,728 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2019-01-31 15:11:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2019-01-31 15:11:07,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:11:07,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:11:07,729 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 44 states. [2019-01-31 15:11:07,730 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 44 states. [2019-01-31 15:11:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:11:07,732 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2019-01-31 15:11:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2019-01-31 15:11:07,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:11:07,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:11:07,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:11:07,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:11:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 15:11:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-31 15:11:07,736 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-31 15:11:07,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:11:07,736 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-31 15:11:07,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 15:11:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-31 15:11:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 15:11:07,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:11:07,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 15:11:07,737 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:11:07,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:11:07,738 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-31 15:11:07,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:11:07,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:11:07,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:11:07,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:11:07,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:11:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:07,786 INFO L273 TraceCheckUtils]: 0: Hoare triple {1099#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1101#(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 [2019-01-31 15:11:07,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {1101#(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]; {1102#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:11:07,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {1102#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1102#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:11:07,788 INFO L273 TraceCheckUtils]: 3: Hoare triple {1102#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1100#false} is VALID [2019-01-31 15:11:07,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:11:07,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:11:07,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:11:07,789 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 15:11:07,789 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-31 15:11:07,792 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:11:07,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:11:40,684 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:11:40,684 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 15:11:40,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:11:40,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:11:40,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:11:40,686 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 [2019-01-31 15:11:40,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:11:40,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:11:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:40,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:11:40,718 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 11 treesize of output 14 [2019-01-31 15:11:40,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:40,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:40,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2019-01-31 15:11:40,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:40,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:40,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-31 15:11:40,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2019-01-31 15:11:40,786 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 17 treesize of output 24 [2019-01-31 15:11:40,791 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:40,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:40,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:40,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 15:11:40,820 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-31 15:11:40,824 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:11:40,825 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, ULTIMATE.start_main_p1, |v_#valid_10|]. (and (= 0 (select (store (store |v_#valid_10| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= |#memory_int| (store (store (store |v_#memory_int_39| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0))) [2019-01-31 15:11:40,825 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:11:40,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:40,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, 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 [2019-01-31 15:11:40,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:40,909 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. [2019-01-31 15:11:40,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-31 15:11:51,543 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:11:51,544 WARN L398 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) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= |#memory_int| (store |v_#memory_int_40| ULTIMATE.start_main_p3 (+ .cse0 1))) (= (select |v_#memory_int_40| ULTIMATE.start_main_p2) 0))) [2019-01-31 15:11:51,544 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2019-01-31 15:11:51,673 INFO L273 TraceCheckUtils]: 0: Hoare triple {1099#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1106#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:11:51,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {1106#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1110#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-31 15:11:51,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {1110#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume #memory_int[main_p1] >= 0; {1110#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-31 15:11:51,676 INFO L273 TraceCheckUtils]: 3: Hoare triple {1110#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume !(#memory_int[main_p2] <= 0); {1100#false} is VALID [2019-01-31 15:11:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:11:51,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:11:51,699 INFO L273 TraceCheckUtils]: 3: Hoare triple {1117#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1100#false} is VALID [2019-01-31 15:11:51,709 INFO L273 TraceCheckUtils]: 2: Hoare triple {1117#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1117#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:11:51,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {1124#(<= (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]; {1117#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:11:51,711 INFO L273 TraceCheckUtils]: 0: Hoare triple {1099#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1124#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:11:51,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:11:51,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:11:51,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 15:11:51,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:11:51,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 15:11:51,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:11:51,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 15:11:51,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:11:51,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 15:11:51,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 15:11:51,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 15:11:51,740 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-31 15:11:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:11:52,071 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-01-31 15:11:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 15:11:52,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 15:11:52,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:11:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:11:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-01-31 15:11:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 15:11:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-01-31 15:11:52,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2019-01-31 15:11:52,142 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:11:52,143 INFO L225 Difference]: With dead ends: 39 [2019-01-31 15:11:52,143 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 15:11:52,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 15:11:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 15:11:52,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-01-31 15:11:52,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:11:52,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2019-01-31 15:11:52,237 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2019-01-31 15:11:52,237 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2019-01-31 15:11:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:11:52,239 INFO L93 Difference]: Finished difference Result 38 states and 113 transitions. [2019-01-31 15:11:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 113 transitions. [2019-01-31 15:11:52,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:11:52,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:11:52,241 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2019-01-31 15:11:52,241 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2019-01-31 15:11:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:11:52,243 INFO L93 Difference]: Finished difference Result 38 states and 113 transitions. [2019-01-31 15:11:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 113 transitions. [2019-01-31 15:11:52,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:11:52,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:11:52,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:11:52,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:11:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 15:11:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-01-31 15:11:52,246 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-01-31 15:11:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:11:52,246 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-01-31 15:11:52,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 15:11:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-01-31 15:11:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 15:11:52,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:11:52,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 15:11:52,247 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:11:52,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:11:52,247 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-31 15:11:52,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:11:52,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:11:52,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:11:52,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:11:52,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:11:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:52,384 INFO L273 TraceCheckUtils]: 0: Hoare triple {1326#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1328#(or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))} is VALID [2019-01-31 15:11:52,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {1328#(or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1329#(or (<= (select |#memory_int| ULTIMATE.start_main_p1) (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:11:52,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {1329#(or (<= (select |#memory_int| ULTIMATE.start_main_p1) (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p1] >= 0; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-01-31 15:11:52,387 INFO L273 TraceCheckUtils]: 3: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p2] <= 0; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-01-31 15:11:52,388 INFO L273 TraceCheckUtils]: 4: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume !(#memory_int[main_p3] >= 0); {1327#false} is VALID [2019-01-31 15:11:52,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:11:52,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:11:52,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:11:52,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 15:11:52,389 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-31 15:11:52,390 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:11:52,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:11:55,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:11:55,195 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 15:11:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:11:55,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:11:55,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:11:55,196 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 [2019-01-31 15:11:55,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:11:55,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:11:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:11:55,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:11:55,251 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 [2019-01-31 15:11:55,265 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 [2019-01-31 15:11:55,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:55,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:55,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-01-31 15:11:55,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:55,287 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:55,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:55,308 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 11 treesize of output 14 [2019-01-31 15:11:55,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:55,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:55,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2019-01-31 15:11:55,326 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:55,332 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:11:55,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 15:11:55,343 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-31 15:11:55,347 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:11:55,347 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, ULTIMATE.start_main_p2, |v_#valid_11|]. (and (= (select (store (store |v_#valid_11| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0) (= |#memory_int| (store (store (store |v_#memory_int_42| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0))) [2019-01-31 15:11:55,347 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:11:55,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:11:55,382 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 [2019-01-31 15:11:55,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:11:55,394 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. [2019-01-31 15:11:55,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-31 15:12:06,055 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:06,056 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_43| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_43| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_43| ULTIMATE.start_main_p3) 0))) [2019-01-31 15:12:06,056 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:12:06,405 INFO L273 TraceCheckUtils]: 0: Hoare triple {1326#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1334#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:12:06,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {1334#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:12:06,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p1] >= 0; {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:12:06,408 INFO L273 TraceCheckUtils]: 3: Hoare triple {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p2] <= 0; {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:12:06,409 INFO L273 TraceCheckUtils]: 4: Hoare triple {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume !(#memory_int[main_p3] >= 0); {1327#false} is VALID [2019-01-31 15:12:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:06,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:12:06,428 INFO L273 TraceCheckUtils]: 4: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume !(#memory_int[main_p3] >= 0); {1327#false} is VALID [2019-01-31 15:12:06,428 INFO L273 TraceCheckUtils]: 3: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p2] <= 0; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-01-31 15:12:06,437 INFO L273 TraceCheckUtils]: 2: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p1] >= 0; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-01-31 15:12:06,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {1357#(<= 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]; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-01-31 15:12:06,439 INFO L273 TraceCheckUtils]: 0: Hoare triple {1326#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1357#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3))} is VALID [2019-01-31 15:12:06,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:06,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 15:12:06,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-01-31 15:12:06,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:12:06,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 15:12:06,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:12:06,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 15:12:06,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:12:06,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 15:12:06,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 15:12:06,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-31 15:12:06,466 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-01-31 15:12:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:06,649 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-01-31 15:12:06,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:12:06,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 15:12:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:12:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 15:12:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-31 15:12:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 15:12:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-31 15:12:06,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-31 15:12:06,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:12:06,721 INFO L225 Difference]: With dead ends: 39 [2019-01-31 15:12:06,722 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 15:12:06,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-31 15:12:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 15:12:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-31 15:12:06,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:12:06,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2019-01-31 15:12:06,864 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2019-01-31 15:12:06,864 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2019-01-31 15:12:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:06,867 INFO L93 Difference]: Finished difference Result 36 states and 114 transitions. [2019-01-31 15:12:06,867 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 114 transitions. [2019-01-31 15:12:06,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:12:06,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:12:06,868 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2019-01-31 15:12:06,868 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2019-01-31 15:12:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:06,870 INFO L93 Difference]: Finished difference Result 36 states and 114 transitions. [2019-01-31 15:12:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 114 transitions. [2019-01-31 15:12:06,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:12:06,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:12:06,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:12:06,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:12:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 15:12:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-01-31 15:12:06,872 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-01-31 15:12:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:12:06,873 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-01-31 15:12:06,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 15:12:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-31 15:12:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 15:12:06,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:12:06,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 15:12:06,874 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:12:06,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:12:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-31 15:12:06,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:12:06,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:12:06,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:12:06,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:12:06,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:12:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:06,991 INFO L273 TraceCheckUtils]: 0: Hoare triple {1560#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1562#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (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 [2019-01-31 15:12:06,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {1562#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (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]; {1562#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (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 [2019-01-31 15:12:06,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {1562#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (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_p3 := #memory_int[main_p3] + 1]; {1563#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:06,995 INFO L273 TraceCheckUtils]: 3: Hoare triple {1563#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1563#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:06,996 INFO L273 TraceCheckUtils]: 4: Hoare triple {1563#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1561#false} is VALID [2019-01-31 15:12:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 15:12:06,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:12:06,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:12:06,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 15:12:06,998 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-31 15:12:07,002 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:12:07,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:12:12,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:12:12,116 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 15:12:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:12:12,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:12:12,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:12:12,117 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 [2019-01-31 15:12:12,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:12:12,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:12:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:12,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:12:12,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-31 15:12:12,393 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 [2019-01-31 15:12:12,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:12,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:12,404 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 [2019-01-31 15:12:12,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:12,435 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:12,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:12,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:12,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 15:12:12,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:12,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:12,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-31 15:12:12,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:12,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:12,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:12,517 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-31 15:12:12,540 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:12,540 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_45|, |v_#valid_12|]. (let ((.cse0 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (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)) (= 0 (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= 0 (select .cse0 ULTIMATE.start_main_p2)))) [2019-01-31 15:12:12,541 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:12:12,834 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-31 15:12:12,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:12,969 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 [2019-01-31 15:12:12,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:12,982 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. [2019-01-31 15:12:12,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 15:12:13,000 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:13,001 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_46|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_46| ULTIMATE.start_main_p1))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |v_#memory_int_46| ULTIMATE.start_main_p3) 0) (= (store |v_#memory_int_46| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_46| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 .cse0))) [2019-01-31 15:12:13,001 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:12:13,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:13,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:13,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:13,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 15:12:13,036 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 [2019-01-31 15:12:13,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:13,052 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. [2019-01-31 15:12:13,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-31 15:12:24,249 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:24,250 WARN L398 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) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (store |v_#memory_int_47| ULTIMATE.start_main_p3 (+ .cse0 1)) |#memory_int|) (= (select |v_#memory_int_47| ULTIMATE.start_main_p2) 0))) [2019-01-31 15:12:24,250 WARN L399 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)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) [2019-01-31 15:12:24,419 INFO L273 TraceCheckUtils]: 0: Hoare triple {1560#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1567#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:12:24,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {1567#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1571#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:12:24,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {1571#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1575#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} is VALID [2019-01-31 15:12:24,423 INFO L273 TraceCheckUtils]: 3: Hoare triple {1575#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} assume #memory_int[main_p1] >= 0; {1575#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} is VALID [2019-01-31 15:12:24,424 INFO L273 TraceCheckUtils]: 4: Hoare triple {1575#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} assume !(#memory_int[main_p2] <= 0); {1561#false} is VALID [2019-01-31 15:12:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:24,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:12:24,461 INFO L273 TraceCheckUtils]: 4: Hoare triple {1582#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1561#false} is VALID [2019-01-31 15:12:24,462 INFO L273 TraceCheckUtils]: 3: Hoare triple {1582#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1582#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:24,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {1589#(<= (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]; {1582#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:24,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {1593#(<= (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]; {1589#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:24,466 INFO L273 TraceCheckUtils]: 0: Hoare triple {1560#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1593#(<= (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 [2019-01-31 15:12:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:24,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:12:24,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 15:12:24,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:12:24,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-31 15:12:24,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:12:24,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-31 15:12:24,529 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:12:24,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 15:12:24,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 15:12:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 15:12:24,530 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-01-31 15:12:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:24,930 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-01-31 15:12:24,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 15:12:24,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-31 15:12:24,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:12:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 15:12:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2019-01-31 15:12:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 15:12:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2019-01-31 15:12:24,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2019-01-31 15:12:24,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:12:24,967 INFO L225 Difference]: With dead ends: 38 [2019-01-31 15:12:24,968 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 15:12:24,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 15:12:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 15:12:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-31 15:12:25,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:12:25,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2019-01-31 15:12:25,072 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2019-01-31 15:12:25,072 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2019-01-31 15:12:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:25,074 INFO L93 Difference]: Finished difference Result 35 states and 114 transitions. [2019-01-31 15:12:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-31 15:12:25,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:12:25,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:12:25,075 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2019-01-31 15:12:25,075 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2019-01-31 15:12:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:25,077 INFO L93 Difference]: Finished difference Result 35 states and 114 transitions. [2019-01-31 15:12:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-31 15:12:25,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:12:25,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:12:25,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:12:25,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:12:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 15:12:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-01-31 15:12:25,079 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-01-31 15:12:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:12:25,079 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-01-31 15:12:25,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 15:12:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-01-31 15:12:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 15:12:25,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:12:25,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 15:12:25,080 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:12:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:12:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-31 15:12:25,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:12:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:12:25,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:12:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:12:25,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:12:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:25,180 INFO L273 TraceCheckUtils]: 0: Hoare triple {1793#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1795#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2019-01-31 15:12:25,181 INFO L273 TraceCheckUtils]: 1: Hoare triple {1795#(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]; {1796#(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 [2019-01-31 15:12:25,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {1796#(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]; {1797#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-01-31 15:12:25,183 INFO L273 TraceCheckUtils]: 3: Hoare triple {1797#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {1797#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-01-31 15:12:25,183 INFO L273 TraceCheckUtils]: 4: Hoare triple {1797#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {1794#false} is VALID [2019-01-31 15:12:25,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:25,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:12:25,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:12:25,185 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 15:12:25,185 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-31 15:12:25,187 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:12:25,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:12:29,123 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:12:29,123 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 15:12:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:12:29,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:12:29,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:12:29,124 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 [2019-01-31 15:12:29,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:12:29,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:12:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:29,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:12:29,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 15:12:29,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:29,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-01-31 15:12:29,204 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 [2019-01-31 15:12:29,217 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 [2019-01-31 15:12:29,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:29,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:29,280 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:29,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 15:12:29,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-01-31 15:12:29,299 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:29,300 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, ULTIMATE.start_main_p3, |v_#valid_13|]. (and (= 0 (select (store |v_#valid_13| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2)) (= (store (store (store |v_#memory_int_50| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|)) [2019-01-31 15:12:29,300 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:12:29,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:29,337 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 [2019-01-31 15:12:29,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:29,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:29,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 15:12:29,362 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:29,362 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p2))) (and (= .cse0 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_51| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_51| ULTIMATE.start_main_p1) 0))) [2019-01-31 15:12:29,362 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2))) [2019-01-31 15:12:29,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:29,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:29,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:29,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:29,397 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 [2019-01-31 15:12:29,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:29,410 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. [2019-01-31 15:12:29,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-31 15:12:39,516 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:39,517 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_52| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_52| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= (+ (select |v_#memory_int_52| ULTIMATE.start_main_p2) 1) 0) (= 0 .cse0))) [2019-01-31 15:12:39,517 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2019-01-31 15:12:39,591 INFO L273 TraceCheckUtils]: 0: Hoare triple {1793#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1801#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-31 15:12:39,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {1801#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {1805#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} is VALID [2019-01-31 15:12:39,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {1805#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1809#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-01-31 15:12:39,595 INFO L273 TraceCheckUtils]: 3: Hoare triple {1809#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {1809#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-01-31 15:12:39,599 INFO L273 TraceCheckUtils]: 4: Hoare triple {1809#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {1794#false} is VALID [2019-01-31 15:12:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:39,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:12:39,708 INFO L273 TraceCheckUtils]: 4: Hoare triple {1816#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1794#false} is VALID [2019-01-31 15:12:39,709 INFO L273 TraceCheckUtils]: 3: Hoare triple {1816#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1816#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:39,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {1823#(<= (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]; {1816#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:39,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {1827#(<= (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]; {1823#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:39,713 INFO L273 TraceCheckUtils]: 0: Hoare triple {1793#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1827#(<= (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 [2019-01-31 15:12:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:39,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:12:39,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 15:12:39,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:12:39,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 15:12:39,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:12:39,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-31 15:12:39,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:12:39,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 15:12:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 15:12:39,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 15:12:39,749 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-01-31 15:12:40,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:40,285 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-01-31 15:12:40,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 15:12:40,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 15:12:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:12:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 15:12:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2019-01-31 15:12:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 15:12:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2019-01-31 15:12:40,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2019-01-31 15:12:40,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:12:40,402 INFO L225 Difference]: With dead ends: 45 [2019-01-31 15:12:40,402 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 15:12:40,402 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 [2019-01-31 15:12:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 15:12:40,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-31 15:12:40,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:12:40,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2019-01-31 15:12:40,553 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2019-01-31 15:12:40,553 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2019-01-31 15:12:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:40,555 INFO L93 Difference]: Finished difference Result 44 states and 129 transitions. [2019-01-31 15:12:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 129 transitions. [2019-01-31 15:12:40,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:12:40,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:12:40,556 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2019-01-31 15:12:40,556 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2019-01-31 15:12:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:40,558 INFO L93 Difference]: Finished difference Result 44 states and 129 transitions. [2019-01-31 15:12:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 129 transitions. [2019-01-31 15:12:40,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:12:40,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:12:40,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:12:40,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:12:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-31 15:12:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-01-31 15:12:40,560 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-01-31 15:12:40,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:12:40,560 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-01-31 15:12:40,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 15:12:40,561 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-01-31 15:12:40,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 15:12:40,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:12:40,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 15:12:40,561 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:12:40,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:12:40,562 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-31 15:12:40,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:12:40,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:12:40,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:12:40,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:12:40,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:12:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:40,646 INFO L273 TraceCheckUtils]: 0: Hoare triple {2060#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2062#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2019-01-31 15:12:40,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {2062#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2063#(and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)))} is VALID [2019-01-31 15:12:40,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {2063#(and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2064#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-01-31 15:12:40,649 INFO L273 TraceCheckUtils]: 3: Hoare triple {2064#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {2064#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-01-31 15:12:40,649 INFO L273 TraceCheckUtils]: 4: Hoare triple {2064#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {2061#false} is VALID [2019-01-31 15:12:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:40,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:12:40,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:12:40,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 15:12:40,650 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-31 15:12:40,651 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:12:40,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:12:45,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:12:45,660 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 15:12:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:12:45,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:12:45,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:12:45,660 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 [2019-01-31 15:12:45,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:12:45,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:12:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:45,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:12:45,695 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 [2019-01-31 15:12:45,710 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 [2019-01-31 15:12:45,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:45,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:45,723 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 17 treesize of output 24 [2019-01-31 15:12:45,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:45,745 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:45,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:45,762 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 11 treesize of output 14 [2019-01-31 15:12:45,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:45,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:45,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2019-01-31 15:12:45,784 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:45,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:45,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 15:12:45,802 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-31 15:12:45,807 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:45,807 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_55|, ULTIMATE.start_main_p1, |v_#valid_14|]. (and (= 0 (select (store (store |v_#valid_14| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= (store (store (store |v_#memory_int_55| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|)) [2019-01-31 15:12:45,807 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:12:45,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:45,842 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 [2019-01-31 15:12:45,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:45,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:12:45,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-31 15:12:45,864 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:45,864 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_56|]. (let ((.cse0 (select |v_#memory_int_56| ULTIMATE.start_main_p2))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |v_#memory_int_56| ULTIMATE.start_main_p3) 0) (= .cse0 0) (= (store |v_#memory_int_56| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|))) [2019-01-31 15:12:45,865 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:12:45,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:45,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:45,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:45,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:12:45,903 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 [2019-01-31 15:12:45,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:12:45,913 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. [2019-01-31 15:12:45,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-31 15:12:56,676 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:12:56,676 WARN L398 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)))) [2019-01-31 15:12:56,676 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2019-01-31 15:12:57,156 INFO L273 TraceCheckUtils]: 0: Hoare triple {2060#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2068#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:12:57,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {2068#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2072#(and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:12:57,158 INFO L273 TraceCheckUtils]: 2: Hoare triple {2072#(and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2076#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-01-31 15:12:57,159 INFO L273 TraceCheckUtils]: 3: Hoare triple {2076#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {2076#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-01-31 15:12:57,160 INFO L273 TraceCheckUtils]: 4: Hoare triple {2076#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {2061#false} is VALID [2019-01-31 15:12:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:57,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:12:57,199 INFO L273 TraceCheckUtils]: 4: Hoare triple {2083#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {2061#false} is VALID [2019-01-31 15:12:57,200 INFO L273 TraceCheckUtils]: 3: Hoare triple {2083#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {2083#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:57,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {2090#(<= (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]; {2083#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:57,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {2094#(<= (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]; {2090#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:12:57,204 INFO L273 TraceCheckUtils]: 0: Hoare triple {2060#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2094#(<= (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 [2019-01-31 15:12:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:57,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:12:57,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 15:12:57,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:12:57,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 15:12:57,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:12:57,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-31 15:12:57,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:12:57,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 15:12:57,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 15:12:57,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 15:12:57,237 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-01-31 15:12:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:57,697 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-01-31 15:12:57,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 15:12:57,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 15:12:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:12:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 15:12:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2019-01-31 15:12:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 15:12:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2019-01-31 15:12:57,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2019-01-31 15:12:57,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:12:57,742 INFO L225 Difference]: With dead ends: 52 [2019-01-31 15:12:57,742 INFO L226 Difference]: Without dead ends: 51 [2019-01-31 15:12:57,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 15:12:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-31 15:12:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-31 15:12:57,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:12:57,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 43 states. [2019-01-31 15:12:57,923 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 43 states. [2019-01-31 15:12:57,923 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 43 states. [2019-01-31 15:12:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:57,926 INFO L93 Difference]: Finished difference Result 51 states and 156 transitions. [2019-01-31 15:12:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 156 transitions. [2019-01-31 15:12:57,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:12:57,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:12:57,927 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 51 states. [2019-01-31 15:12:57,927 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 51 states. [2019-01-31 15:12:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:12:57,929 INFO L93 Difference]: Finished difference Result 51 states and 156 transitions. [2019-01-31 15:12:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 156 transitions. [2019-01-31 15:12:57,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:12:57,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:12:57,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:12:57,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:12:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-31 15:12:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-01-31 15:12:57,931 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-01-31 15:12:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:12:57,932 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-01-31 15:12:57,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 15:12:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-01-31 15:12:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 15:12:57,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:12:57,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 15:12:57,933 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:12:57,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:12:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-31 15:12:57,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:12:57,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:12:57,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:12:57,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:12:57,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:12:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:12:58,409 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-31 15:12:58,477 INFO L273 TraceCheckUtils]: 0: Hoare triple {2368#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2370#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2019-01-31 15:12:58,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {2370#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2371#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)))} is VALID [2019-01-31 15:12:58,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {2371#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2372#(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 [2019-01-31 15:12:58,481 INFO L273 TraceCheckUtils]: 3: Hoare triple {2372#(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]; {2373#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:12:58,482 INFO L273 TraceCheckUtils]: 4: Hoare triple {2373#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {2369#false} is VALID [2019-01-31 15:12:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:12:58,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:12:58,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:12:58,483 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 15:12:58,483 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-31 15:12:58,484 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:12:58,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:13:04,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:13:04,943 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 15:13:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:13:04,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:13:04,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:13:04,944 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 [2019-01-31 15:13:04,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:13:04,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:13:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:13:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:13:04,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:13:05,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:05,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 15:13:05,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:05,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:05,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-31 15:13:05,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:05,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:05,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-01-31 15:13:05,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2019-01-31 15:13:05,119 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 [2019-01-31 15:13:05,124 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:05,140 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:05,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:05,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:05,172 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-31 15:13:05,177 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:05,177 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_60|, |v_#valid_15|]. (let ((.cse0 (store |v_#valid_15| ULTIMATE.start_main_p1 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (store (store (store |v_#memory_int_60| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (= 0 (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)))) [2019-01-31 15:13:05,177 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:13:05,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:05,249 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 [2019-01-31 15:13:05,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:05,271 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. [2019-01-31 15:13:05,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 15:13:15,537 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:15,537 WARN L398 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))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_61| ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 .cse0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_61| ULTIMATE.start_main_p2) 0))) [2019-01-31 15:13:15,538 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2019-01-31 15:13:15,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:15,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:15,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:15,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:15,613 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 15:13:15,614 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 [2019-01-31 15:13:15,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:15,630 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. [2019-01-31 15:13:15,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-01-31 15:13:15,646 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:15,646 WARN L398 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) (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_62| ULTIMATE.start_main_p1 (+ .cse0 1))) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_62| ULTIMATE.start_main_p2) 0))) [2019-01-31 15:13:15,646 WARN L399 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)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) [2019-01-31 15:13:15,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:15,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:15,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:15,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:15,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:15,688 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 [2019-01-31 15:13:15,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:15,706 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. [2019-01-31 15:13:15,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-31 15:13:15,741 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:15,742 WARN L398 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|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= .cse0 0))) [2019-01-31 15:13:15,742 WARN L399 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) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) [2019-01-31 15:13:15,762 INFO L273 TraceCheckUtils]: 0: Hoare triple {2368#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2377#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:13:15,764 INFO L273 TraceCheckUtils]: 1: Hoare triple {2377#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2381#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-31 15:13:15,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {2381#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2385#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-31 15:13:15,768 INFO L273 TraceCheckUtils]: 3: Hoare triple {2385#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2389#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} is VALID [2019-01-31 15:13:15,769 INFO L273 TraceCheckUtils]: 4: Hoare triple {2389#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} assume !(#memory_int[main_p1] >= 0); {2369#false} is VALID [2019-01-31 15:13:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:13:15,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:13:15,844 INFO L273 TraceCheckUtils]: 4: Hoare triple {2373#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {2369#false} is VALID [2019-01-31 15:13:15,845 INFO L273 TraceCheckUtils]: 3: Hoare triple {2396#(<= 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]; {2373#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:13:15,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {2400#(<= 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]; {2396#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:13:15,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {2404#(<= 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]; {2400#(<= 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 [2019-01-31 15:13:15,850 INFO L273 TraceCheckUtils]: 0: Hoare triple {2368#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2404#(<= 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 [2019-01-31 15:13:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:13:15,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:13:15,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 15:13:15,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:13:15,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 15:13:15,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:13:15,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-31 15:13:15,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:13:15,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 15:13:15,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 15:13:15,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-31 15:13:15,887 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-01-31 15:13:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:13:16,500 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-01-31 15:13:16,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 15:13:16,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 15:13:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:13:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 15:13:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-01-31 15:13:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 15:13:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-01-31 15:13:16,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2019-01-31 15:13:16,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:13:16,893 INFO L225 Difference]: With dead ends: 49 [2019-01-31 15:13:16,894 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 15:13:16,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-31 15:13:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 15:13:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-01-31 15:13:17,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:13:17,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 23 states. [2019-01-31 15:13:17,073 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 23 states. [2019-01-31 15:13:17,073 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 23 states. [2019-01-31 15:13:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:13:17,075 INFO L93 Difference]: Finished difference Result 48 states and 151 transitions. [2019-01-31 15:13:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 151 transitions. [2019-01-31 15:13:17,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:13:17,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:13:17,075 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 48 states. [2019-01-31 15:13:17,075 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 48 states. [2019-01-31 15:13:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:13:17,077 INFO L93 Difference]: Finished difference Result 48 states and 151 transitions. [2019-01-31 15:13:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 151 transitions. [2019-01-31 15:13:17,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:13:17,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:13:17,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:13:17,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:13:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 15:13:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-31 15:13:17,079 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-31 15:13:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:13:17,079 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-31 15:13:17,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 15:13:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-31 15:13:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 15:13:17,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:13:17,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 15:13:17,080 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:13:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:13:17,081 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-31 15:13:17,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:13:17,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:13:17,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:13:17,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:13:17,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:13:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:13:17,374 INFO L273 TraceCheckUtils]: 0: Hoare triple {2632#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2634#(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)) (or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2019-01-31 15:13:17,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {2634#(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)) (or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2635#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0) (or (<= 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_p1 ULTIMATE.start_main_p3))))} is VALID [2019-01-31 15:13:17,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0) (or (<= 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_p1 ULTIMATE.start_main_p3))))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2636#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (or (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-01-31 15:13:17,378 INFO L273 TraceCheckUtils]: 3: Hoare triple {2636#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (or (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume #memory_int[main_p1] >= 0; {2637#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-01-31 15:13:17,379 INFO L273 TraceCheckUtils]: 4: Hoare triple {2637#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume #memory_int[main_p2] <= 0; {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:13:17,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume !(#memory_int[main_p3] >= 0); {2633#false} is VALID [2019-01-31 15:13:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:13:17,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:13:17,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:13:17,381 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 15:13:17,381 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-31 15:13:17,384 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:13:17,385 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:13:21,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:13:21,882 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 15:13:21,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:13:21,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:13:21,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:13:21,882 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 [2019-01-31 15:13:21,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:13:21,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:13:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:13:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:13:21,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:13:21,923 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 [2019-01-31 15:13:21,931 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 [2019-01-31 15:13:21,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:21,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:21,943 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 17 treesize of output 24 [2019-01-31 15:13:21,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:21,963 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:21,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:21,980 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 11 treesize of output 14 [2019-01-31 15:13:21,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:21,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:21,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2019-01-31 15:13:22,000 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:22,006 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:22,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:22,017 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-01-31 15:13:22,021 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:22,021 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_67|, |v_#valid_16|]. (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|) (= (select (store (store |v_#valid_16| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0)) [2019-01-31 15:13:22,022 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:13:22,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:22,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-31 15:13:22,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 15:13:22,106 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 2 xjuncts. [2019-01-31 15:13:22,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-31 15:13:22,140 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:22,140 WARN L398 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|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |v_#memory_int_68| ULTIMATE.start_main_p3) 0) (= .cse0 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) [2019-01-31 15:13:22,140 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse1 (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (or (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 .cse0) .cse1) (and (= 1 .cse0) .cse1))) [2019-01-31 15:13:22,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:22,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:22,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:22,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:22,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:22,199 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 30 treesize of output 40 [2019-01-31 15:13:22,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:22,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:22,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:22,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:22,233 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 15:13:22,235 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 [2019-01-31 15:13:22,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:22,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-31 15:13:22,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-31 15:13:33,385 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:33,385 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_1, v_prenex_2, ULTIMATE.start_main_p1, |v_#memory_int_69|, ULTIMATE.start_main_p2]. (or (let ((.cse0 (select |v_#memory_int_69| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_69| ULTIMATE.start_main_p3) 0) (= (store |v_#memory_int_69| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= .cse0 1))) (let ((.cse1 (select v_prenex_1 v_prenex_2))) (and (not (= ULTIMATE.start_main_p3 v_prenex_2)) (= .cse1 0) (= (store v_prenex_1 v_prenex_2 (+ .cse1 (- 1))) |#memory_int|) (= (select v_prenex_1 ULTIMATE.start_main_p3) 0) (= (select v_prenex_1 ULTIMATE.start_main_p1) 1)))) [2019-01-31 15:13:33,385 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, v_prenex_2, ULTIMATE.start_main_p2]. (let ((.cse0 (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (or (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) .cse0 (= (select |#memory_int| v_prenex_2) (- 1))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) .cse0))) [2019-01-31 15:13:33,694 INFO L273 TraceCheckUtils]: 0: Hoare triple {2632#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2642#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:13:33,695 INFO L273 TraceCheckUtils]: 1: Hoare triple {2642#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2646#(or (and (= 1 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-01-31 15:13:33,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {2646#(or (and (= 1 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-01-31 15:13:33,697 INFO L273 TraceCheckUtils]: 3: Hoare triple {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume #memory_int[main_p1] >= 0; {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-01-31 15:13:33,698 INFO L273 TraceCheckUtils]: 4: Hoare triple {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume #memory_int[main_p2] <= 0; {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-01-31 15:13:33,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume !(#memory_int[main_p3] >= 0); {2633#false} is VALID [2019-01-31 15:13:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:13:33,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:13:33,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume !(#memory_int[main_p3] >= 0); {2633#false} is VALID [2019-01-31 15:13:33,783 INFO L273 TraceCheckUtils]: 4: Hoare triple {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p2] <= 0; {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:13:33,783 INFO L273 TraceCheckUtils]: 3: Hoare triple {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p1] >= 0; {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:13:33,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {2669#(or (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= 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]; {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:13:33,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {2673#(or (<= 1 (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)) (= 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]; {2669#(or (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)))} is VALID [2019-01-31 15:13:33,788 INFO L273 TraceCheckUtils]: 0: Hoare triple {2632#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2673#(or (<= 1 (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)) (= 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 [2019-01-31 15:13:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:13:33,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:13:33,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-31 15:13:33,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:13:33,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 15:13:33,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:13:33,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-31 15:13:33,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:13:33,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 15:13:33,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 15:13:33,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-31 15:13:33,828 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-01-31 15:13:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:13:34,586 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-01-31 15:13:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 15:13:34,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 15:13:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:13:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 15:13:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-01-31 15:13:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 15:13:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-01-31 15:13:34,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2019-01-31 15:13:34,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:13:34,892 INFO L225 Difference]: With dead ends: 28 [2019-01-31 15:13:34,892 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 15:13:34,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-31 15:13:34,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 15:13:35,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-31 15:13:35,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:13:35,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2019-01-31 15:13:35,085 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2019-01-31 15:13:35,086 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2019-01-31 15:13:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:13:35,087 INFO L93 Difference]: Finished difference Result 21 states and 58 transitions. [2019-01-31 15:13:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 58 transitions. [2019-01-31 15:13:35,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:13:35,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:13:35,087 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2019-01-31 15:13:35,088 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2019-01-31 15:13:35,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:13:35,088 INFO L93 Difference]: Finished difference Result 21 states and 58 transitions. [2019-01-31 15:13:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 58 transitions. [2019-01-31 15:13:35,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:13:35,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:13:35,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:13:35,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:13:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 15:13:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-01-31 15:13:35,090 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-01-31 15:13:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:13:35,090 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-01-31 15:13:35,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 15:13:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-01-31 15:13:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 15:13:35,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:13:35,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 15:13:35,091 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:13:35,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:13:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-31 15:13:35,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:13:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:13:35,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:13:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:13:35,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:13:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:13:35,203 INFO L273 TraceCheckUtils]: 0: Hoare triple {2807#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2809#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (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 [2019-01-31 15:13:35,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {2809#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (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]; {2809#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (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 [2019-01-31 15:13:35,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {2809#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (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]; {2810#(and (not (= ULTIMATE.start_main_p1 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) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)))} is VALID [2019-01-31 15:13:35,207 INFO L273 TraceCheckUtils]: 3: Hoare triple {2810#(and (not (= ULTIMATE.start_main_p1 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) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2811#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-01-31 15:13:35,208 INFO L273 TraceCheckUtils]: 4: Hoare triple {2811#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {2812#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-01-31 15:13:35,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {2812#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {2808#false} is VALID [2019-01-31 15:13:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 15:13:35,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:13:35,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:13:35,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 15:13:35,210 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-31 15:13:35,211 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:13:35,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:13:42,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 15:13:42,295 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 15:13:42,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:13:42,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 15:13:42,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:13:42,296 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 [2019-01-31 15:13:42,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:13:42,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 15:13:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:13:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:13:42,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 15:13:42,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-31 15:13:42,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 16 treesize of output 13 [2019-01-31 15:13:42,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:42,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:42,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2019-01-31 15:13:42,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2019-01-31 15:13:42,436 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 [2019-01-31 15:13:42,438 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:42,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:42,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:42,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 15:13:42,469 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-31 15:13:42,474 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:42,474 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_72|, |v_#valid_17|]. (let ((.cse0 (store |v_#valid_17| ULTIMATE.start_main_p1 1))) (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)) (= 0 (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= 0 (select .cse0 ULTIMATE.start_main_p2)))) [2019-01-31 15:13:42,474 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:13:42,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,517 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 [2019-01-31 15:13:42,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:42,532 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. [2019-01-31 15:13:42,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-31 15:13:42,549 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:42,549 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_73|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_73| ULTIMATE.start_main_p1))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (store |v_#memory_int_73| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse0 0) (= (select |v_#memory_int_73| ULTIMATE.start_main_p2) 0) (= 0 (select |v_#memory_int_73| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) [2019-01-31 15:13:42,549 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-31 15:13:42,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,589 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 [2019-01-31 15:13:42,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:42,606 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. [2019-01-31 15:13:42,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-01-31 15:13:42,621 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:42,622 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_74|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_74| ULTIMATE.start_main_p2))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (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))) [2019-01-31 15:13:42,622 WARN L399 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)) [2019-01-31 15:13:42,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,663 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 15:13:42,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 15:13:42,665 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 [2019-01-31 15:13:42,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 15:13:42,687 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. [2019-01-31 15:13:42,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-31 15:13:53,092 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 15:13:53,092 WARN L398 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)))) [2019-01-31 15:13:53,093 WARN L399 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) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2019-01-31 15:13:53,312 INFO L273 TraceCheckUtils]: 0: Hoare triple {2807#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2816#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:13:53,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {2816#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2820#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:13:53,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {2820#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2824#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-01-31 15:13:53,317 INFO L273 TraceCheckUtils]: 3: Hoare triple {2824#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2828#(and (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} is VALID [2019-01-31 15:13:53,318 INFO L273 TraceCheckUtils]: 4: Hoare triple {2828#(and (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} assume #memory_int[main_p1] >= 0; {2828#(and (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} is VALID [2019-01-31 15:13:53,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {2828#(and (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} assume !(#memory_int[main_p2] <= 0); {2808#false} is VALID [2019-01-31 15:13:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:13:53,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 15:13:53,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {2808#false} is VALID [2019-01-31 15:13:53,388 INFO L273 TraceCheckUtils]: 4: Hoare triple {2835#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {2835#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:13:53,389 INFO L273 TraceCheckUtils]: 3: Hoare triple {2842#(<= (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]; {2835#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:13:53,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {2846#(<= (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]; {2842#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-01-31 15:13:53,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {2850#(<= (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]; {2846#(<= (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 [2019-01-31 15:13:53,394 INFO L273 TraceCheckUtils]: 0: Hoare triple {2807#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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2850#(<= (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 [2019-01-31 15:13:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:13:53,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 15:13:53,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 15:13:53,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 15:13:53,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 15:13:53,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:13:53,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-31 15:13:53,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:13:53,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 15:13:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 15:13:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 15:13:53,434 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-01-31 15:13:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:13:54,190 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-01-31 15:13:54,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 15:13:54,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 15:13:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:13:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 15:13:54,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2019-01-31 15:13:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 15:13:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2019-01-31 15:13:54,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2019-01-31 15:13:54,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:13:54,374 INFO L225 Difference]: With dead ends: 22 [2019-01-31 15:13:54,374 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 15:13:54,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-31 15:13:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 15:13:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 15:13:54,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:13:54,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 15:13:54,376 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:13:54,376 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:13:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:13:54,377 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:13:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:13:54,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:13:54,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:13:54,378 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:13:54,378 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:13:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:13:54,378 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:13:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:13:54,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:13:54,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:13:54,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:13:54,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:13:54,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 15:13:54,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 15:13:54,379 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-31 15:13:54,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:13:54,379 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 15:13:54,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 15:13:54,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:13:54,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:13:54,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 15:13:54,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 15:13:54,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 15:13:54,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 15:13:54,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 15:13:54,537 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-01-31 15:13:56,370 WARN L181 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-01-31 15:13:56,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 15:13:56,377 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 15:13:56,377 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (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)) .cse2) .cse1)))) [2019-01-31 15:13:56,378 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-01-31 15:13:56,378 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-01-31 15:13:56,378 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-01-31 15:13:56,378 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-01-31 15:13:56,378 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-31 15:13:56,378 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-31 15:13:56,380 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-31 15:13:56,380 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-31 15:13:56,380 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2019-01-31 15:13:56,388 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2019-01-31 15:13:56,388 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2019-01-31 15:13:56,388 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2019-01-31 15:13:56,388 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2019-01-31 15:13:56,388 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-01-31 15:13:56,388 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. [2019-01-31 15:13:56,395 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 03:13:56 BoogieIcfgContainer [2019-01-31 15:13:56,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 15:13:56,396 INFO L168 Benchmark]: Toolchain (without parser) took 204322.73 ms. Allocated memory was 139.5 MB in the beginning and 520.1 MB in the end (delta: 380.6 MB). Free memory was 105.8 MB in the beginning and 70.5 MB in the end (delta: 35.3 MB). Peak memory consumption was 415.9 MB. Max. memory is 7.1 GB. [2019-01-31 15:13:56,397 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:13:56,397 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.25 ms. Allocated memory is still 139.5 MB. Free memory was 105.5 MB in the beginning and 103.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-31 15:13:56,397 INFO L168 Benchmark]: Boogie Preprocessor took 31.40 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 102.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-01-31 15:13:56,398 INFO L168 Benchmark]: RCFGBuilder took 555.86 ms. Allocated memory is still 139.5 MB. Free memory was 102.0 MB in the beginning and 89.3 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-01-31 15:13:56,398 INFO L168 Benchmark]: TraceAbstraction took 203673.55 ms. Allocated memory was 139.5 MB in the beginning and 520.1 MB in the end (delta: 380.6 MB). Free memory was 89.1 MB in the beginning and 70.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 399.3 MB. Max. memory is 7.1 GB. [2019-01-31 15:13:56,400 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 139.5 MB. Free memory is still 107.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.25 ms. Allocated memory is still 139.5 MB. Free memory was 105.5 MB in the beginning and 103.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.40 ms. Allocated memory is still 139.5 MB. Free memory was 103.2 MB in the beginning and 102.0 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 555.86 ms. Allocated memory is still 139.5 MB. Free memory was 102.0 MB in the beginning and 89.3 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 203673.55 ms. Allocated memory was 139.5 MB in the beginning and 520.1 MB in the end (delta: 380.6 MB). Free memory was 89.1 MB in the beginning and 70.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 399.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 37]: 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: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 203.5s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 8.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 129 SDslu, 1 SDs, 0 SdLazy, 950 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 94.3s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 96.1s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...