java -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-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:25:25,857 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:25:25,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:25:25,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:25:25,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:25:25,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:25:25,874 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:25:25,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:25:25,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:25:25,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:25:25,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:25:25,880 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:25:25,881 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:25:25,882 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:25:25,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:25:25,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:25:25,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:25:25,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:25:25,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:25:25,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:25:25,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:25:25,893 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:25:25,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:25:25,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:25:25,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:25:25,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:25:25,898 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:25:25,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:25:25,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:25:25,901 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:25:25,901 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:25:25,902 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:25:25,902 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:25:25,902 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:25:25,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:25:25,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:25:25,904 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-15 11:25:25,928 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:25:25,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:25:25,930 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:25:25,930 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:25:25,930 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:25:25,930 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:25:25,930 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:25:25,931 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:25:25,931 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:25:25,931 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:25:25,932 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:25:25,932 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:25:25,932 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:25:25,933 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:25:25,933 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:25:25,933 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:25:25,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:25:25,933 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:25:25,934 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:25:25,935 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:25:25,935 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:25:25,935 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:25:25,936 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:25:25,936 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:25:25,936 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:25:25,936 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:25:25,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:25:25,937 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:25:25,937 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:25:25,937 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:25:25,937 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:25:25,937 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:25:25,938 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:25:25,938 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:25:25,938 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:25:25,938 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:25:25,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:25:25,938 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:25:25,939 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:25:25,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:25:25,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:25:25,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:25:25,997 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:25:25,997 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:25:25,998 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-02-15 11:25:25,998 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-02-15 11:25:26,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:25:26,043 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:25:26,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:25:26,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:25:26,045 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:25:26,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... [2019-02-15 11:25:26,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... [2019-02-15 11:25:26,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:25:26,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:25:26,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:25:26,106 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:25:26,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... [2019-02-15 11:25:26,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... [2019-02-15 11:25:26,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... [2019-02-15 11:25:26,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... [2019-02-15 11:25:26,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... [2019-02-15 11:25:26,127 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... [2019-02-15 11:25:26,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... [2019-02-15 11:25:26,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:25:26,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:25:26,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:25:26,131 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:25:26,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:25:26,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:25:26,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:25:26,675 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:25:26,675 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-02-15 11:25:26,677 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:25:26 BoogieIcfgContainer [2019-02-15 11:25:26,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:25:26,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:25:26,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:25:26,683 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:25:26,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:25:26" (1/2) ... [2019-02-15 11:25:26,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54046f38 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:25:26, skipping insertion in model container [2019-02-15 11:25:26,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:25:26" (2/2) ... [2019-02-15 11:25:26,694 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-02-15 11:25:26,714 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:25:26,731 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-02-15 11:25:26,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-02-15 11:25:26,809 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:25:26,810 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:25:26,810 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:25:26,810 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:25:26,810 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:25:26,811 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:25:26,811 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:25:26,811 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:25:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-02-15 11:25:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 11:25:26,846 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:26,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 11:25:26,853 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:26,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-02-15 11:25:26,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:26,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:26,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:26,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:26,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:27,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:25:27,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:25:27,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:27,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:25:27,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:25:27,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:25:27,065 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-02-15 11:25:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:25:27,288 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-02-15 11:25:27,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:25:27,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 11:25:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:25:27,306 INFO L225 Difference]: With dead ends: 29 [2019-02-15 11:25:27,306 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 11:25:27,310 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-02-15 11:25:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 11:25:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-02-15 11:25:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 11:25:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-02-15 11:25:27,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-02-15 11:25:27,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:25:27,351 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-02-15 11:25:27,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:25:27,351 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-02-15 11:25:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:25:27,352 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:25:27,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:25:27,353 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:25:27,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-02-15 11:25:27,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:25:27,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:27,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:25:27,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:25:27,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:25:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:25:27,643 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-15 11:25:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:25:27,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:25:27,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:25:27,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:25:27,660 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-02-15 11:25:27,714 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:25:27,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:25:40,191 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:25:40,193 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:25:40,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:25:40,198 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:25:40,888 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:25:43,273 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_48 Int) (v_idx_56 Int) (v_idx_46 Int) (v_idx_43 Int) (v_idx_54 Int) (v_idx_52 Int) (v_idx_50 Int) (v_idx_40 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 5)) (.cse8 (+ c_ULTIMATE.start_main_p2 4)) (.cse1 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse9 (+ c_ULTIMATE.start_main_p2 1)) (.cse4 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse7 (+ c_ULTIMATE.start_main_p3 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse5 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse1 c_ULTIMATE.start_main_p6) (or (< v_idx_52 c_ULTIMATE.start_main_p4) (let ((.cse2 (select |c_#memory_int| v_idx_52))) (and (<= (* 2 .cse2) 0) (<= .cse2 0))) (<= .cse3 v_idx_52)) (or (<= .cse4 v_idx_43) (= 1 (select |c_#valid| v_idx_43)) (< v_idx_43 c_ULTIMATE.start_main_p6)) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_54 c_ULTIMATE.start_main_p5) (<= .cse0 v_idx_54) (= 0 (select |c_#memory_int| v_idx_54))) (<= .cse3 c_ULTIMATE.start_main_p5) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (= 0 (select |c_#memory_int| v_idx_50)) (<= .cse7 v_idx_50) (< v_idx_50 c_ULTIMATE.start_main_p3)) (<= .cse8 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse8 c_ULTIMATE.start_main_p6) (or (<= .cse9 v_idx_48) (< v_idx_48 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_48))) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (or (<= .cse10 v_idx_46) (< v_idx_46 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_46))) (<= .cse9 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_40) 0) (<= .cse4 v_idx_40) (< v_idx_40 c_ULTIMATE.start_main_p6)) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (or (<= .cse4 v_idx_56) (= 0 (select |c_#memory_int| v_idx_56)) (< v_idx_56 c_ULTIMATE.start_main_p6)) (<= .cse7 c_ULTIMATE.start_main_p4) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse5 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:25:48,103 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_69 Int) (v_idx_59 Int) (v_idx_67 Int) (v_idx_65 Int) (v_idx_75 Int) (v_idx_62 Int) (v_idx_73 Int) (v_idx_71 Int)) (let ((.cse6 (+ c_ULTIMATE.start_main_p4 1)) (.cse4 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 5)) (.cse9 (+ c_ULTIMATE.start_main_p2 4)) (.cse3 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse10 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse5 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_69) 0) (<= .cse1 v_idx_69) (< v_idx_69 c_ULTIMATE.start_main_p3)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (< v_idx_65 c_ULTIMATE.start_main_p1) (<= .cse2 v_idx_65) (= 0 (select |c_#memory_int| v_idx_65))) (<= .cse3 c_ULTIMATE.start_main_p6) (or (<= .cse4 v_idx_62) (< v_idx_62 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_62))) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= .cse6 c_ULTIMATE.start_main_p5) (<= .cse7 c_ULTIMATE.start_malloc_ptr) (or (<= .cse0 v_idx_73) (= (select |c_#memory_int| v_idx_73) 0) (< v_idx_73 c_ULTIMATE.start_main_p5)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_75 c_ULTIMATE.start_main_p6) (= (select |c_#memory_int| v_idx_75) 0) (<= .cse4 v_idx_75)) (or (< v_idx_71 c_ULTIMATE.start_main_p4) (<= .cse6 v_idx_71) (let ((.cse8 (select |c_#memory_int| v_idx_71))) (and (<= .cse8 0) (<= (* 2 .cse8) 0)))) (<= .cse9 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_59 c_ULTIMATE.start_main_p6) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_59)) (<= .cse4 v_idx_59)) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse7 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse9 c_ULTIMATE.start_main_p6) (or (<= .cse10 v_idx_67) (= 0 (select |c_#memory_int| v_idx_67)) (< v_idx_67 c_ULTIMATE.start_main_p2)) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse10 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse1 c_ULTIMATE.start_main_p4) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_main_p2) (<= .cse5 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:25:48,146 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:25:48,146 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:25:48,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:25:48,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-15 11:25:48,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:25:48,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:25:48,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:25:48,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-02-15 11:25:48,152 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. [2019-02-15 11:25:50,564 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_69 Int) (v_idx_59 Int) (v_idx_67 Int) (v_idx_65 Int) (v_idx_75 Int) (v_idx_62 Int) (v_idx_73 Int) (v_idx_71 Int)) (let ((.cse6 (+ c_ULTIMATE.start_main_p4 1)) (.cse4 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 5)) (.cse9 (+ c_ULTIMATE.start_main_p2 4)) (.cse3 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse10 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse5 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_69) 0) (<= .cse1 v_idx_69) (< v_idx_69 c_ULTIMATE.start_main_p3)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (< v_idx_65 c_ULTIMATE.start_main_p1) (<= .cse2 v_idx_65) (= 0 (select |c_#memory_int| v_idx_65))) (<= .cse3 c_ULTIMATE.start_main_p6) (or (<= .cse4 v_idx_62) (< v_idx_62 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_62))) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= .cse6 c_ULTIMATE.start_main_p5) (<= .cse7 c_ULTIMATE.start_malloc_ptr) (or (<= .cse0 v_idx_73) (= (select |c_#memory_int| v_idx_73) 0) (< v_idx_73 c_ULTIMATE.start_main_p5)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_75 c_ULTIMATE.start_main_p6) (= (select |c_#memory_int| v_idx_75) 0) (<= .cse4 v_idx_75)) (or (< v_idx_71 c_ULTIMATE.start_main_p4) (<= .cse6 v_idx_71) (let ((.cse8 (select |c_#memory_int| v_idx_71))) (and (<= .cse8 0) (<= (* 2 .cse8) 0)))) (<= .cse9 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_59 c_ULTIMATE.start_main_p6) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_59)) (<= .cse4 v_idx_59)) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse7 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse9 c_ULTIMATE.start_main_p6) (or (<= .cse10 v_idx_67) (= 0 (select |c_#memory_int| v_idx_67)) (< v_idx_67 c_ULTIMATE.start_main_p2)) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse10 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse1 c_ULTIMATE.start_main_p4) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse2 c_ULTIMATE.start_main_p2) (<= .cse5 c_ULTIMATE.start_main_p6)))) (forall ((v_idx_48 Int) (v_idx_56 Int) (v_idx_46 Int) (v_idx_43 Int) (v_idx_54 Int) (v_idx_52 Int) (v_idx_50 Int) (v_idx_40 Int)) (let ((.cse14 (+ c_ULTIMATE.start_main_p4 1)) (.cse17 (+ c_ULTIMATE.start_main_p1 5)) (.cse19 (+ c_ULTIMATE.start_main_p2 4)) (.cse12 (+ c_ULTIMATE.start_main_p3 3)) (.cse11 (+ c_ULTIMATE.start_main_p5 1)) (.cse20 (+ c_ULTIMATE.start_main_p2 1)) (.cse15 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse18 (+ c_ULTIMATE.start_main_p3 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 1)) (.cse16 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse11 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse12 c_ULTIMATE.start_main_p6) (or (< v_idx_52 c_ULTIMATE.start_main_p4) (let ((.cse13 (select |c_#memory_int| v_idx_52))) (and (<= (* 2 .cse13) 0) (<= .cse13 0))) (<= .cse14 v_idx_52)) (or (<= .cse15 v_idx_43) (= 1 (select |c_#valid| v_idx_43)) (< v_idx_43 c_ULTIMATE.start_main_p6)) (<= .cse16 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_54 c_ULTIMATE.start_main_p5) (<= .cse11 v_idx_54) (= 0 (select |c_#memory_int| v_idx_54))) (<= .cse14 c_ULTIMATE.start_main_p5) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (= 0 (select |c_#memory_int| v_idx_50)) (<= .cse18 v_idx_50) (< v_idx_50 c_ULTIMATE.start_main_p3)) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse17 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse19 c_ULTIMATE.start_main_p6) (or (<= .cse20 v_idx_48) (< v_idx_48 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_48))) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= .cse11 c_ULTIMATE.start_main_p6) (or (<= .cse21 v_idx_46) (< v_idx_46 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_46))) (<= .cse20 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_40) 0) (<= .cse15 v_idx_40) (< v_idx_40 c_ULTIMATE.start_main_p6)) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (or (<= .cse15 v_idx_56) (= 0 (select |c_#memory_int| v_idx_56)) (< v_idx_56 c_ULTIMATE.start_main_p6)) (<= .cse18 c_ULTIMATE.start_main_p4) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p2) (<= .cse16 c_ULTIMATE.start_main_p6))))) is different from false [2019-02-15 11:26:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:26,171 INFO L93 Difference]: Finished difference Result 16 states and 33 transitions. [2019-02-15 11:26:26,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:26:26,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:26:26,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:26,172 INFO L225 Difference]: With dead ends: 16 [2019-02-15 11:26:26,172 INFO L226 Difference]: Without dead ends: 15 [2019-02-15 11:26:26,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-02-15 11:26:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-15 11:26:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-15 11:26:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 11:26:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2019-02-15 11:26:26,179 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 32 transitions. Word has length 3 [2019-02-15 11:26:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:26,179 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 32 transitions. [2019-02-15 11:26:26,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:26:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 32 transitions. [2019-02-15 11:26:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:26:26,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:26,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:26:26,181 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:26,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:26,181 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-02-15 11:26:26,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:26,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:26,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:26,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:26,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:26,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:26,240 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:26:26,240 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-02-15 11:26:26,242 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:26,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:37,402 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:26:37,402 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:26:37,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:37,403 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:26:38,373 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:26:40,762 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_126 Int) (v_idx_116 Int) (v_idx_124 Int) (v_idx_119 Int) (v_idx_128 Int) (v_idx_130 Int) (v_idx_122 Int) (v_idx_132 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 5)) (.cse9 (+ c_ULTIMATE.start_main_p2 4)) (.cse1 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse5 (+ c_ULTIMATE.start_main_p2 1)) (.cse10 (+ c_ULTIMATE.start_main_p3 1)) (.cse6 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (< v_idx_130 c_ULTIMATE.start_main_p5) (= (select |c_#memory_int| v_idx_130) 0) (<= .cse0 v_idx_130)) (<= .cse1 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_124 c_ULTIMATE.start_main_p2) (<= .cse5 v_idx_124) (= (select |c_#memory_int| v_idx_124) 0)) (or (<= .cse6 v_idx_119) (< v_idx_119 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_119))) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_128 c_ULTIMATE.start_main_p4) (<= .cse3 v_idx_128) (= (select |c_#memory_int| v_idx_128) 0)) (or (<= .cse7 v_idx_122) (< v_idx_122 c_ULTIMATE.start_main_p1) (let ((.cse8 (select |c_#memory_int| v_idx_122))) (and (<= 0 (* 2 .cse8)) (<= 0 .cse8)))) (<= .cse9 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse9 c_ULTIMATE.start_main_p6) (or (= 0 (select |c_#memory_int| v_idx_126)) (<= .cse10 v_idx_126) (< v_idx_126 c_ULTIMATE.start_main_p3)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse5 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse10 c_ULTIMATE.start_main_p4) (or (< v_idx_132 c_ULTIMATE.start_main_p6) (<= .cse6 v_idx_132) (= (select |c_#memory_int| v_idx_132) 0)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_116)) (< v_idx_116 c_ULTIMATE.start_main_p6) (<= .cse6 v_idx_116)) (<= .cse7 c_ULTIMATE.start_main_p2) (<= .cse2 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:26:43,234 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_149 Int) (v_idx_138 Int) (v_idx_135 Int) (v_idx_147 Int) (v_idx_151 Int) (v_idx_141 Int) (v_idx_145 Int) (v_idx_143 Int)) (let ((.cse5 (+ c_ULTIMATE.start_main_p1 5)) (.cse6 (+ c_ULTIMATE.start_main_p2 4)) (.cse4 (+ c_ULTIMATE.start_main_p4 1)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse10 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse7 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse9 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (= 0 (select |c_#memory_int| v_idx_145)) (<= .cse1 v_idx_145) (< v_idx_145 c_ULTIMATE.start_main_p3)) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse4 c_ULTIMATE.start_main_p5) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (or (<= .cse0 v_idx_149) (= (select |c_#memory_int| v_idx_149) 0) (< v_idx_149 c_ULTIMATE.start_main_p5)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (or (< v_idx_135 c_ULTIMATE.start_main_p6) (<= .cse7 v_idx_135) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_135))) (<= .cse5 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (let ((.cse8 (select |c_#memory_int| v_idx_141))) (and (<= 0 .cse8) (<= 0 (* 2 .cse8)))) (<= .cse9 v_idx_141) (< v_idx_141 c_ULTIMATE.start_main_p1)) (<= .cse6 c_ULTIMATE.start_main_p6) (or (<= .cse7 v_idx_138) (= 1 (select |c_#valid| v_idx_138)) (< v_idx_138 c_ULTIMATE.start_main_p6)) (or (< v_idx_143 c_ULTIMATE.start_main_p2) (<= .cse10 v_idx_143) (= (select |c_#memory_int| v_idx_143) 0)) (or (= (select |c_#memory_int| v_idx_147) 0) (< v_idx_147 c_ULTIMATE.start_main_p4) (<= .cse4 v_idx_147)) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse10 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse1 c_ULTIMATE.start_main_p4) (or (< v_idx_151 c_ULTIMATE.start_main_p6) (<= .cse7 v_idx_151) (= 0 (select |c_#memory_int| v_idx_151))) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse9 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:26:43,283 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:26:43,283 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:26:43,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:26:43,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-15 11:26:43,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:43,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:26:43,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:26:43,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-02-15 11:26:43,285 INFO L87 Difference]: Start difference. First operand 15 states and 32 transitions. Second operand 4 states. [2019-02-15 11:26:45,796 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_126 Int) (v_idx_116 Int) (v_idx_124 Int) (v_idx_119 Int) (v_idx_128 Int) (v_idx_130 Int) (v_idx_122 Int) (v_idx_132 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 5)) (.cse9 (+ c_ULTIMATE.start_main_p2 4)) (.cse1 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse5 (+ c_ULTIMATE.start_main_p2 1)) (.cse10 (+ c_ULTIMATE.start_main_p3 1)) (.cse6 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (< v_idx_130 c_ULTIMATE.start_main_p5) (= (select |c_#memory_int| v_idx_130) 0) (<= .cse0 v_idx_130)) (<= .cse1 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_124 c_ULTIMATE.start_main_p2) (<= .cse5 v_idx_124) (= (select |c_#memory_int| v_idx_124) 0)) (or (<= .cse6 v_idx_119) (< v_idx_119 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_119))) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_128 c_ULTIMATE.start_main_p4) (<= .cse3 v_idx_128) (= (select |c_#memory_int| v_idx_128) 0)) (or (<= .cse7 v_idx_122) (< v_idx_122 c_ULTIMATE.start_main_p1) (let ((.cse8 (select |c_#memory_int| v_idx_122))) (and (<= 0 (* 2 .cse8)) (<= 0 .cse8)))) (<= .cse9 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse9 c_ULTIMATE.start_main_p6) (or (= 0 (select |c_#memory_int| v_idx_126)) (<= .cse10 v_idx_126) (< v_idx_126 c_ULTIMATE.start_main_p3)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse5 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse10 c_ULTIMATE.start_main_p4) (or (< v_idx_132 c_ULTIMATE.start_main_p6) (<= .cse6 v_idx_132) (= (select |c_#memory_int| v_idx_132) 0)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_116)) (< v_idx_116 c_ULTIMATE.start_main_p6) (<= .cse6 v_idx_116)) (<= .cse7 c_ULTIMATE.start_main_p2) (<= .cse2 c_ULTIMATE.start_main_p6)))) (forall ((v_idx_149 Int) (v_idx_138 Int) (v_idx_135 Int) (v_idx_147 Int) (v_idx_151 Int) (v_idx_141 Int) (v_idx_145 Int) (v_idx_143 Int)) (let ((.cse16 (+ c_ULTIMATE.start_main_p1 5)) (.cse17 (+ c_ULTIMATE.start_main_p2 4)) (.cse15 (+ c_ULTIMATE.start_main_p4 1)) (.cse13 (+ c_ULTIMATE.start_main_p3 3)) (.cse11 (+ c_ULTIMATE.start_main_p5 1)) (.cse21 (+ c_ULTIMATE.start_main_p2 1)) (.cse12 (+ c_ULTIMATE.start_main_p3 1)) (.cse18 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse20 (+ c_ULTIMATE.start_main_p1 1)) (.cse14 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse11 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (= 0 (select |c_#memory_int| v_idx_145)) (<= .cse12 v_idx_145) (< v_idx_145 c_ULTIMATE.start_main_p3)) (<= .cse13 c_ULTIMATE.start_main_p6) (<= .cse14 c_ULTIMATE.start_malloc_ptr) (<= .cse15 c_ULTIMATE.start_main_p5) (<= .cse16 c_ULTIMATE.start_malloc_ptr) (or (<= .cse11 v_idx_149) (= (select |c_#memory_int| v_idx_149) 0) (< v_idx_149 c_ULTIMATE.start_main_p5)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (or (< v_idx_135 c_ULTIMATE.start_main_p6) (<= .cse18 v_idx_135) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_135))) (<= .cse16 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (let ((.cse19 (select |c_#memory_int| v_idx_141))) (and (<= 0 .cse19) (<= 0 (* 2 .cse19)))) (<= .cse20 v_idx_141) (< v_idx_141 c_ULTIMATE.start_main_p1)) (<= .cse17 c_ULTIMATE.start_main_p6) (or (<= .cse18 v_idx_138) (= 1 (select |c_#valid| v_idx_138)) (< v_idx_138 c_ULTIMATE.start_main_p6)) (or (< v_idx_143 c_ULTIMATE.start_main_p2) (<= .cse21 v_idx_143) (= (select |c_#memory_int| v_idx_143) 0)) (or (= (select |c_#memory_int| v_idx_147) 0) (< v_idx_147 c_ULTIMATE.start_main_p4) (<= .cse15 v_idx_147)) (<= .cse13 c_ULTIMATE.start_malloc_ptr) (<= .cse11 c_ULTIMATE.start_main_p6) (<= .cse21 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse12 c_ULTIMATE.start_main_p4) (or (< v_idx_151 c_ULTIMATE.start_main_p6) (<= .cse18 v_idx_151) (= 0 (select |c_#memory_int| v_idx_151))) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse20 c_ULTIMATE.start_main_p2) (<= .cse14 c_ULTIMATE.start_main_p6))))) is different from false [2019-02-15 11:27:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:04,673 INFO L93 Difference]: Finished difference Result 17 states and 40 transitions. [2019-02-15 11:27:04,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:27:04,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:27:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:04,674 INFO L225 Difference]: With dead ends: 17 [2019-02-15 11:27:04,674 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 11:27:04,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-02-15 11:27:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 11:27:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-02-15 11:27:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 11:27:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2019-02-15 11:27:04,682 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 32 transitions. Word has length 3 [2019-02-15 11:27:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:04,682 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 32 transitions. [2019-02-15 11:27:04,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:27:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 32 transitions. [2019-02-15 11:27:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:27:04,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:04,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:27:04,683 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash 30500, now seen corresponding path program 1 times [2019-02-15 11:27:04,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:04,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:04,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:04,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:04,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:04,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:04,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:04,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:27:04,849 INFO L207 CegarAbsIntRunner]: [0], [22], [27] [2019-02-15 11:27:04,851 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:04,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:14,809 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:27:14,810 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:27:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:14,810 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:27:15,174 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:27:17,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_204 Int) (v_idx_202 Int) (v_idx_192 Int) (v_idx_208 Int) (v_idx_206 Int) (v_idx_195 Int) (v_idx_200 Int) (v_idx_198 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p1 5)) (.cse6 (+ c_ULTIMATE.start_main_p2 4)) (.cse1 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse8 (+ c_ULTIMATE.start_main_p2 1)) (.cse7 (+ c_ULTIMATE.start_main_p3 1)) (.cse5 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse9 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse1 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (<= .cse5 v_idx_192) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_192)) (< v_idx_192 c_ULTIMATE.start_main_p6)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (= 0 (select |c_#memory_int| v_idx_208)) (< v_idx_208 c_ULTIMATE.start_main_p6) (<= .cse5 v_idx_208)) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_202)) (<= .cse7 v_idx_202) (< v_idx_202 c_ULTIMATE.start_main_p3)) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_200 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_200)) (<= .cse8 v_idx_200)) (<= .cse6 c_ULTIMATE.start_main_p6) (or (< v_idx_198 c_ULTIMATE.start_main_p1) (<= .cse9 v_idx_198) (= 0 (select |c_#memory_int| v_idx_198))) (or (<= .cse0 v_idx_206) (let ((.cse10 (select |c_#memory_int| v_idx_206))) (and (<= 0 .cse10) (<= 0 (* 2 .cse10)))) (< v_idx_206 c_ULTIMATE.start_main_p5)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse8 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse7 c_ULTIMATE.start_main_p4) (or (= 1 (select |c_#valid| v_idx_195)) (< v_idx_195 c_ULTIMATE.start_main_p6) (<= .cse5 v_idx_195)) (or (<= .cse3 v_idx_204) (< v_idx_204 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_204) 0)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse9 c_ULTIMATE.start_main_p2) (<= .cse2 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:27:20,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_225 Int) (v_idx_214 Int) (v_idx_223 Int) (v_idx_219 Int) (v_idx_227 Int) (v_idx_217 Int) (v_idx_221 Int) (v_idx_211 Int)) (let ((.cse6 (+ c_ULTIMATE.start_main_p1 5)) (.cse5 (+ c_ULTIMATE.start_main_p4 1)) (.cse10 (+ c_ULTIMATE.start_main_p2 4)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse1 (+ c_ULTIMATE.start_main_p5 1)) (.cse4 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse8 (+ c_ULTIMATE.start_main_p2 1)) (.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse9 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (or (<= .cse0 v_idx_221) (= 0 (select |c_#memory_int| v_idx_221)) (< v_idx_221 c_ULTIMATE.start_main_p3)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (<= .cse4 v_idx_211) (< v_idx_211 c_ULTIMATE.start_main_p6) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_211) 0)) (<= .cse5 c_ULTIMATE.start_main_p5) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (or (<= .cse1 v_idx_225) (< v_idx_225 c_ULTIMATE.start_main_p5) (let ((.cse7 (select |c_#memory_int| v_idx_225))) (and (<= 0 (* 2 .cse7)) (<= 0 .cse7)))) (or (< v_idx_219 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_219)) (<= .cse8 v_idx_219)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (= 0 (select |c_#memory_int| v_idx_217)) (<= .cse9 v_idx_217) (< v_idx_217 c_ULTIMATE.start_main_p1)) (<= .cse10 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p6) (or (< v_idx_214 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_214)) (<= .cse4 v_idx_214)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_223 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_223) 0) (<= .cse5 v_idx_223)) (<= .cse10 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p6) (or (<= .cse4 v_idx_227) (= (select |c_#memory_int| v_idx_227) 0) (< v_idx_227 c_ULTIMATE.start_main_p6)) (<= .cse8 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse0 c_ULTIMATE.start_main_p4) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse9 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:27:20,059 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:27:20,059 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:27:20,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:27:20,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-15 11:27:20,059 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:27:20,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:27:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:27:20,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-02-15 11:27:20,060 INFO L87 Difference]: Start difference. First operand 15 states and 32 transitions. Second operand 4 states. [2019-02-15 11:27:22,455 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_225 Int) (v_idx_214 Int) (v_idx_223 Int) (v_idx_219 Int) (v_idx_227 Int) (v_idx_217 Int) (v_idx_221 Int) (v_idx_211 Int)) (let ((.cse6 (+ c_ULTIMATE.start_main_p1 5)) (.cse5 (+ c_ULTIMATE.start_main_p4 1)) (.cse10 (+ c_ULTIMATE.start_main_p2 4)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse1 (+ c_ULTIMATE.start_main_p5 1)) (.cse4 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse8 (+ c_ULTIMATE.start_main_p2 1)) (.cse0 (+ c_ULTIMATE.start_main_p3 1)) (.cse9 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (or (<= .cse0 v_idx_221) (= 0 (select |c_#memory_int| v_idx_221)) (< v_idx_221 c_ULTIMATE.start_main_p3)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (<= .cse4 v_idx_211) (< v_idx_211 c_ULTIMATE.start_main_p6) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_211) 0)) (<= .cse5 c_ULTIMATE.start_main_p5) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (or (<= .cse1 v_idx_225) (< v_idx_225 c_ULTIMATE.start_main_p5) (let ((.cse7 (select |c_#memory_int| v_idx_225))) (and (<= 0 (* 2 .cse7)) (<= 0 .cse7)))) (or (< v_idx_219 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_219)) (<= .cse8 v_idx_219)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (= 0 (select |c_#memory_int| v_idx_217)) (<= .cse9 v_idx_217) (< v_idx_217 c_ULTIMATE.start_main_p1)) (<= .cse10 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p6) (or (< v_idx_214 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_214)) (<= .cse4 v_idx_214)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_223 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_223) 0) (<= .cse5 v_idx_223)) (<= .cse10 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p6) (or (<= .cse4 v_idx_227) (= (select |c_#memory_int| v_idx_227) 0) (< v_idx_227 c_ULTIMATE.start_main_p6)) (<= .cse8 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse0 c_ULTIMATE.start_main_p4) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse9 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) (forall ((v_idx_204 Int) (v_idx_202 Int) (v_idx_192 Int) (v_idx_208 Int) (v_idx_206 Int) (v_idx_195 Int) (v_idx_200 Int) (v_idx_198 Int)) (let ((.cse15 (+ c_ULTIMATE.start_main_p1 5)) (.cse17 (+ c_ULTIMATE.start_main_p2 4)) (.cse12 (+ c_ULTIMATE.start_main_p3 3)) (.cse11 (+ c_ULTIMATE.start_main_p5 1)) (.cse19 (+ c_ULTIMATE.start_main_p2 1)) (.cse18 (+ c_ULTIMATE.start_main_p3 1)) (.cse16 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse14 (+ c_ULTIMATE.start_main_p4 1)) (.cse20 (+ c_ULTIMATE.start_main_p1 1)) (.cse13 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse11 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse12 c_ULTIMATE.start_main_p6) (<= .cse13 c_ULTIMATE.start_malloc_ptr) (<= .cse14 c_ULTIMATE.start_main_p5) (<= .cse15 c_ULTIMATE.start_malloc_ptr) (or (<= .cse16 v_idx_192) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_192)) (< v_idx_192 c_ULTIMATE.start_main_p6)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (= 0 (select |c_#memory_int| v_idx_208)) (< v_idx_208 c_ULTIMATE.start_main_p6) (<= .cse16 v_idx_208)) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_202)) (<= .cse18 v_idx_202) (< v_idx_202 c_ULTIMATE.start_main_p3)) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse15 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_200 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_200)) (<= .cse19 v_idx_200)) (<= .cse17 c_ULTIMATE.start_main_p6) (or (< v_idx_198 c_ULTIMATE.start_main_p1) (<= .cse20 v_idx_198) (= 0 (select |c_#memory_int| v_idx_198))) (or (<= .cse11 v_idx_206) (let ((.cse21 (select |c_#memory_int| v_idx_206))) (and (<= 0 .cse21) (<= 0 (* 2 .cse21)))) (< v_idx_206 c_ULTIMATE.start_main_p5)) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= .cse11 c_ULTIMATE.start_main_p6) (<= .cse19 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse18 c_ULTIMATE.start_main_p4) (or (= 1 (select |c_#valid| v_idx_195)) (< v_idx_195 c_ULTIMATE.start_main_p6) (<= .cse16 v_idx_195)) (or (<= .cse14 v_idx_204) (< v_idx_204 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_204) 0)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse20 c_ULTIMATE.start_main_p2) (<= .cse13 c_ULTIMATE.start_main_p6))))) is different from false [2019-02-15 11:27:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:40,687 INFO L93 Difference]: Finished difference Result 17 states and 40 transitions. [2019-02-15 11:27:40,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:27:40,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:27:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:40,689 INFO L225 Difference]: With dead ends: 17 [2019-02-15 11:27:40,689 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 11:27:40,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-02-15 11:27:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 11:27:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-02-15 11:27:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 11:27:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2019-02-15 11:27:40,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 32 transitions. Word has length 3 [2019-02-15 11:27:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:40,696 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 32 transitions. [2019-02-15 11:27:40,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:27:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 32 transitions. [2019-02-15 11:27:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:27:40,697 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:40,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:27:40,697 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-02-15 11:27:40,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:40,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:40,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:40,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:40,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:40,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:40,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:40,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:27:40,772 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-02-15 11:27:40,773 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:40,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:49,128 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:27:49,128 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:27:49,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:49,129 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:27:49,491 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:27:51,977 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_278 Int) (v_idx_268 Int) (v_idx_280 Int) (v_idx_284 Int) (v_idx_271 Int) (v_idx_282 Int) (v_idx_276 Int) (v_idx_274 Int)) (let ((.cse5 (+ c_ULTIMATE.start_main_p1 5)) (.cse4 (+ c_ULTIMATE.start_main_p4 1)) (.cse8 (+ c_ULTIMATE.start_main_p2 4)) (.cse1 (+ c_ULTIMATE.start_main_p3 3)) (.cse9 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ c_ULTIMATE.start_main_p3 1)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse6 (+ c_ULTIMATE.start_malloc_ptr 1))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse1 c_ULTIMATE.start_main_p6) (or (<= .cse2 v_idx_278) (< v_idx_278 c_ULTIMATE.start_main_p3) (= 0 (select |c_#memory_int| v_idx_278))) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse4 c_ULTIMATE.start_main_p5) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (<= .cse6 v_idx_284) (let ((.cse7 (select |c_#memory_int| v_idx_284))) (and (<= (* 2 .cse7) 0) (<= .cse7 0))) (< v_idx_284 c_ULTIMATE.start_main_p6)) (<= .cse8 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_276)) (<= .cse9 v_idx_276) (< v_idx_276 c_ULTIMATE.start_main_p2)) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse5 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (= 0 (select |c_#memory_int| v_idx_280)) (<= .cse4 v_idx_280) (< v_idx_280 c_ULTIMATE.start_main_p4)) (<= .cse8 c_ULTIMATE.start_main_p6) (or (= 1 (select |c_#valid| v_idx_271)) (< v_idx_271 c_ULTIMATE.start_main_p6) (<= .cse6 v_idx_271)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse9 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse2 c_ULTIMATE.start_main_p4) (or (= (select |c_#memory_int| v_idx_282) 0) (<= .cse0 v_idx_282) (< v_idx_282 c_ULTIMATE.start_main_p5)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6) (or (< v_idx_274 c_ULTIMATE.start_main_p1) (<= .cse10 v_idx_274) (= 0 (select |c_#memory_int| v_idx_274))) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_268) 0) (< v_idx_268 c_ULTIMATE.start_main_p6) (<= .cse6 v_idx_268))))) is different from false [2019-02-15 11:27:54,405 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_303 Int) (v_idx_301 Int) (v_idx_290 Int) (v_idx_295 Int) (v_idx_293 Int) (v_idx_287 Int) (v_idx_299 Int) (v_idx_297 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p4 1)) (.cse5 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 5)) (.cse7 (+ c_ULTIMATE.start_main_p2 4)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse9 (+ c_ULTIMATE.start_main_p2 1)) (.cse8 (+ c_ULTIMATE.start_main_p3 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_299 c_ULTIMATE.start_main_p4) (<= .cse1 v_idx_299) (= 0 (select |c_#memory_int| v_idx_299))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (<= .cse0 v_idx_301) (< v_idx_301 c_ULTIMATE.start_main_p5) (= (select |c_#memory_int| v_idx_301) 0)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (<= .cse5 v_idx_287) (< v_idx_287 c_ULTIMATE.start_main_p6) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_287))) (or (let ((.cse6 (select |c_#memory_int| v_idx_303))) (and (<= .cse6 0) (<= (* 2 .cse6) 0))) (< v_idx_303 c_ULTIMATE.start_main_p6) (<= .cse5 v_idx_303)) (<= .cse7 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (or (< v_idx_290 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_290)) (<= .cse5 v_idx_290)) (<= .cse4 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse7 c_ULTIMATE.start_main_p6) (or (< v_idx_297 c_ULTIMATE.start_main_p3) (<= .cse8 v_idx_297) (= 0 (select |c_#memory_int| v_idx_297))) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (or (<= .cse9 v_idx_295) (= 0 (select |c_#memory_int| v_idx_295)) (< v_idx_295 c_ULTIMATE.start_main_p2)) (<= .cse9 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse8 c_ULTIMATE.start_main_p4) (or (< v_idx_293 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_293)) (<= .cse10 v_idx_293)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:27:54,447 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:27:54,447 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:27:54,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:27:54,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-15 11:27:54,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:27:54,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:27:54,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:27:54,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-02-15 11:27:54,448 INFO L87 Difference]: Start difference. First operand 15 states and 32 transitions. Second operand 4 states. [2019-02-15 11:27:56,858 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_303 Int) (v_idx_301 Int) (v_idx_290 Int) (v_idx_295 Int) (v_idx_293 Int) (v_idx_287 Int) (v_idx_299 Int) (v_idx_297 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p4 1)) (.cse5 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 5)) (.cse7 (+ c_ULTIMATE.start_main_p2 4)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse9 (+ c_ULTIMATE.start_main_p2 1)) (.cse8 (+ c_ULTIMATE.start_main_p3 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_299 c_ULTIMATE.start_main_p4) (<= .cse1 v_idx_299) (= 0 (select |c_#memory_int| v_idx_299))) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (<= .cse0 v_idx_301) (< v_idx_301 c_ULTIMATE.start_main_p5) (= (select |c_#memory_int| v_idx_301) 0)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (<= .cse5 v_idx_287) (< v_idx_287 c_ULTIMATE.start_main_p6) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_287))) (or (let ((.cse6 (select |c_#memory_int| v_idx_303))) (and (<= .cse6 0) (<= (* 2 .cse6) 0))) (< v_idx_303 c_ULTIMATE.start_main_p6) (<= .cse5 v_idx_303)) (<= .cse7 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (or (< v_idx_290 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_290)) (<= .cse5 v_idx_290)) (<= .cse4 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse7 c_ULTIMATE.start_main_p6) (or (< v_idx_297 c_ULTIMATE.start_main_p3) (<= .cse8 v_idx_297) (= 0 (select |c_#memory_int| v_idx_297))) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (or (<= .cse9 v_idx_295) (= 0 (select |c_#memory_int| v_idx_295)) (< v_idx_295 c_ULTIMATE.start_main_p2)) (<= .cse9 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse8 c_ULTIMATE.start_main_p4) (or (< v_idx_293 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_293)) (<= .cse10 v_idx_293)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) (forall ((v_idx_278 Int) (v_idx_268 Int) (v_idx_280 Int) (v_idx_284 Int) (v_idx_271 Int) (v_idx_282 Int) (v_idx_276 Int) (v_idx_274 Int)) (let ((.cse16 (+ c_ULTIMATE.start_main_p1 5)) (.cse15 (+ c_ULTIMATE.start_main_p4 1)) (.cse19 (+ c_ULTIMATE.start_main_p2 4)) (.cse12 (+ c_ULTIMATE.start_main_p3 3)) (.cse20 (+ c_ULTIMATE.start_main_p2 1)) (.cse13 (+ c_ULTIMATE.start_main_p3 1)) (.cse11 (+ c_ULTIMATE.start_main_p5 1)) (.cse14 (+ c_ULTIMATE.start_main_p4 2)) (.cse21 (+ c_ULTIMATE.start_main_p1 1)) (.cse17 (+ c_ULTIMATE.start_malloc_ptr 1))) (and (<= .cse11 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse12 c_ULTIMATE.start_main_p6) (or (<= .cse13 v_idx_278) (< v_idx_278 c_ULTIMATE.start_main_p3) (= 0 (select |c_#memory_int| v_idx_278))) (<= .cse14 c_ULTIMATE.start_malloc_ptr) (<= .cse15 c_ULTIMATE.start_main_p5) (<= .cse16 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (<= .cse17 v_idx_284) (let ((.cse18 (select |c_#memory_int| v_idx_284))) (and (<= (* 2 .cse18) 0) (<= .cse18 0))) (< v_idx_284 c_ULTIMATE.start_main_p6)) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_276)) (<= .cse20 v_idx_276) (< v_idx_276 c_ULTIMATE.start_main_p2)) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse16 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (= 0 (select |c_#memory_int| v_idx_280)) (<= .cse15 v_idx_280) (< v_idx_280 c_ULTIMATE.start_main_p4)) (<= .cse19 c_ULTIMATE.start_main_p6) (or (= 1 (select |c_#valid| v_idx_271)) (< v_idx_271 c_ULTIMATE.start_main_p6) (<= .cse17 v_idx_271)) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= .cse11 c_ULTIMATE.start_main_p6) (<= .cse20 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse13 c_ULTIMATE.start_main_p4) (or (= (select |c_#memory_int| v_idx_282) 0) (<= .cse11 v_idx_282) (< v_idx_282 c_ULTIMATE.start_main_p5)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p2) (<= .cse14 c_ULTIMATE.start_main_p6) (or (< v_idx_274 c_ULTIMATE.start_main_p1) (<= .cse21 v_idx_274) (= 0 (select |c_#memory_int| v_idx_274))) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_268) 0) (< v_idx_268 c_ULTIMATE.start_main_p6) (<= .cse17 v_idx_268)))))) is different from false [2019-02-15 11:28:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:14,653 INFO L93 Difference]: Finished difference Result 17 states and 40 transitions. [2019-02-15 11:28:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:28:14,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:28:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:14,654 INFO L225 Difference]: With dead ends: 17 [2019-02-15 11:28:14,654 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 11:28:14,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-02-15 11:28:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 11:28:14,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-02-15 11:28:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 11:28:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2019-02-15 11:28:14,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 32 transitions. Word has length 3 [2019-02-15 11:28:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:14,662 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 32 transitions. [2019-02-15 11:28:14,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:28:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 32 transitions. [2019-02-15 11:28:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:28:14,663 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:14,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:28:14,663 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-02-15 11:28:14,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:14,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:14,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:14,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:14,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:14,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:14,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:14,738 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:28:14,738 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-02-15 11:28:14,739 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:14,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:22,962 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:28:22,963 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:28:22,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:22,963 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:28:23,328 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:28:25,718 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_347 Int) (v_idx_358 Int) (v_idx_344 Int) (v_idx_356 Int) (v_idx_360 Int) (v_idx_350 Int) (v_idx_354 Int) (v_idx_352 Int)) (let ((.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 5)) (.cse6 (+ c_ULTIMATE.start_main_p2 4)) (.cse1 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse8 (+ c_ULTIMATE.start_main_p2 1)) (.cse7 (+ c_ULTIMATE.start_main_p3 1)) (.cse5 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse1 c_ULTIMATE.start_main_p6) (or (<= .cse0 v_idx_358) (= 0 (select |c_#memory_int| v_idx_358)) (< v_idx_358 c_ULTIMATE.start_main_p5)) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_356)) (< v_idx_356 c_ULTIMATE.start_main_p4) (<= .cse3 v_idx_356)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_347 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_347)) (<= .cse5 v_idx_347)) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse6 c_ULTIMATE.start_main_p6) (or (<= .cse5 v_idx_344) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_344)) (< v_idx_344 c_ULTIMATE.start_main_p6)) (or (<= .cse7 v_idx_354) (< v_idx_354 c_ULTIMATE.start_main_p3) (= 0 (select |c_#memory_int| v_idx_354))) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (or (< v_idx_352 c_ULTIMATE.start_main_p2) (<= .cse8 v_idx_352) (let ((.cse9 (select |c_#memory_int| v_idx_352))) (and (<= .cse9 0) (<= (* 2 .cse9) 0)))) (<= .cse8 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse7 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_#memory_int| v_idx_350)) (< v_idx_350 c_ULTIMATE.start_main_p1) (<= .cse10 v_idx_350)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_360 c_ULTIMATE.start_main_p6) (= (select |c_#memory_int| v_idx_360) 0) (<= .cse5 v_idx_360)) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse2 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:28:28,212 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_379 Int) (v_idx_369 Int) (v_idx_366 Int) (v_idx_377 Int) (v_idx_371 Int) (v_idx_375 Int) (v_idx_373 Int) (v_idx_363 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p1 5)) (.cse7 (+ c_ULTIMATE.start_main_p2 4)) (.cse1 (+ c_ULTIMATE.start_main_p3 3)) (.cse10 (+ c_ULTIMATE.start_main_p2 1)) (.cse6 (+ c_ULTIMATE.start_main_p3 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse8 (+ c_ULTIMATE.start_main_p1 1)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse2 (+ c_ULTIMATE.start_main_p4 2)) (.cse5 (+ c_ULTIMATE.start_malloc_ptr 1))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse1 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_366 c_ULTIMATE.start_main_p6) (<= .cse5 v_idx_366) (= 1 (select |c_#valid| v_idx_366))) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (= 0 (select |c_#memory_int| v_idx_373)) (<= .cse6 v_idx_373) (< v_idx_373 c_ULTIMATE.start_main_p3)) (or (<= .cse5 v_idx_363) (< v_idx_363 c_ULTIMATE.start_main_p6) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_363) 0)) (<= .cse7 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse7 c_ULTIMATE.start_main_p6) (or (<= .cse8 v_idx_369) (= 0 (select |c_#memory_int| v_idx_369)) (< v_idx_369 c_ULTIMATE.start_main_p1)) (or (< v_idx_371 c_ULTIMATE.start_main_p2) (let ((.cse9 (select |c_#memory_int| v_idx_371))) (and (<= (* 2 .cse9) 0) (<= .cse9 0))) (<= .cse10 v_idx_371)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse10 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse6 c_ULTIMATE.start_main_p4) (or (< v_idx_375 c_ULTIMATE.start_main_p4) (= 0 (select |c_#memory_int| v_idx_375)) (<= .cse3 v_idx_375)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse8 c_ULTIMATE.start_main_p2) (or (= 0 (select |c_#memory_int| v_idx_377)) (< v_idx_377 c_ULTIMATE.start_main_p5) (<= .cse0 v_idx_377)) (<= .cse2 c_ULTIMATE.start_main_p6) (or (= 0 (select |c_#memory_int| v_idx_379)) (< v_idx_379 c_ULTIMATE.start_main_p6) (<= .cse5 v_idx_379))))) is different from false [2019-02-15 11:28:28,256 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:28:28,256 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:28:28,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:28:28,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-15 11:28:28,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:28:28,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:28:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:28:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-02-15 11:28:28,258 INFO L87 Difference]: Start difference. First operand 15 states and 32 transitions. Second operand 4 states. [2019-02-15 11:28:30,568 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_379 Int) (v_idx_369 Int) (v_idx_366 Int) (v_idx_377 Int) (v_idx_371 Int) (v_idx_375 Int) (v_idx_373 Int) (v_idx_363 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p1 5)) (.cse7 (+ c_ULTIMATE.start_main_p2 4)) (.cse1 (+ c_ULTIMATE.start_main_p3 3)) (.cse10 (+ c_ULTIMATE.start_main_p2 1)) (.cse6 (+ c_ULTIMATE.start_main_p3 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 1)) (.cse8 (+ c_ULTIMATE.start_main_p1 1)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse2 (+ c_ULTIMATE.start_main_p4 2)) (.cse5 (+ c_ULTIMATE.start_malloc_ptr 1))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse1 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse3 c_ULTIMATE.start_main_p5) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_366 c_ULTIMATE.start_main_p6) (<= .cse5 v_idx_366) (= 1 (select |c_#valid| v_idx_366))) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (= 0 (select |c_#memory_int| v_idx_373)) (<= .cse6 v_idx_373) (< v_idx_373 c_ULTIMATE.start_main_p3)) (or (<= .cse5 v_idx_363) (< v_idx_363 c_ULTIMATE.start_main_p6) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_363) 0)) (<= .cse7 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse4 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse7 c_ULTIMATE.start_main_p6) (or (<= .cse8 v_idx_369) (= 0 (select |c_#memory_int| v_idx_369)) (< v_idx_369 c_ULTIMATE.start_main_p1)) (or (< v_idx_371 c_ULTIMATE.start_main_p2) (let ((.cse9 (select |c_#memory_int| v_idx_371))) (and (<= (* 2 .cse9) 0) (<= .cse9 0))) (<= .cse10 v_idx_371)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse10 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse6 c_ULTIMATE.start_main_p4) (or (< v_idx_375 c_ULTIMATE.start_main_p4) (= 0 (select |c_#memory_int| v_idx_375)) (<= .cse3 v_idx_375)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse8 c_ULTIMATE.start_main_p2) (or (= 0 (select |c_#memory_int| v_idx_377)) (< v_idx_377 c_ULTIMATE.start_main_p5) (<= .cse0 v_idx_377)) (<= .cse2 c_ULTIMATE.start_main_p6) (or (= 0 (select |c_#memory_int| v_idx_379)) (< v_idx_379 c_ULTIMATE.start_main_p6) (<= .cse5 v_idx_379))))) (forall ((v_idx_347 Int) (v_idx_358 Int) (v_idx_344 Int) (v_idx_356 Int) (v_idx_360 Int) (v_idx_350 Int) (v_idx_354 Int) (v_idx_352 Int)) (let ((.cse14 (+ c_ULTIMATE.start_main_p4 1)) (.cse15 (+ c_ULTIMATE.start_main_p1 5)) (.cse17 (+ c_ULTIMATE.start_main_p2 4)) (.cse12 (+ c_ULTIMATE.start_main_p3 3)) (.cse11 (+ c_ULTIMATE.start_main_p5 1)) (.cse19 (+ c_ULTIMATE.start_main_p2 1)) (.cse18 (+ c_ULTIMATE.start_main_p3 1)) (.cse16 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse21 (+ c_ULTIMATE.start_main_p1 1)) (.cse13 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse11 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse12 c_ULTIMATE.start_main_p6) (or (<= .cse11 v_idx_358) (= 0 (select |c_#memory_int| v_idx_358)) (< v_idx_358 c_ULTIMATE.start_main_p5)) (<= .cse13 c_ULTIMATE.start_malloc_ptr) (<= .cse14 c_ULTIMATE.start_main_p5) (<= .cse15 c_ULTIMATE.start_malloc_ptr) (or (= 0 (select |c_#memory_int| v_idx_356)) (< v_idx_356 c_ULTIMATE.start_main_p4) (<= .cse14 v_idx_356)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_347 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_347)) (<= .cse16 v_idx_347)) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse15 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse17 c_ULTIMATE.start_main_p6) (or (<= .cse16 v_idx_344) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_344)) (< v_idx_344 c_ULTIMATE.start_main_p6)) (or (<= .cse18 v_idx_354) (< v_idx_354 c_ULTIMATE.start_main_p3) (= 0 (select |c_#memory_int| v_idx_354))) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= .cse11 c_ULTIMATE.start_main_p6) (or (< v_idx_352 c_ULTIMATE.start_main_p2) (<= .cse19 v_idx_352) (let ((.cse20 (select |c_#memory_int| v_idx_352))) (and (<= .cse20 0) (<= (* 2 .cse20) 0)))) (<= .cse19 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse18 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_#memory_int| v_idx_350)) (< v_idx_350 c_ULTIMATE.start_main_p1) (<= .cse21 v_idx_350)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_360 c_ULTIMATE.start_main_p6) (= (select |c_#memory_int| v_idx_360) 0) (<= .cse16 v_idx_360)) (<= .cse21 c_ULTIMATE.start_main_p2) (<= .cse13 c_ULTIMATE.start_main_p6))))) is different from false [2019-02-15 11:28:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:48,026 INFO L93 Difference]: Finished difference Result 17 states and 40 transitions. [2019-02-15 11:28:48,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:28:48,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:28:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:48,027 INFO L225 Difference]: With dead ends: 17 [2019-02-15 11:28:48,027 INFO L226 Difference]: Without dead ends: 16 [2019-02-15 11:28:48,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-02-15 11:28:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-15 11:28:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-02-15 11:28:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-15 11:28:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 32 transitions. [2019-02-15 11:28:48,037 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 32 transitions. Word has length 3 [2019-02-15 11:28:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:48,038 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 32 transitions. [2019-02-15 11:28:48,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:28:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 32 transitions. [2019-02-15 11:28:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:28:48,038 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:48,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:28:48,039 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 30688, now seen corresponding path program 1 times [2019-02-15 11:28:48,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:48,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:48,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:48,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:48,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:48,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-02-15 11:28:48,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:28:48,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:28:48,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:28:48,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:28:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:28:48,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:28:48,073 INFO L87 Difference]: Start difference. First operand 15 states and 32 transitions. Second operand 3 states. [2019-02-15 11:28:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:48,137 INFO L93 Difference]: Finished difference Result 25 states and 41 transitions. [2019-02-15 11:28:48,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:28:48,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 11:28:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:48,138 INFO L225 Difference]: With dead ends: 25 [2019-02-15 11:28:48,139 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 11:28:48,139 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-02-15 11:28:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 11:28:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2019-02-15 11:28:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 11:28:48,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 33 transitions. [2019-02-15 11:28:48,148 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 33 transitions. Word has length 3 [2019-02-15 11:28:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:48,148 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 33 transitions. [2019-02-15 11:28:48,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:28:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 33 transitions. [2019-02-15 11:28:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:28:48,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:48,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:28:48,149 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:48,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash 30252, now seen corresponding path program 1 times [2019-02-15 11:28:48,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:48,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:48,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:48,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:48,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:48,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:48,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:48,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:28:48,214 INFO L207 CegarAbsIntRunner]: [0], [14], [27] [2019-02-15 11:28:48,215 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:48,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:56,474 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:28:56,474 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:28:56,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:56,474 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:28:56,857 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:28:59,287 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_423 Int) (v_idx_434 Int) (v_idx_432 Int) (v_idx_428 Int) (v_idx_436 Int) (v_idx_426 Int) (v_idx_430 Int) (v_idx_420 Int)) (let ((.cse5 (+ c_ULTIMATE.start_main_p1 5)) (.cse3 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse6 (+ c_ULTIMATE.start_main_p2 4)) (.cse1 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse4 (+ c_ULTIMATE.start_main_p4 1)) (.cse8 (+ c_ULTIMATE.start_main_p2 1)) (.cse9 (+ c_ULTIMATE.start_main_p3 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse1 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_423 c_ULTIMATE.start_main_p6) (<= .cse3 v_idx_423) (= 1 (select |c_#valid| v_idx_423))) (<= .cse4 c_ULTIMATE.start_main_p5) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_434 c_ULTIMATE.start_main_p5) (<= .cse0 v_idx_434) (= (select |c_#memory_int| v_idx_434) 0)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_420 c_ULTIMATE.start_main_p6) (<= .cse3 v_idx_420) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_420) 0)) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse5 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_436 c_ULTIMATE.start_main_p6) (= (select |c_#memory_int| v_idx_436) 0) (<= .cse3 v_idx_436)) (<= .cse6 c_ULTIMATE.start_main_p6) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (or (<= .cse7 v_idx_426) (= (select |c_#memory_int| v_idx_426) 0) (< v_idx_426 c_ULTIMATE.start_main_p1)) (<= .cse8 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (< v_idx_432 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_432) 0) (<= .cse4 v_idx_432)) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (or (<= .cse8 v_idx_428) (= (select |c_#memory_int| v_idx_428) 0) (< v_idx_428 c_ULTIMATE.start_main_p2)) (<= .cse9 c_ULTIMATE.start_main_p4) (or (<= .cse9 v_idx_430) (< v_idx_430 c_ULTIMATE.start_main_p3) (let ((.cse10 (select |c_#memory_int| v_idx_430))) (and (<= 0 (* 2 .cse10)) (<= 0 .cse10)))) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse7 c_ULTIMATE.start_main_p2) (<= .cse2 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:29:01,733 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_445 Int) (v_idx_455 Int) (v_idx_449 Int) (v_idx_439 Int) (v_idx_447 Int) (v_idx_442 Int) (v_idx_453 Int) (v_idx_451 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p4 1)) (.cse0 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 5)) (.cse6 (+ c_ULTIMATE.start_main_p2 4)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse7 (+ c_ULTIMATE.start_main_p2 1)) (.cse9 (+ c_ULTIMATE.start_main_p3 1)) (.cse1 (+ c_ULTIMATE.start_main_p5 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (or (<= .cse0 v_idx_439) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_439) 0) (< v_idx_439 c_ULTIMATE.start_main_p6)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse4 c_ULTIMATE.start_main_p5) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_451 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_451) 0) (<= .cse4 v_idx_451)) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (or (<= .cse7 v_idx_447) (= (select |c_#memory_int| v_idx_447) 0) (< v_idx_447 c_ULTIMATE.start_main_p2)) (or (< v_idx_455 c_ULTIMATE.start_main_p6) (<= .cse0 v_idx_455) (= (select |c_#memory_int| v_idx_455) 0)) (or (<= .cse0 v_idx_442) (< v_idx_442 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_442))) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse5 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse6 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p6) (or (let ((.cse8 (select |c_#memory_int| v_idx_449))) (and (<= 0 (* 2 .cse8)) (<= 0 .cse8))) (< v_idx_449 c_ULTIMATE.start_main_p3) (<= .cse9 v_idx_449)) (<= .cse7 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse9 c_ULTIMATE.start_main_p4) (or (= (select |c_#memory_int| v_idx_445) 0) (<= .cse10 v_idx_445) (< v_idx_445 c_ULTIMATE.start_main_p1)) (or (= (select |c_#memory_int| v_idx_453) 0) (<= .cse1 v_idx_453) (< v_idx_453 c_ULTIMATE.start_main_p5)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:29:01,776 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-15 11:29:01,777 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:29:01,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:29:01,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-02-15 11:29:01,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:29:01,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:29:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:29:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-02-15 11:29:01,778 INFO L87 Difference]: Start difference. First operand 16 states and 33 transitions. Second operand 4 states. [2019-02-15 11:29:04,205 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_445 Int) (v_idx_455 Int) (v_idx_449 Int) (v_idx_439 Int) (v_idx_447 Int) (v_idx_442 Int) (v_idx_453 Int) (v_idx_451 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p4 1)) (.cse0 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 5)) (.cse6 (+ c_ULTIMATE.start_main_p2 4)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse7 (+ c_ULTIMATE.start_main_p2 1)) (.cse9 (+ c_ULTIMATE.start_main_p3 1)) (.cse1 (+ c_ULTIMATE.start_main_p5 1)) (.cse10 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (or (<= .cse0 v_idx_439) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_439) 0) (< v_idx_439 c_ULTIMATE.start_main_p6)) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse4 c_ULTIMATE.start_main_p5) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_451 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_451) 0) (<= .cse4 v_idx_451)) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (or (<= .cse7 v_idx_447) (= (select |c_#memory_int| v_idx_447) 0) (< v_idx_447 c_ULTIMATE.start_main_p2)) (or (< v_idx_455 c_ULTIMATE.start_main_p6) (<= .cse0 v_idx_455) (= (select |c_#memory_int| v_idx_455) 0)) (or (<= .cse0 v_idx_442) (< v_idx_442 c_ULTIMATE.start_main_p6) (= 1 (select |c_#valid| v_idx_442))) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse5 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse6 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p6) (or (let ((.cse8 (select |c_#memory_int| v_idx_449))) (and (<= 0 (* 2 .cse8)) (<= 0 .cse8))) (< v_idx_449 c_ULTIMATE.start_main_p3) (<= .cse9 v_idx_449)) (<= .cse7 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse9 c_ULTIMATE.start_main_p4) (or (= (select |c_#memory_int| v_idx_445) 0) (<= .cse10 v_idx_445) (< v_idx_445 c_ULTIMATE.start_main_p1)) (or (= (select |c_#memory_int| v_idx_453) 0) (<= .cse1 v_idx_453) (< v_idx_453 c_ULTIMATE.start_main_p5)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse10 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) (forall ((v_idx_423 Int) (v_idx_434 Int) (v_idx_432 Int) (v_idx_428 Int) (v_idx_436 Int) (v_idx_426 Int) (v_idx_430 Int) (v_idx_420 Int)) (let ((.cse16 (+ c_ULTIMATE.start_main_p1 5)) (.cse14 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse17 (+ c_ULTIMATE.start_main_p2 4)) (.cse12 (+ c_ULTIMATE.start_main_p3 3)) (.cse11 (+ c_ULTIMATE.start_main_p5 1)) (.cse15 (+ c_ULTIMATE.start_main_p4 1)) (.cse19 (+ c_ULTIMATE.start_main_p2 1)) (.cse20 (+ c_ULTIMATE.start_main_p3 1)) (.cse18 (+ c_ULTIMATE.start_main_p1 1)) (.cse13 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse11 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse12 c_ULTIMATE.start_main_p6) (<= .cse13 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_423 c_ULTIMATE.start_main_p6) (<= .cse14 v_idx_423) (= 1 (select |c_#valid| v_idx_423))) (<= .cse15 c_ULTIMATE.start_main_p5) (<= .cse16 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_434 c_ULTIMATE.start_main_p5) (<= .cse11 v_idx_434) (= (select |c_#memory_int| v_idx_434) 0)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_420 c_ULTIMATE.start_main_p6) (<= .cse14 v_idx_420) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_420) 0)) (<= .cse17 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse16 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (< v_idx_436 c_ULTIMATE.start_main_p6) (= (select |c_#memory_int| v_idx_436) 0) (<= .cse14 v_idx_436)) (<= .cse17 c_ULTIMATE.start_main_p6) (<= .cse12 c_ULTIMATE.start_malloc_ptr) (<= .cse11 c_ULTIMATE.start_main_p6) (or (<= .cse18 v_idx_426) (= (select |c_#memory_int| v_idx_426) 0) (< v_idx_426 c_ULTIMATE.start_main_p1)) (<= .cse19 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (< v_idx_432 c_ULTIMATE.start_main_p4) (= (select |c_#memory_int| v_idx_432) 0) (<= .cse15 v_idx_432)) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (or (<= .cse19 v_idx_428) (= (select |c_#memory_int| v_idx_428) 0) (< v_idx_428 c_ULTIMATE.start_main_p2)) (<= .cse20 c_ULTIMATE.start_main_p4) (or (<= .cse20 v_idx_430) (< v_idx_430 c_ULTIMATE.start_main_p3) (let ((.cse21 (select |c_#memory_int| v_idx_430))) (and (<= 0 (* 2 .cse21)) (<= 0 .cse21)))) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse18 c_ULTIMATE.start_main_p2) (<= .cse13 c_ULTIMATE.start_main_p6))))) is different from false [2019-02-15 11:29:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:22,551 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-15 11:29:22,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:29:22,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:29:22,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:22,552 INFO L225 Difference]: With dead ends: 18 [2019-02-15 11:29:22,553 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 11:29:22,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-02-15 11:29:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 11:29:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-15 11:29:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 11:29:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 33 transitions. [2019-02-15 11:29:22,564 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 33 transitions. Word has length 3 [2019-02-15 11:29:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:22,565 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 33 transitions. [2019-02-15 11:29:22,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:29:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 33 transitions. [2019-02-15 11:29:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:29:22,565 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:22,565 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-02-15 11:29:22,566 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash 941404, now seen corresponding path program 2 times [2019-02-15 11:29:22,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:22,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:29:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:22,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:29:22,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:22,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:22,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:29:22,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:29:22,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:22,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:29:22,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:29:22,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:29:22,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:29:22,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:29:22,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:29:22,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 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-02-15 11:29:22,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:22,787 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 21 treesize of output 24 [2019-02-15 11:29:22,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,791 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 24 treesize of output 30 [2019-02-15 11:29:22,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,800 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-15 11:29:22,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,821 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-15 11:29:22,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-15 11:29:22,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:22,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-15 11:29:22,871 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:22,932 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:22,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:22,996 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:23,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:23,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:29:23,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:23,112 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-15 11:29:23,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-15 11:29:23,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:23,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:23,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-02-15 11:29:23,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:29:23,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 103 [2019-02-15 11:29:23,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:29:23,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:29:23,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-02-15 11:29:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:23,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:29:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:23,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:29:23,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 11:29:23,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:29:23,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:29:23,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:29:23,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:29:23,575 INFO L87 Difference]: Start difference. First operand 16 states and 33 transitions. Second operand 7 states. [2019-02-15 11:29:24,019 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-02-15 11:29:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:29:26,159 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2019-02-15 11:29:26,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:29:26,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-02-15 11:29:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:29:26,161 INFO L225 Difference]: With dead ends: 57 [2019-02-15 11:29:26,161 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 11:29:26,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:29:26,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 11:29:26,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 21. [2019-02-15 11:29:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 11:29:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 52 transitions. [2019-02-15 11:29:26,178 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 52 transitions. Word has length 4 [2019-02-15 11:29:26,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:29:26,178 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 52 transitions. [2019-02-15 11:29:26,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:29:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 52 transitions. [2019-02-15 11:29:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:29:26,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:29:26,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:29:26,179 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:29:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:26,180 INFO L82 PathProgramCache]: Analyzing trace with hash 941032, now seen corresponding path program 1 times [2019-02-15 11:29:26,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:29:26,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:26,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:29:26,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:29:26,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:29:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:29:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:29:26,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:29:26,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:29:26,257 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:29:26,257 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-02-15 11:29:26,259 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:29:26,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:29:51,868 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:29:51,868 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:29:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:29:51,869 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:29:52,548 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:29:54,941 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_523 Int) (v_idx_531 Int) (v_idx_521 Int) (v_idx_515 Int) (v_idx_527 Int) (v_idx_525 Int) (v_idx_518 Int) (v_idx_529 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p4 1)) (.cse0 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse5 (+ c_ULTIMATE.start_main_p1 5)) (.cse14 (+ c_ULTIMATE.start_main_p2 4)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse1 (+ c_ULTIMATE.start_main_p5 1)) (.cse15 (+ c_ULTIMATE.start_main_p2 1)) (.cse16 (+ c_ULTIMATE.start_main_p3 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (or (<= .cse0 v_idx_515) (< v_idx_515 c_ULTIMATE.start_main_p6) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_515))) (<= .cse1 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse4 c_ULTIMATE.start_main_p5) (<= .cse5 c_ULTIMATE.start_malloc_ptr) (let ((.cse13 (select |c_#memory_int| v_idx_527))) (let ((.cse11 (<= (* 2 .cse13) 0)) (.cse12 (<= .cse13 0)) (.cse9 (< v_idx_527 c_ULTIMATE.start_main_p4)) (.cse10 (<= .cse4 v_idx_527))) (let ((.cse6 (or (and .cse11 .cse12) .cse9 .cse10))) (or (and (< v_idx_521 c_ULTIMATE.start_main_p1) .cse6) (and (<= .cse7 v_idx_521) .cse6) (let ((.cse8 (select |c_#memory_int| v_idx_521))) (and (<= 0 (* 2 .cse8)) (<= 0 .cse8) (or .cse9 .cse10 (and .cse11 .cse12 (<= .cse13 .cse8))))))))) (or (= 1 (select |c_#valid| v_idx_518)) (< v_idx_518 c_ULTIMATE.start_main_p6) (<= .cse0 v_idx_518)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_531 c_ULTIMATE.start_main_p6) (= 0 (select |c_#memory_int| v_idx_531)) (<= .cse0 v_idx_531)) (<= .cse14 c_ULTIMATE.start_malloc_ptr) (or (<= .cse15 v_idx_523) (< v_idx_523 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_523) 0)) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse5 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse14 c_ULTIMATE.start_main_p6) (or (<= .cse1 v_idx_529) (= (select |c_#memory_int| v_idx_529) 0) (< v_idx_529 c_ULTIMATE.start_main_p5)) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse1 c_ULTIMATE.start_main_p6) (<= .cse15 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (< v_idx_525 c_ULTIMATE.start_main_p3) (= (select |c_#memory_int| v_idx_525) 0) (<= .cse16 v_idx_525)) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse16 c_ULTIMATE.start_main_p4) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse7 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:29:57,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_544 Int) (v_idx_534 Int) (v_idx_542 Int) (v_idx_548 Int) (v_idx_537 Int) (v_idx_546 Int) (v_idx_540 Int) (v_idx_550 Int)) (let ((.cse5 (+ c_ULTIMATE.start_main_p4 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 5)) (.cse16 (+ c_ULTIMATE.start_main_p2 4)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse7 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse4 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse15 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (<= .cse1 v_idx_544) (< v_idx_544 c_ULTIMATE.start_main_p3) (= (select |c_#memory_int| v_idx_544) 0)) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_534 c_ULTIMATE.start_main_p6) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_534)) (<= .cse4 v_idx_534)) (<= .cse5 c_ULTIMATE.start_main_p5) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_542 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_542) 0) (<= .cse7 v_idx_542)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (let ((.cse12 (select |c_#memory_int| v_idx_546))) (let ((.cse11 (<= .cse12 0)) (.cse14 (<= (* 2 .cse12) 0)) (.cse9 (<= .cse5 v_idx_546)) (.cse10 (< v_idx_546 c_ULTIMATE.start_main_p4))) (let ((.cse8 (or (and .cse11 .cse14) .cse9 .cse10))) (or (and .cse8 (< v_idx_540 c_ULTIMATE.start_main_p1)) (let ((.cse13 (select |c_#memory_int| v_idx_540))) (and (or .cse9 .cse10 (and .cse11 (<= .cse12 .cse13) .cse14)) (<= 0 (* 2 .cse13)) (<= 0 .cse13))) (and .cse8 (<= .cse15 v_idx_540)))))) (<= .cse16 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_550) 0) (<= .cse4 v_idx_550) (< v_idx_550 c_ULTIMATE.start_main_p6)) (<= .cse16 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse7 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse1 c_ULTIMATE.start_main_p4) (or (<= .cse0 v_idx_548) (= (select |c_#memory_int| v_idx_548) 0) (< v_idx_548 c_ULTIMATE.start_main_p5)) (or (<= .cse4 v_idx_537) (= 1 (select |c_#valid| v_idx_537)) (< v_idx_537 c_ULTIMATE.start_main_p6)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse15 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:29:59,556 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_567 Int) (v_idx_556 Int) (v_idx_553 Int) (v_idx_565 Int) (v_idx_559 Int) (v_idx_569 Int) (v_idx_563 Int) (v_idx_561 Int)) (let ((.cse6 (+ c_ULTIMATE.start_main_p1 5)) (.cse7 (+ c_ULTIMATE.start_main_p2 4)) (.cse3 (+ c_ULTIMATE.start_main_p3 3)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse5 (+ c_ULTIMATE.start_main_p4 1)) (.cse8 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse2 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse16 (+ c_ULTIMATE.start_main_p1 1)) (.cse4 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_563) 0) (<= .cse1 v_idx_563) (< v_idx_563 c_ULTIMATE.start_main_p3)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (<= .cse2 v_idx_569) (= (select |c_#memory_int| v_idx_569) 0) (< v_idx_569 c_ULTIMATE.start_main_p6)) (<= .cse3 c_ULTIMATE.start_main_p6) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_567 c_ULTIMATE.start_main_p5) (<= .cse0 v_idx_567) (= (select |c_#memory_int| v_idx_567) 0)) (<= .cse5 c_ULTIMATE.start_main_p5) (or (= 1 (select |c_#valid| v_idx_556)) (<= .cse2 v_idx_556) (< v_idx_556 c_ULTIMATE.start_main_p6)) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (<= .cse7 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse7 c_ULTIMATE.start_main_p6) (or (= (select |c_#memory_int| v_idx_561) 0) (< v_idx_561 c_ULTIMATE.start_main_p2) (<= .cse8 v_idx_561)) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (let ((.cse12 (select |c_#memory_int| v_idx_559))) (let ((.cse11 (<= .cse16 v_idx_559)) (.cse15 (< v_idx_559 c_ULTIMATE.start_main_p1)) (.cse13 (<= 0 (* 2 .cse12))) (.cse14 (<= 0 .cse12))) (let ((.cse9 (or .cse11 .cse15 (and .cse13 .cse14)))) (or (and .cse9 (< v_idx_565 c_ULTIMATE.start_main_p4)) (let ((.cse10 (select |c_#memory_int| v_idx_565))) (and (<= .cse10 0) (<= (* 2 .cse10) 0) (or .cse11 (and (<= .cse10 .cse12) .cse13 .cse14) .cse15))) (and .cse9 (<= .cse5 v_idx_565)))))) (<= .cse8 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse1 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_553)) (<= .cse2 v_idx_553) (< v_idx_553 c_ULTIMATE.start_main_p6)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse16 c_ULTIMATE.start_main_p2) (<= .cse4 c_ULTIMATE.start_main_p6)))) is different from false [2019-02-15 11:29:59,601 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-15 11:29:59,601 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:29:59,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:29:59,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-02-15 11:29:59,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:29:59,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:29:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:29:59,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-02-15 11:29:59,602 INFO L87 Difference]: Start difference. First operand 21 states and 52 transitions. Second operand 5 states. [2019-02-15 11:30:02,502 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_544 Int) (v_idx_534 Int) (v_idx_542 Int) (v_idx_548 Int) (v_idx_537 Int) (v_idx_546 Int) (v_idx_540 Int) (v_idx_550 Int)) (let ((.cse5 (+ c_ULTIMATE.start_main_p4 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 5)) (.cse16 (+ c_ULTIMATE.start_main_p2 4)) (.cse2 (+ c_ULTIMATE.start_main_p3 3)) (.cse7 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse0 (+ c_ULTIMATE.start_main_p5 1)) (.cse4 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse15 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse0 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (<= .cse1 v_idx_544) (< v_idx_544 c_ULTIMATE.start_main_p3) (= (select |c_#memory_int| v_idx_544) 0)) (<= .cse2 c_ULTIMATE.start_main_p6) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_534 c_ULTIMATE.start_main_p6) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_534)) (<= .cse4 v_idx_534)) (<= .cse5 c_ULTIMATE.start_main_p5) (<= .cse6 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_542 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_542) 0) (<= .cse7 v_idx_542)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (let ((.cse12 (select |c_#memory_int| v_idx_546))) (let ((.cse11 (<= .cse12 0)) (.cse14 (<= (* 2 .cse12) 0)) (.cse9 (<= .cse5 v_idx_546)) (.cse10 (< v_idx_546 c_ULTIMATE.start_main_p4))) (let ((.cse8 (or (and .cse11 .cse14) .cse9 .cse10))) (or (and .cse8 (< v_idx_540 c_ULTIMATE.start_main_p1)) (let ((.cse13 (select |c_#memory_int| v_idx_540))) (and (or .cse9 .cse10 (and .cse11 (<= .cse12 .cse13) .cse14)) (<= 0 (* 2 .cse13)) (<= 0 .cse13))) (and .cse8 (<= .cse15 v_idx_540)))))) (<= .cse16 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse6 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_550) 0) (<= .cse4 v_idx_550) (< v_idx_550 c_ULTIMATE.start_main_p6)) (<= .cse16 c_ULTIMATE.start_main_p6) (<= .cse2 c_ULTIMATE.start_malloc_ptr) (<= .cse0 c_ULTIMATE.start_main_p6) (<= .cse7 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse1 c_ULTIMATE.start_main_p4) (or (<= .cse0 v_idx_548) (= (select |c_#memory_int| v_idx_548) 0) (< v_idx_548 c_ULTIMATE.start_main_p5)) (or (<= .cse4 v_idx_537) (= 1 (select |c_#valid| v_idx_537)) (< v_idx_537 c_ULTIMATE.start_main_p6)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse15 c_ULTIMATE.start_main_p2) (<= .cse3 c_ULTIMATE.start_main_p6)))) (forall ((v_idx_523 Int) (v_idx_531 Int) (v_idx_521 Int) (v_idx_515 Int) (v_idx_527 Int) (v_idx_525 Int) (v_idx_518 Int) (v_idx_529 Int)) (let ((.cse21 (+ c_ULTIMATE.start_main_p4 1)) (.cse17 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse22 (+ c_ULTIMATE.start_main_p1 5)) (.cse31 (+ c_ULTIMATE.start_main_p2 4)) (.cse19 (+ c_ULTIMATE.start_main_p3 3)) (.cse18 (+ c_ULTIMATE.start_main_p5 1)) (.cse32 (+ c_ULTIMATE.start_main_p2 1)) (.cse33 (+ c_ULTIMATE.start_main_p3 1)) (.cse24 (+ c_ULTIMATE.start_main_p1 1)) (.cse20 (+ c_ULTIMATE.start_main_p4 2))) (and (or (<= .cse17 v_idx_515) (< v_idx_515 c_ULTIMATE.start_main_p6) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_515))) (<= .cse18 c_ULTIMATE.start_malloc_ptr) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (<= .cse19 c_ULTIMATE.start_main_p6) (<= .cse20 c_ULTIMATE.start_malloc_ptr) (<= .cse21 c_ULTIMATE.start_main_p5) (<= .cse22 c_ULTIMATE.start_malloc_ptr) (let ((.cse30 (select |c_#memory_int| v_idx_527))) (let ((.cse28 (<= (* 2 .cse30) 0)) (.cse29 (<= .cse30 0)) (.cse26 (< v_idx_527 c_ULTIMATE.start_main_p4)) (.cse27 (<= .cse21 v_idx_527))) (let ((.cse23 (or (and .cse28 .cse29) .cse26 .cse27))) (or (and (< v_idx_521 c_ULTIMATE.start_main_p1) .cse23) (and (<= .cse24 v_idx_521) .cse23) (let ((.cse25 (select |c_#memory_int| v_idx_521))) (and (<= 0 (* 2 .cse25)) (<= 0 .cse25) (or .cse26 .cse27 (and .cse28 .cse29 (<= .cse30 .cse25))))))))) (or (= 1 (select |c_#valid| v_idx_518)) (< v_idx_518 c_ULTIMATE.start_main_p6) (<= .cse17 v_idx_518)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (or (< v_idx_531 c_ULTIMATE.start_main_p6) (= 0 (select |c_#memory_int| v_idx_531)) (<= .cse17 v_idx_531)) (<= .cse31 c_ULTIMATE.start_malloc_ptr) (or (<= .cse32 v_idx_523) (< v_idx_523 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_523) 0)) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse22 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse31 c_ULTIMATE.start_main_p6) (or (<= .cse18 v_idx_529) (= (select |c_#memory_int| v_idx_529) 0) (< v_idx_529 c_ULTIMATE.start_main_p5)) (<= .cse19 c_ULTIMATE.start_malloc_ptr) (<= .cse18 c_ULTIMATE.start_main_p6) (<= .cse32 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (or (< v_idx_525 c_ULTIMATE.start_main_p3) (= (select |c_#memory_int| v_idx_525) 0) (<= .cse33 v_idx_525)) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse33 c_ULTIMATE.start_main_p4) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse24 c_ULTIMATE.start_main_p2) (<= .cse20 c_ULTIMATE.start_main_p6)))) (forall ((v_idx_567 Int) (v_idx_556 Int) (v_idx_553 Int) (v_idx_565 Int) (v_idx_559 Int) (v_idx_569 Int) (v_idx_563 Int) (v_idx_561 Int)) (let ((.cse40 (+ c_ULTIMATE.start_main_p1 5)) (.cse41 (+ c_ULTIMATE.start_main_p2 4)) (.cse37 (+ c_ULTIMATE.start_main_p3 3)) (.cse34 (+ c_ULTIMATE.start_main_p5 1)) (.cse39 (+ c_ULTIMATE.start_main_p4 1)) (.cse42 (+ c_ULTIMATE.start_main_p2 1)) (.cse35 (+ c_ULTIMATE.start_main_p3 1)) (.cse36 (+ c_ULTIMATE.start_malloc_ptr 1)) (.cse50 (+ c_ULTIMATE.start_main_p1 1)) (.cse38 (+ c_ULTIMATE.start_main_p4 2))) (and (<= .cse34 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_563) 0) (<= .cse35 v_idx_563) (< v_idx_563 c_ULTIMATE.start_main_p3)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p6) (or (<= .cse36 v_idx_569) (= (select |c_#memory_int| v_idx_569) 0) (< v_idx_569 c_ULTIMATE.start_main_p6)) (<= .cse37 c_ULTIMATE.start_main_p6) (<= .cse38 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_567 c_ULTIMATE.start_main_p5) (<= .cse34 v_idx_567) (= (select |c_#memory_int| v_idx_567) 0)) (<= .cse39 c_ULTIMATE.start_main_p5) (or (= 1 (select |c_#valid| v_idx_556)) (<= .cse36 v_idx_556) (< v_idx_556 c_ULTIMATE.start_main_p6)) (<= .cse40 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (<= .cse41 c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= .cse40 c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= .cse41 c_ULTIMATE.start_main_p6) (or (= (select |c_#memory_int| v_idx_561) 0) (< v_idx_561 c_ULTIMATE.start_main_p2) (<= .cse42 v_idx_561)) (<= .cse37 c_ULTIMATE.start_malloc_ptr) (<= .cse34 c_ULTIMATE.start_main_p6) (let ((.cse46 (select |c_#memory_int| v_idx_559))) (let ((.cse45 (<= .cse50 v_idx_559)) (.cse49 (< v_idx_559 c_ULTIMATE.start_main_p1)) (.cse47 (<= 0 (* 2 .cse46))) (.cse48 (<= 0 .cse46))) (let ((.cse43 (or .cse45 .cse49 (and .cse47 .cse48)))) (or (and .cse43 (< v_idx_565 c_ULTIMATE.start_main_p4)) (let ((.cse44 (select |c_#memory_int| v_idx_565))) (and (<= .cse44 0) (<= (* 2 .cse44) 0) (or .cse45 (and (<= .cse44 .cse46) .cse47 .cse48) .cse49))) (and .cse43 (<= .cse39 v_idx_565)))))) (<= .cse42 c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= .cse35 c_ULTIMATE.start_main_p4) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_553)) (<= .cse36 v_idx_553) (< v_idx_553 c_ULTIMATE.start_main_p6)) (<= c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (<= .cse50 c_ULTIMATE.start_main_p2) (<= .cse38 c_ULTIMATE.start_main_p6))))) is different from false [2019-02-15 11:30:37,160 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-15 11:30:37,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:30:37,161 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:666) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 41 more [2019-02-15 11:30:37,165 INFO L168 Benchmark]: Toolchain (without parser) took 311122.91 ms. Allocated memory was 139.5 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 105.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 591.1 MB. Max. memory is 7.1 GB. [2019-02-15 11:30:37,166 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:30:37,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.94 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 103.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:30:37,167 INFO L168 Benchmark]: Boogie Preprocessor took 25.00 ms. Allocated memory is still 139.5 MB. Free memory was 103.3 MB in the beginning and 102.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-15 11:30:37,168 INFO L168 Benchmark]: RCFGBuilder took 546.20 ms. Allocated memory is still 139.5 MB. Free memory was 102.1 MB in the beginning and 90.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-02-15 11:30:37,169 INFO L168 Benchmark]: TraceAbstraction took 310486.46 ms. Allocated memory was 139.5 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 90.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 575.4 MB. Max. memory is 7.1 GB. [2019-02-15 11:30:37,173 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - 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.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.94 ms. Allocated memory is still 139.5 MB. Free memory was 105.6 MB in the beginning and 103.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.00 ms. Allocated memory is still 139.5 MB. Free memory was 103.3 MB in the beginning and 102.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 546.20 ms. Allocated memory is still 139.5 MB. Free memory was 102.1 MB in the beginning and 90.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 310486.46 ms. Allocated memory was 139.5 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 90.1 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 575.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...