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-3-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 18:07:33,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 18:07:33,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 18:07:33,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 18:07:33,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 18:07:33,738 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 18:07:33,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 18:07:33,745 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 18:07:33,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 18:07:33,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 18:07:33,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 18:07:33,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 18:07:33,759 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 18:07:33,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 18:07:33,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 18:07:33,762 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 18:07:33,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 18:07:33,765 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 18:07:33,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 18:07:33,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 18:07:33,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 18:07:33,771 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 18:07:33,773 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 18:07:33,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 18:07:33,774 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 18:07:33,775 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 18:07:33,776 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 18:07:33,777 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 18:07:33,778 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 18:07:33,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 18:07:33,779 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 18:07:33,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 18:07:33,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 18:07:33,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 18:07:33,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 18:07:33,782 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 18:07:33,782 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-18 18:07:33,795 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 18:07:33,796 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 18:07:33,797 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 18:07:33,797 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 18:07:33,797 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 18:07:33,797 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 18:07:33,798 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 18:07:33,798 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 18:07:33,798 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 18:07:33,798 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 18:07:33,798 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 18:07:33,799 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 18:07:33,799 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 18:07:33,800 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 18:07:33,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 18:07:33,800 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 18:07:33,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 18:07:33,801 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 18:07:33,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 18:07:33,801 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 18:07:33,801 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 18:07:33,801 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 18:07:33,802 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 18:07:33,802 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 18:07:33,802 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 18:07:33,802 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 18:07:33,802 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 18:07:33,803 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 18:07:33,803 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 18:07:33,803 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 18:07:33,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 18:07:33,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 18:07:33,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 18:07:33,804 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 18:07:33,804 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 18:07:33,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 18:07:33,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 18:07:33,805 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 18:07:33,805 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 18:07:33,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 18:07:33,861 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 18:07:33,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 18:07:33,870 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 18:07:33,871 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 18:07:33,872 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl [2019-01-18 18:07:33,872 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-limited.bpl' [2019-01-18 18:07:33,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 18:07:33,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 18:07:33,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:33,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 18:07:33,923 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 18:07:33,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/1) ... [2019-01-18 18:07:33,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/1) ... [2019-01-18 18:07:33,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 18:07:33,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 18:07:33,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 18:07:33,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 18:07:34,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/1) ... [2019-01-18 18:07:34,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/1) ... [2019-01-18 18:07:34,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/1) ... [2019-01-18 18:07:34,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/1) ... [2019-01-18 18:07:34,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/1) ... [2019-01-18 18:07:34,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/1) ... [2019-01-18 18:07:34,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/1) ... [2019-01-18 18:07:34,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 18:07:34,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 18:07:34,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 18:07:34,025 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 18:07:34,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (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-01-18 18:07:34,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 18:07:34,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 18:07:34,305 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 18:07:34,306 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-18 18:07:34,307 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:07:34 BoogieIcfgContainer [2019-01-18 18:07:34,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 18:07:34,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 18:07:34,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 18:07:34,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 18:07:34,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 06:07:33" (1/2) ... [2019-01-18 18:07:34,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697c9d87 and model type speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 06:07:34, skipping insertion in model container [2019-01-18 18:07:34,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 06:07:34" (2/2) ... [2019-01-18 18:07:34,315 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-limited.bpl [2019-01-18 18:07:34,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 18:07:34,333 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-18 18:07:34,350 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-18 18:07:34,387 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 18:07:34,387 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 18:07:34,387 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 18:07:34,387 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 18:07:34,388 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 18:07:34,388 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 18:07:34,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 18:07:34,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 18:07:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-18 18:07:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 18:07:34,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:34,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 18:07:34,413 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:34,420 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-18 18:07:34,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:34,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:34,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:34,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:34,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:34,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:07:34,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:07:34,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:34,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:07:34,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:07:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:07:34,619 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-18 18:07:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:34,833 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-18 18:07:34,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:07:34,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 18:07:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:34,850 INFO L225 Difference]: With dead ends: 17 [2019-01-18 18:07:34,850 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 18:07:34,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:07:34,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 18:07:34,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-18 18:07:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 18:07:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-18 18:07:34,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-18 18:07:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:34,891 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-18 18:07:34,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:07:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-18 18:07:34,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:34,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:34,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:34,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-18 18:07:34,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:34,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:34,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:34,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:34,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:07:34,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:07:34,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:34,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:07:34,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:07:34,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:07:34,941 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-18 18:07:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:07:35,016 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 18:07:35,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:07:35,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 18:07:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:07:35,018 INFO L225 Difference]: With dead ends: 12 [2019-01-18 18:07:35,018 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 18:07:35,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:07:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 18:07:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-18 18:07:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 18:07:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-18 18:07:35,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-18 18:07:35,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:07:35,027 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-18 18:07:35,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:07:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-18 18:07:35,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:07:35,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:07:35,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:07:35,029 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:07:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:35,029 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-18 18:07:35,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:07:35,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:35,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:07:35,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:07:35,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:07:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:07:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:07:35,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:07:35,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:07:35,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:07:35,105 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-18 18:07:35,184 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:07:35,184 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:07:43,476 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:07:43,477 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-01-18 18:07:43,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:07:43,482 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:07:43,823 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 71.43% of their original sizes. [2019-01-18 18:07:43,823 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:07:46,030 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_68 Int) (v_idx_72 Int) (v_idx_73 Int) (v_idx_70 Int) (v_idx_71 Int)) (exists ((v_v_1350_1 Int) (v_b_102_1 Int) (v_v_1344_1 Int) (v_v_1345_1 Int) (v_v_1346_1 Int) (v_v_1348_1 Int) (v_b_104_1 Int) (v_b_103_1 Int) (v_b_105_1 Int)) (let ((.cse0 (+ v_b_104_1 1)) (.cse1 (+ v_b_102_1 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 2))) (and (<= (+ c_ULTIMATE.start_main_p1 3) v_b_105_1) (<= v_b_105_1 .cse0) (or (< v_idx_70 v_b_102_1) (<= v_b_103_1 v_idx_70) (= 0 (select |c_#memory_int| v_idx_70))) (<= v_b_103_1 v_b_104_1) (<= (+ v_b_102_1 2) v_b_105_1) (<= .cse1 v_b_103_1) (or (< v_idx_69 .cse2) (<= v_b_102_1 v_idx_69) (= (select |c_#memory_int| v_idx_69) v_v_1346_1)) (<= v_b_103_1 .cse1) (or (<= c_ULTIMATE.start_main_p1 v_idx_67) (= (select |c_#memory_int| v_idx_67) v_v_1344_1)) (<= .cse0 v_b_105_1) (or (= (select |c_#memory_int| v_idx_68) v_v_1345_1) (<= .cse2 v_idx_68) (< v_idx_68 c_ULTIMATE.start_main_p1)) (<= .cse3 v_b_104_1) (<= .cse1 v_b_104_1) (or (< v_idx_73 v_b_105_1) (= (select |c_#memory_int| v_idx_73) v_v_1350_1)) (<= 0 v_v_1345_1) (<= .cse2 v_b_102_1) (or (<= v_b_105_1 v_idx_72) (< v_idx_72 v_b_104_1) (= 0 (select |c_#memory_int| v_idx_72))) (<= .cse3 v_b_103_1) (<= (+ v_b_103_1 1) v_b_105_1) (<= 0 (* 2 v_v_1345_1)) (or (<= v_b_104_1 v_idx_71) (= (select |c_#memory_int| v_idx_71) v_v_1348_1) (< v_idx_71 v_b_103_1)))))) is different from false [2019-01-18 18:07:48,293 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_78 Int) (v_idx_79 Int) (v_idx_76 Int) (v_idx_77 Int) (v_idx_74 Int) (v_idx_75 Int) (v_idx_80 Int)) (exists ((v_v_1350_1 Int) (v_b_102_1 Int) (v_v_1344_1 Int) (v_v_1345_1 Int) (v_v_1346_1 Int) (v_v_1348_1 Int) (v_b_104_1 Int) (v_b_103_1 Int) (v_b_105_1 Int)) (let ((.cse0 (+ v_b_104_1 1)) (.cse1 (+ v_b_102_1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 2))) (and (<= (+ c_ULTIMATE.start_main_p1 3) v_b_105_1) (<= v_b_105_1 .cse0) (or (= (select |c_#memory_int| v_idx_78) v_v_1348_1) (<= v_b_104_1 v_idx_78) (< v_idx_78 v_b_103_1)) (or (< v_idx_79 v_b_104_1) (= (select |c_#memory_int| v_idx_79) 0) (<= v_b_105_1 v_idx_79)) (<= v_b_103_1 v_b_104_1) (<= (+ v_b_102_1 2) v_b_105_1) (<= .cse1 v_b_103_1) (or (< v_idx_77 v_b_102_1) (= (select |c_#memory_int| v_idx_77) 0) (<= v_b_103_1 v_idx_77)) (or (< v_idx_80 v_b_105_1) (= (select |c_#memory_int| v_idx_80) v_v_1350_1)) (<= v_b_103_1 .cse1) (<= .cse0 v_b_105_1) (<= .cse2 v_b_104_1) (<= .cse1 v_b_104_1) (<= 0 v_v_1345_1) (or (<= v_b_102_1 v_idx_76) (< v_idx_76 .cse3) (= (select |c_#memory_int| v_idx_76) v_v_1346_1)) (<= .cse3 v_b_102_1) (or (= (select |c_#memory_int| v_idx_75) v_v_1345_1) (< v_idx_75 c_ULTIMATE.start_main_p1) (<= .cse3 v_idx_75)) (<= .cse2 v_b_103_1) (<= (+ v_b_103_1 1) v_b_105_1) (or (= (select |c_#memory_int| v_idx_74) v_v_1344_1) (<= c_ULTIMATE.start_main_p1 v_idx_74)) (<= 0 (* 2 v_v_1345_1)))))) is different from false [2019-01-18 18:07:48,350 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:07:48,350 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:07:48,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:07:48,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:07:48,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:07:48,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:07:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:07:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-18 18:07:48,355 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-18 18:07:52,342 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_68 Int) (v_idx_72 Int) (v_idx_73 Int) (v_idx_70 Int) (v_idx_71 Int)) (exists ((v_v_1350_1 Int) (v_b_102_1 Int) (v_v_1344_1 Int) (v_v_1345_1 Int) (v_v_1346_1 Int) (v_v_1348_1 Int) (v_b_104_1 Int) (v_b_103_1 Int) (v_b_105_1 Int)) (let ((.cse0 (+ v_b_104_1 1)) (.cse1 (+ v_b_102_1 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 2))) (and (<= (+ c_ULTIMATE.start_main_p1 3) v_b_105_1) (<= v_b_105_1 .cse0) (or (< v_idx_70 v_b_102_1) (<= v_b_103_1 v_idx_70) (= 0 (select |c_#memory_int| v_idx_70))) (<= v_b_103_1 v_b_104_1) (<= (+ v_b_102_1 2) v_b_105_1) (<= .cse1 v_b_103_1) (or (< v_idx_69 .cse2) (<= v_b_102_1 v_idx_69) (= (select |c_#memory_int| v_idx_69) v_v_1346_1)) (<= v_b_103_1 .cse1) (or (<= c_ULTIMATE.start_main_p1 v_idx_67) (= (select |c_#memory_int| v_idx_67) v_v_1344_1)) (<= .cse0 v_b_105_1) (or (= (select |c_#memory_int| v_idx_68) v_v_1345_1) (<= .cse2 v_idx_68) (< v_idx_68 c_ULTIMATE.start_main_p1)) (<= .cse3 v_b_104_1) (<= .cse1 v_b_104_1) (or (< v_idx_73 v_b_105_1) (= (select |c_#memory_int| v_idx_73) v_v_1350_1)) (<= 0 v_v_1345_1) (<= .cse2 v_b_102_1) (or (<= v_b_105_1 v_idx_72) (< v_idx_72 v_b_104_1) (= 0 (select |c_#memory_int| v_idx_72))) (<= .cse3 v_b_103_1) (<= (+ v_b_103_1 1) v_b_105_1) (<= 0 (* 2 v_v_1345_1)) (or (<= v_b_104_1 v_idx_71) (= (select |c_#memory_int| v_idx_71) v_v_1348_1) (< v_idx_71 v_b_103_1)))))) (forall ((v_idx_78 Int) (v_idx_79 Int) (v_idx_76 Int) (v_idx_77 Int) (v_idx_74 Int) (v_idx_75 Int) (v_idx_80 Int)) (exists ((v_v_1350_1 Int) (v_b_102_1 Int) (v_v_1344_1 Int) (v_v_1345_1 Int) (v_v_1346_1 Int) (v_v_1348_1 Int) (v_b_104_1 Int) (v_b_103_1 Int) (v_b_105_1 Int)) (let ((.cse4 (+ v_b_104_1 1)) (.cse5 (+ v_b_102_1 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 2))) (and (<= (+ c_ULTIMATE.start_main_p1 3) v_b_105_1) (<= v_b_105_1 .cse4) (or (= (select |c_#memory_int| v_idx_78) v_v_1348_1) (<= v_b_104_1 v_idx_78) (< v_idx_78 v_b_103_1)) (or (< v_idx_79 v_b_104_1) (= (select |c_#memory_int| v_idx_79) 0) (<= v_b_105_1 v_idx_79)) (<= v_b_103_1 v_b_104_1) (<= (+ v_b_102_1 2) v_b_105_1) (<= .cse5 v_b_103_1) (or (< v_idx_77 v_b_102_1) (= (select |c_#memory_int| v_idx_77) 0) (<= v_b_103_1 v_idx_77)) (or (< v_idx_80 v_b_105_1) (= (select |c_#memory_int| v_idx_80) v_v_1350_1)) (<= v_b_103_1 .cse5) (<= .cse4 v_b_105_1) (<= .cse6 v_b_104_1) (<= .cse5 v_b_104_1) (<= 0 v_v_1345_1) (or (<= v_b_102_1 v_idx_76) (< v_idx_76 .cse7) (= (select |c_#memory_int| v_idx_76) v_v_1346_1)) (<= .cse7 v_b_102_1) (or (= (select |c_#memory_int| v_idx_75) v_v_1345_1) (< v_idx_75 c_ULTIMATE.start_main_p1) (<= .cse7 v_idx_75)) (<= .cse6 v_b_103_1) (<= (+ v_b_103_1 1) v_b_105_1) (or (= (select |c_#memory_int| v_idx_74) v_v_1344_1) (<= c_ULTIMATE.start_main_p1 v_idx_74)) (<= 0 (* 2 v_v_1345_1))))))) is different from false [2019-01-18 18:08:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:18,971 INFO L93 Difference]: Finished difference Result 11 states and 19 transitions. [2019-01-18 18:08:18,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:08:18,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:08:18,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:18,972 INFO L225 Difference]: With dead ends: 11 [2019-01-18 18:08:18,973 INFO L226 Difference]: Without dead ends: 10 [2019-01-18 18:08:18,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:08:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-18 18:08:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-18 18:08:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 18:08:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-18 18:08:18,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 3 [2019-01-18 18:08:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:18,979 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-01-18 18:08:18,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-01-18 18:08:18,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:18,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:18,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:18,980 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-18 18:08:18,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:18,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:18,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:18,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:18,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:19,232 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-18 18:08:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:19,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:19,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:19,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:08:19,244 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-18 18:08:19,248 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:19,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:22,860 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:08:22,860 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-01-18 18:08:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:22,861 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:08:23,057 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 64.29% of their original sizes. [2019-01-18 18:08:23,057 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:08:25,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_148 Int) (v_idx_149 Int) (v_idx_147 Int) (v_idx_151 Int) (v_idx_152 Int) (v_idx_150 Int) (v_idx_153 Int)) (exists ((v_v_999_2 Int) (v_v_1005_2 Int) (v_v_1001_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int) (v_b_114_2 Int) (v_b_115_2 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ v_b_114_2 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= v_b_114_2 v_idx_151) (= (select |c_#memory_int| v_idx_151) v_v_1003_2) (< v_idx_151 .cse0)) (or (< v_idx_150 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_150) v_v_1002_2) (<= .cse0 v_idx_150)) (or (< v_idx_153 v_b_115_2) (= (select |c_#memory_int| v_idx_153) v_v_1005_2)) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_115_2) (<= v_b_115_2 .cse1) (or (= (select |c_#memory_int| v_idx_149) v_v_1001_2) (<= c_ULTIMATE.start_main_p2 v_idx_149) (< v_idx_149 .cse2)) (<= .cse0 v_b_114_2) (or (= (select |c_#memory_int| v_idx_147) v_v_999_2) (<= c_ULTIMATE.start_main_p1 v_idx_147)) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_115_2) (<= .cse1 v_b_115_2) (or (< v_idx_152 v_b_114_2) (= (select |c_#memory_int| v_idx_152) 0) (<= v_b_115_2 v_idx_152)) (<= (* 2 v_v_1002_2) 0) (<= .cse2 c_ULTIMATE.start_main_p2) (<= v_v_1002_2 0) (or (= (select |c_#memory_int| v_idx_148) 0) (<= .cse2 v_idx_148) (< v_idx_148 c_ULTIMATE.start_main_p1)) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_114_2))))) is different from false [2019-01-18 18:08:27,558 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_159 Int) (v_idx_157 Int) (v_idx_158 Int) (v_idx_160 Int) (v_idx_155 Int) (v_idx_156 Int) (v_idx_154 Int)) (exists ((v_v_999_2 Int) (v_b_112_2 Int) (v_v_1005_2 Int) (v_v_1001_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int) (v_b_114_2 Int) (v_b_113_2 Int) (v_b_115_2 Int)) (let ((.cse2 (+ v_b_114_2 1)) (.cse0 (+ v_b_112_2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 2))) (and (<= .cse0 v_b_114_2) (or (<= v_b_115_2 v_idx_159) (= (select |c_#memory_int| v_idx_159) 0) (< v_idx_159 v_b_114_2)) (or (= (select |c_#memory_int| v_idx_160) v_v_1005_2) (< v_idx_160 v_b_115_2)) (<= .cse1 v_b_112_2) (<= v_b_113_2 v_b_114_2) (<= (+ v_b_112_2 2) v_b_115_2) (<= (+ v_b_113_2 1) v_b_115_2) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_115_2) (<= .cse0 v_b_113_2) (<= v_b_115_2 .cse2) (<= .cse3 v_b_113_2) (or (< v_idx_155 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_155)) (<= .cse1 v_idx_155)) (or (<= c_ULTIMATE.start_main_p1 v_idx_154) (= (select |c_#memory_int| v_idx_154) v_v_999_2)) (<= .cse2 v_b_115_2) (<= v_b_113_2 .cse0) (or (= (select |c_#memory_int| v_idx_156) v_v_1001_2) (<= v_b_112_2 v_idx_156) (< v_idx_156 .cse1)) (<= (* 2 v_v_1002_2) 0) (or (= (select |c_#memory_int| v_idx_158) v_v_1003_2) (< v_idx_158 v_b_113_2) (<= v_b_114_2 v_idx_158)) (or (<= v_b_113_2 v_idx_157) (< v_idx_157 v_b_112_2) (= (select |c_#memory_int| v_idx_157) v_v_1002_2)) (<= v_v_1002_2 0) (<= .cse3 v_b_114_2))))) is different from false [2019-01-18 18:08:27,619 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:08:27,619 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:08:27,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:08:27,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:08:27,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:27,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:27,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:27,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-18 18:08:27,621 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 4 states. [2019-01-18 18:08:30,030 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_159 Int) (v_idx_157 Int) (v_idx_158 Int) (v_idx_160 Int) (v_idx_155 Int) (v_idx_156 Int) (v_idx_154 Int)) (exists ((v_v_999_2 Int) (v_b_112_2 Int) (v_v_1005_2 Int) (v_v_1001_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int) (v_b_114_2 Int) (v_b_113_2 Int) (v_b_115_2 Int)) (let ((.cse2 (+ v_b_114_2 1)) (.cse0 (+ v_b_112_2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 2))) (and (<= .cse0 v_b_114_2) (or (<= v_b_115_2 v_idx_159) (= (select |c_#memory_int| v_idx_159) 0) (< v_idx_159 v_b_114_2)) (or (= (select |c_#memory_int| v_idx_160) v_v_1005_2) (< v_idx_160 v_b_115_2)) (<= .cse1 v_b_112_2) (<= v_b_113_2 v_b_114_2) (<= (+ v_b_112_2 2) v_b_115_2) (<= (+ v_b_113_2 1) v_b_115_2) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_115_2) (<= .cse0 v_b_113_2) (<= v_b_115_2 .cse2) (<= .cse3 v_b_113_2) (or (< v_idx_155 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_155)) (<= .cse1 v_idx_155)) (or (<= c_ULTIMATE.start_main_p1 v_idx_154) (= (select |c_#memory_int| v_idx_154) v_v_999_2)) (<= .cse2 v_b_115_2) (<= v_b_113_2 .cse0) (or (= (select |c_#memory_int| v_idx_156) v_v_1001_2) (<= v_b_112_2 v_idx_156) (< v_idx_156 .cse1)) (<= (* 2 v_v_1002_2) 0) (or (= (select |c_#memory_int| v_idx_158) v_v_1003_2) (< v_idx_158 v_b_113_2) (<= v_b_114_2 v_idx_158)) (or (<= v_b_113_2 v_idx_157) (< v_idx_157 v_b_112_2) (= (select |c_#memory_int| v_idx_157) v_v_1002_2)) (<= v_v_1002_2 0) (<= .cse3 v_b_114_2))))) (forall ((v_idx_148 Int) (v_idx_149 Int) (v_idx_147 Int) (v_idx_151 Int) (v_idx_152 Int) (v_idx_150 Int) (v_idx_153 Int)) (exists ((v_v_999_2 Int) (v_v_1005_2 Int) (v_v_1001_2 Int) (v_v_1002_2 Int) (v_v_1003_2 Int) (v_b_114_2 Int) (v_b_115_2 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p2 1)) (.cse5 (+ v_b_114_2 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= v_b_114_2 v_idx_151) (= (select |c_#memory_int| v_idx_151) v_v_1003_2) (< v_idx_151 .cse4)) (or (< v_idx_150 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_150) v_v_1002_2) (<= .cse4 v_idx_150)) (or (< v_idx_153 v_b_115_2) (= (select |c_#memory_int| v_idx_153) v_v_1005_2)) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_115_2) (<= v_b_115_2 .cse5) (or (= (select |c_#memory_int| v_idx_149) v_v_1001_2) (<= c_ULTIMATE.start_main_p2 v_idx_149) (< v_idx_149 .cse6)) (<= .cse4 v_b_114_2) (or (= (select |c_#memory_int| v_idx_147) v_v_999_2) (<= c_ULTIMATE.start_main_p1 v_idx_147)) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_115_2) (<= .cse5 v_b_115_2) (or (< v_idx_152 v_b_114_2) (= (select |c_#memory_int| v_idx_152) 0) (<= v_b_115_2 v_idx_152)) (<= (* 2 v_v_1002_2) 0) (<= .cse6 c_ULTIMATE.start_main_p2) (<= v_v_1002_2 0) (or (= (select |c_#memory_int| v_idx_148) 0) (<= .cse6 v_idx_148) (< v_idx_148 c_ULTIMATE.start_main_p1)) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_114_2)))))) is different from false [2019-01-18 18:08:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:08:40,697 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-01-18 18:08:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:08:40,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:08:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:08:40,698 INFO L225 Difference]: With dead ends: 12 [2019-01-18 18:08:40,698 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 18:08:40,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:08:40,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 18:08:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-18 18:08:40,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 18:08:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-18 18:08:40,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 3 [2019-01-18 18:08:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:08:40,707 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-01-18 18:08:40,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:08:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-01-18 18:08:40,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 18:08:40,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:08:40,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 18:08:40,710 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:08:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:40,710 INFO L82 PathProgramCache]: Analyzing trace with hash 30178, now seen corresponding path program 1 times [2019-01-18 18:08:40,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:08:40,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:40,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:08:40,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:08:40,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:08:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:08:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:08:40,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:08:40,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:08:40,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 18:08:40,816 INFO L207 CegarAbsIntRunner]: [0], [12], [15] [2019-01-18 18:08:40,818 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:08:40,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:08:44,202 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:08:44,203 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-01-18 18:08:44,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:08:44,203 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:08:44,405 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 64.29% of their original sizes. [2019-01-18 18:08:44,405 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:08:46,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_229 Int) (v_idx_227 Int) (v_idx_228 Int) (v_idx_232 Int) (v_idx_233 Int) (v_idx_230 Int) (v_idx_231 Int)) (exists ((v_b_122_3 Int) (v_v_1290_3 Int) (v_v_1289_3 Int) (v_v_1286_3 Int) (v_v_1288_3 Int) (v_b_123_3 Int) (v_v_1284_3 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse2 (+ v_b_122_3 1))) (and (<= .cse0 c_ULTIMATE.start_main_p3) (or (<= c_ULTIMATE.start_main_p1 v_idx_227) (= (select |c_#memory_int| v_idx_227) v_v_1284_3)) (<= 0 v_v_1289_3) (or (< v_idx_228 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_228)) (<= .cse1 v_idx_228)) (<= v_b_123_3 c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_231) v_v_1288_3) (<= c_ULTIMATE.start_main_p3 v_idx_231) (< v_idx_231 v_b_123_3)) (or (< v_idx_229 .cse1) (<= v_b_122_3 v_idx_229) (= (select |c_#memory_int| v_idx_229) v_v_1286_3)) (<= v_b_123_3 .cse2) (<= .cse1 v_b_122_3) (or (< v_idx_233 .cse3) (= (select |c_#memory_int| v_idx_233) v_v_1290_3)) (<= .cse2 c_ULTIMATE.start_main_p3) (or (< v_idx_230 v_b_122_3) (<= v_b_123_3 v_idx_230) (= 0 (select |c_#memory_int| v_idx_230))) (or (= (select |c_#memory_int| v_idx_232) v_v_1289_3) (< v_idx_232 c_ULTIMATE.start_main_p3) (<= .cse3 v_idx_232)) (<= 0 (* 2 v_v_1289_3)) (<= .cse0 v_b_123_3) (<= .cse2 v_b_123_3))))) is different from false [2019-01-18 18:08:49,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_236 Int) (v_idx_237 Int) (v_idx_234 Int) (v_idx_235 Int) (v_idx_238 Int) (v_idx_239 Int) (v_idx_240 Int)) (exists ((v_b_122_3 Int) (v_v_1290_3 Int) (v_v_1289_3 Int) (v_v_1286_3 Int) (v_v_1288_3 Int) (v_b_124_3 Int) (v_b_123_3 Int) (v_b_125_3 Int) (v_v_1284_3 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 2)) (.cse1 (+ v_b_124_3 1)) (.cse2 (+ v_b_122_3 1))) (and (or (<= c_ULTIMATE.start_main_p1 v_idx_234) (= (select |c_#memory_int| v_idx_234) v_v_1284_3)) (or (<= v_b_123_3 v_idx_237) (< v_idx_237 v_b_122_3) (= 0 (select |c_#memory_int| v_idx_237))) (<= 0 v_v_1289_3) (or (= 0 (select |c_#memory_int| v_idx_235)) (<= .cse0 v_idx_235) (< v_idx_235 c_ULTIMATE.start_main_p1)) (<= .cse1 v_b_125_3) (<= .cse2 v_b_124_3) (<= .cse3 v_b_124_3) (or (<= v_b_125_3 v_idx_239) (< v_idx_239 v_b_124_3) (= (select |c_#memory_int| v_idx_239) v_v_1289_3)) (or (= (select |c_#memory_int| v_idx_240) v_v_1290_3) (< v_idx_240 v_b_125_3)) (or (< v_idx_236 .cse0) (= (select |c_#memory_int| v_idx_236) v_v_1286_3) (<= v_b_122_3 v_idx_236)) (<= v_b_123_3 .cse2) (<= v_b_123_3 v_b_124_3) (<= (+ v_b_122_3 2) v_b_125_3) (<= .cse0 v_b_122_3) (<= (+ v_b_123_3 1) v_b_125_3) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_125_3) (or (<= v_b_124_3 v_idx_238) (= (select |c_#memory_int| v_idx_238) v_v_1288_3) (< v_idx_238 v_b_123_3)) (<= 0 (* 2 v_v_1289_3)) (<= .cse3 v_b_123_3) (<= v_b_125_3 .cse1) (<= .cse2 v_b_123_3))))) is different from false [2019-01-18 18:08:49,208 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-18 18:08:49,208 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:08:49,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:08:49,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-18 18:08:49,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:08:49,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 18:08:49,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 18:08:49,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2019-01-18 18:08:49,210 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 4 states. [2019-01-18 18:08:51,763 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_229 Int) (v_idx_227 Int) (v_idx_228 Int) (v_idx_232 Int) (v_idx_233 Int) (v_idx_230 Int) (v_idx_231 Int)) (exists ((v_b_122_3 Int) (v_v_1290_3 Int) (v_v_1289_3 Int) (v_v_1286_3 Int) (v_v_1288_3 Int) (v_b_123_3 Int) (v_v_1284_3 Int)) (let ((.cse1 (+ c_ULTIMATE.start_main_p1 1)) (.cse3 (+ c_ULTIMATE.start_main_p3 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse2 (+ v_b_122_3 1))) (and (<= .cse0 c_ULTIMATE.start_main_p3) (or (<= c_ULTIMATE.start_main_p1 v_idx_227) (= (select |c_#memory_int| v_idx_227) v_v_1284_3)) (<= 0 v_v_1289_3) (or (< v_idx_228 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_228)) (<= .cse1 v_idx_228)) (<= v_b_123_3 c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_231) v_v_1288_3) (<= c_ULTIMATE.start_main_p3 v_idx_231) (< v_idx_231 v_b_123_3)) (or (< v_idx_229 .cse1) (<= v_b_122_3 v_idx_229) (= (select |c_#memory_int| v_idx_229) v_v_1286_3)) (<= v_b_123_3 .cse2) (<= .cse1 v_b_122_3) (or (< v_idx_233 .cse3) (= (select |c_#memory_int| v_idx_233) v_v_1290_3)) (<= .cse2 c_ULTIMATE.start_main_p3) (or (< v_idx_230 v_b_122_3) (<= v_b_123_3 v_idx_230) (= 0 (select |c_#memory_int| v_idx_230))) (or (= (select |c_#memory_int| v_idx_232) v_v_1289_3) (< v_idx_232 c_ULTIMATE.start_main_p3) (<= .cse3 v_idx_232)) (<= 0 (* 2 v_v_1289_3)) (<= .cse0 v_b_123_3) (<= .cse2 v_b_123_3))))) (forall ((v_idx_236 Int) (v_idx_237 Int) (v_idx_234 Int) (v_idx_235 Int) (v_idx_238 Int) (v_idx_239 Int) (v_idx_240 Int)) (exists ((v_b_122_3 Int) (v_v_1290_3 Int) (v_v_1289_3 Int) (v_v_1286_3 Int) (v_v_1288_3 Int) (v_b_124_3 Int) (v_b_123_3 Int) (v_b_125_3 Int) (v_v_1284_3 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p1 1)) (.cse7 (+ c_ULTIMATE.start_main_p1 2)) (.cse5 (+ v_b_124_3 1)) (.cse6 (+ v_b_122_3 1))) (and (or (<= c_ULTIMATE.start_main_p1 v_idx_234) (= (select |c_#memory_int| v_idx_234) v_v_1284_3)) (or (<= v_b_123_3 v_idx_237) (< v_idx_237 v_b_122_3) (= 0 (select |c_#memory_int| v_idx_237))) (<= 0 v_v_1289_3) (or (= 0 (select |c_#memory_int| v_idx_235)) (<= .cse4 v_idx_235) (< v_idx_235 c_ULTIMATE.start_main_p1)) (<= .cse5 v_b_125_3) (<= .cse6 v_b_124_3) (<= .cse7 v_b_124_3) (or (<= v_b_125_3 v_idx_239) (< v_idx_239 v_b_124_3) (= (select |c_#memory_int| v_idx_239) v_v_1289_3)) (or (= (select |c_#memory_int| v_idx_240) v_v_1290_3) (< v_idx_240 v_b_125_3)) (or (< v_idx_236 .cse4) (= (select |c_#memory_int| v_idx_236) v_v_1286_3) (<= v_b_122_3 v_idx_236)) (<= v_b_123_3 .cse6) (<= v_b_123_3 v_b_124_3) (<= (+ v_b_122_3 2) v_b_125_3) (<= .cse4 v_b_122_3) (<= (+ v_b_123_3 1) v_b_125_3) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_125_3) (or (<= v_b_124_3 v_idx_238) (= (select |c_#memory_int| v_idx_238) v_v_1288_3) (< v_idx_238 v_b_123_3)) (<= 0 (* 2 v_v_1289_3)) (<= .cse7 v_b_123_3) (<= v_b_125_3 .cse5) (<= .cse6 v_b_123_3)))))) is different from false [2019-01-18 18:09:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:02,296 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-01-18 18:09:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 18:09:02,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 18:09:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:02,297 INFO L225 Difference]: With dead ends: 12 [2019-01-18 18:09:02,297 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 18:09:02,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:09:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 18:09:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-18 18:09:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 18:09:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2019-01-18 18:09:02,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 3 [2019-01-18 18:09:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:02,305 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 18 transitions. [2019-01-18 18:09:02,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 18:09:02,305 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 18 transitions. [2019-01-18 18:09:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:09:02,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:02,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:09:02,306 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:02,306 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-18 18:09:02,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:02,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:02,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:02,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:02,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:02,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 18:09:02,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 18:09:02,342 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:02,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 18:09:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 18:09:02,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:09:02,343 INFO L87 Difference]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2019-01-18 18:09:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:02,387 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2019-01-18 18:09:02,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:09:02,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-18 18:09:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:02,389 INFO L225 Difference]: With dead ends: 12 [2019-01-18 18:09:02,389 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 18:09:02,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 18:09:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 18:09:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-18 18:09:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 18:09:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-01-18 18:09:02,396 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 4 [2019-01-18 18:09:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:02,396 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-01-18 18:09:02,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 18:09:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-01-18 18:09:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:09:02,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:02,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:09:02,397 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:02,398 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-18 18:09:02,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:02,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:02,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:02,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:02,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:02,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:02,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:02,523 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:09:02,523 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-18 18:09:02,524 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:02,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:06,123 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:09:06,123 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:09:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:06,123 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:09:06,331 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 61.9% of their original sizes. [2019-01-18 18:09:06,331 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:09:08,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_346 Int) (v_idx_344 Int) (v_idx_345 Int) (v_idx_342 Int) (v_idx_343 Int) (v_idx_340 Int) (v_idx_341 Int)) (exists ((v_v_1057_4 Int) (v_v_1058_4 Int) (v_v_1062_4 Int) (v_v_1060_4 Int) (v_v_1056_4 Int) (v_b_102_4 Int) (v_b_103_4 Int)) (let ((.cse2 (+ v_b_102_4 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (or (= 0 (select |c_#memory_int| v_idx_345)) (<= v_b_103_4 v_idx_345) (< v_idx_345 v_b_102_4)) (or (= (select |c_#memory_int| v_idx_341) v_v_1057_4) (< v_idx_341 c_ULTIMATE.start_main_p1) (<= .cse0 v_idx_341)) (or (= (select |c_#memory_int| v_idx_343) 0) (<= .cse1 v_idx_343) (< v_idx_343 c_ULTIMATE.start_main_p2)) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_103_4) (<= .cse1 v_b_102_4) (<= 0 (* 2 v_v_1057_4)) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_103_4) (or (< v_idx_342 .cse0) (= (select |c_#memory_int| v_idx_342) v_v_1058_4) (<= c_ULTIMATE.start_main_p2 v_idx_342)) (or (<= c_ULTIMATE.start_main_p1 v_idx_340) (= (select |c_#memory_int| v_idx_340) v_v_1056_4)) (<= v_b_103_4 .cse2) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_102_4) (or (< v_idx_346 v_b_103_4) (= (select |c_#memory_int| v_idx_346) v_v_1062_4)) (<= .cse2 v_b_103_4) (<= .cse0 c_ULTIMATE.start_main_p2) (<= 0 v_v_1057_4) (or (<= v_b_102_4 v_idx_344) (< v_idx_344 .cse1) (= (select |c_#memory_int| v_idx_344) v_v_1060_4)))))) is different from false [2019-01-18 18:09:11,460 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_347 Int) (v_idx_348 Int) (v_idx_349 Int) (v_idx_350 Int) (v_idx_353 Int) (v_idx_351 Int) (v_idx_352 Int)) (exists ((v_v_1057_4 Int) (v_v_1058_4 Int) (v_v_1062_4 Int) (v_v_1060_4 Int) (v_v_1056_4 Int) (v_b_102_4 Int) (v_b_103_4 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ v_b_102_4 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p2 2) v_b_103_4) (or (= 0 (select |c_#memory_int| v_idx_350)) (<= .cse0 v_idx_350) (< v_idx_350 c_ULTIMATE.start_main_p2)) (<= .cse0 v_b_102_4) (<= 0 (* 2 v_v_1057_4)) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_103_4) (or (= (select |c_#memory_int| v_idx_347) v_v_1056_4) (<= c_ULTIMATE.start_main_p1 v_idx_347)) (or (= 0 (select |c_#memory_int| v_idx_352)) (< v_idx_352 v_b_102_4) (<= v_b_103_4 v_idx_352)) (or (< v_idx_353 v_b_103_4) (= (select |c_#memory_int| v_idx_353) v_v_1062_4)) (or (< v_idx_351 .cse0) (= (select |c_#memory_int| v_idx_351) v_v_1060_4) (<= v_b_102_4 v_idx_351)) (<= v_b_103_4 .cse1) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_102_4) (<= .cse1 v_b_103_4) (or (<= c_ULTIMATE.start_main_p2 v_idx_349) (= (select |c_#memory_int| v_idx_349) v_v_1058_4) (< v_idx_349 .cse2)) (<= .cse2 c_ULTIMATE.start_main_p2) (<= 0 v_v_1057_4) (or (= (select |c_#memory_int| v_idx_348) v_v_1057_4) (< v_idx_348 c_ULTIMATE.start_main_p1) (<= .cse2 v_idx_348)))))) is different from false [2019-01-18 18:09:14,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_357 Int) (v_idx_358 Int) (v_idx_355 Int) (v_idx_356 Int) (v_idx_359 Int) (v_idx_360 Int) (v_idx_354 Int)) (exists ((v_v_43_4 Int) (v_b_22_4 Int) (v_v_41_4 Int) (v_b_24_4 Int) (v_b_23_4 Int) (v_b_19_4 Int) (v_v_38_4 Int) (v_v_35_4 Int)) (let ((.cse2 (+ v_b_24_4 1)) (.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ v_b_22_4 1))) (and (<= (+ v_b_19_4 1) v_b_22_4) (<= .cse0 v_b_22_4) (or (< v_idx_360 v_b_23_4) (= (select |c_#memory_int| v_idx_360) v_v_43_4)) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_23_4) (<= (+ v_b_24_4 2) v_b_22_4) (<= v_b_23_4 .cse1) (<= v_b_19_4 .cse2) (<= .cse2 v_b_19_4) (or (= 0 (select |c_#memory_int| v_idx_357)) (<= .cse0 v_idx_357) (< v_idx_357 c_ULTIMATE.start_main_p2)) (<= (+ v_b_24_4 3) v_b_23_4) (or (<= v_b_24_4 v_idx_354) (= (select |c_#memory_int| v_idx_354) v_v_35_4)) (<= .cse2 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_358) v_v_41_4) (<= v_b_22_4 v_idx_358) (< v_idx_358 .cse0)) (<= (+ v_b_19_4 2) v_b_23_4) (or (< v_idx_356 v_b_19_4) (<= c_ULTIMATE.start_main_p2 v_idx_356) (= v_v_38_4 (select |c_#memory_int| v_idx_356))) (<= .cse1 v_b_23_4) (<= v_b_19_4 c_ULTIMATE.start_main_p2) (or (<= v_b_23_4 v_idx_359) (= 0 (select |c_#memory_int| v_idx_359)) (< v_idx_359 v_b_22_4)) (or (= 0 (select |c_#memory_int| v_idx_355)) (< v_idx_355 v_b_24_4) (<= v_b_19_4 v_idx_355)))))) is different from false [2019-01-18 18:09:14,565 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-18 18:09:14,565 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:09:14,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:09:14,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-01-18 18:09:14,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:14,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:09:14,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:09:14,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:09:14,567 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 5 states. [2019-01-18 18:09:16,988 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_347 Int) (v_idx_348 Int) (v_idx_349 Int) (v_idx_350 Int) (v_idx_353 Int) (v_idx_351 Int) (v_idx_352 Int)) (exists ((v_v_1057_4 Int) (v_v_1058_4 Int) (v_v_1062_4 Int) (v_v_1060_4 Int) (v_v_1056_4 Int) (v_b_102_4 Int) (v_b_103_4 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ v_b_102_4 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1))) (and (<= (+ c_ULTIMATE.start_main_p2 2) v_b_103_4) (or (= 0 (select |c_#memory_int| v_idx_350)) (<= .cse0 v_idx_350) (< v_idx_350 c_ULTIMATE.start_main_p2)) (<= .cse0 v_b_102_4) (<= 0 (* 2 v_v_1057_4)) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_103_4) (or (= (select |c_#memory_int| v_idx_347) v_v_1056_4) (<= c_ULTIMATE.start_main_p1 v_idx_347)) (or (= 0 (select |c_#memory_int| v_idx_352)) (< v_idx_352 v_b_102_4) (<= v_b_103_4 v_idx_352)) (or (< v_idx_353 v_b_103_4) (= (select |c_#memory_int| v_idx_353) v_v_1062_4)) (or (< v_idx_351 .cse0) (= (select |c_#memory_int| v_idx_351) v_v_1060_4) (<= v_b_102_4 v_idx_351)) (<= v_b_103_4 .cse1) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_102_4) (<= .cse1 v_b_103_4) (or (<= c_ULTIMATE.start_main_p2 v_idx_349) (= (select |c_#memory_int| v_idx_349) v_v_1058_4) (< v_idx_349 .cse2)) (<= .cse2 c_ULTIMATE.start_main_p2) (<= 0 v_v_1057_4) (or (= (select |c_#memory_int| v_idx_348) v_v_1057_4) (< v_idx_348 c_ULTIMATE.start_main_p1) (<= .cse2 v_idx_348)))))) (forall ((v_idx_357 Int) (v_idx_358 Int) (v_idx_355 Int) (v_idx_356 Int) (v_idx_359 Int) (v_idx_360 Int) (v_idx_354 Int)) (exists ((v_v_43_4 Int) (v_b_22_4 Int) (v_v_41_4 Int) (v_b_24_4 Int) (v_b_23_4 Int) (v_b_19_4 Int) (v_v_38_4 Int) (v_v_35_4 Int)) (let ((.cse5 (+ v_b_24_4 1)) (.cse3 (+ c_ULTIMATE.start_main_p2 1)) (.cse4 (+ v_b_22_4 1))) (and (<= (+ v_b_19_4 1) v_b_22_4) (<= .cse3 v_b_22_4) (or (< v_idx_360 v_b_23_4) (= (select |c_#memory_int| v_idx_360) v_v_43_4)) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_23_4) (<= (+ v_b_24_4 2) v_b_22_4) (<= v_b_23_4 .cse4) (<= v_b_19_4 .cse5) (<= .cse5 v_b_19_4) (or (= 0 (select |c_#memory_int| v_idx_357)) (<= .cse3 v_idx_357) (< v_idx_357 c_ULTIMATE.start_main_p2)) (<= (+ v_b_24_4 3) v_b_23_4) (or (<= v_b_24_4 v_idx_354) (= (select |c_#memory_int| v_idx_354) v_v_35_4)) (<= .cse5 c_ULTIMATE.start_main_p2) (or (= (select |c_#memory_int| v_idx_358) v_v_41_4) (<= v_b_22_4 v_idx_358) (< v_idx_358 .cse3)) (<= (+ v_b_19_4 2) v_b_23_4) (or (< v_idx_356 v_b_19_4) (<= c_ULTIMATE.start_main_p2 v_idx_356) (= v_v_38_4 (select |c_#memory_int| v_idx_356))) (<= .cse4 v_b_23_4) (<= v_b_19_4 c_ULTIMATE.start_main_p2) (or (<= v_b_23_4 v_idx_359) (= 0 (select |c_#memory_int| v_idx_359)) (< v_idx_359 v_b_22_4)) (or (= 0 (select |c_#memory_int| v_idx_355)) (< v_idx_355 v_b_24_4) (<= v_b_19_4 v_idx_355)))))) (forall ((v_idx_346 Int) (v_idx_344 Int) (v_idx_345 Int) (v_idx_342 Int) (v_idx_343 Int) (v_idx_340 Int) (v_idx_341 Int)) (exists ((v_v_1057_4 Int) (v_v_1058_4 Int) (v_v_1062_4 Int) (v_v_1060_4 Int) (v_v_1056_4 Int) (v_b_102_4 Int) (v_b_103_4 Int)) (let ((.cse8 (+ v_b_102_4 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 1)) (.cse7 (+ c_ULTIMATE.start_main_p2 1))) (and (or (= 0 (select |c_#memory_int| v_idx_345)) (<= v_b_103_4 v_idx_345) (< v_idx_345 v_b_102_4)) (or (= (select |c_#memory_int| v_idx_341) v_v_1057_4) (< v_idx_341 c_ULTIMATE.start_main_p1) (<= .cse6 v_idx_341)) (or (= (select |c_#memory_int| v_idx_343) 0) (<= .cse7 v_idx_343) (< v_idx_343 c_ULTIMATE.start_main_p2)) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_103_4) (<= .cse7 v_b_102_4) (<= 0 (* 2 v_v_1057_4)) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_103_4) (or (< v_idx_342 .cse6) (= (select |c_#memory_int| v_idx_342) v_v_1058_4) (<= c_ULTIMATE.start_main_p2 v_idx_342)) (or (<= c_ULTIMATE.start_main_p1 v_idx_340) (= (select |c_#memory_int| v_idx_340) v_v_1056_4)) (<= v_b_103_4 .cse8) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_102_4) (or (< v_idx_346 v_b_103_4) (= (select |c_#memory_int| v_idx_346) v_v_1062_4)) (<= .cse8 v_b_103_4) (<= .cse6 c_ULTIMATE.start_main_p2) (<= 0 v_v_1057_4) (or (<= v_b_102_4 v_idx_344) (< v_idx_344 .cse7) (= (select |c_#memory_int| v_idx_344) v_v_1060_4))))))) is different from false [2019-01-18 18:09:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:35,260 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-01-18 18:09:35,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:09:35,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-18 18:09:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:35,261 INFO L225 Difference]: With dead ends: 12 [2019-01-18 18:09:35,261 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 18:09:35,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=9, Invalid=5, Unknown=4, NotChecked=12, Total=30 [2019-01-18 18:09:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 18:09:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-18 18:09:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 18:09:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 21 transitions. [2019-01-18 18:09:35,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 21 transitions. Word has length 4 [2019-01-18 18:09:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:35,270 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 21 transitions. [2019-01-18 18:09:35,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:09:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 21 transitions. [2019-01-18 18:09:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:09:35,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:35,271 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-18 18:09:35,271 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:35,271 INFO L82 PathProgramCache]: Analyzing trace with hash 929488, now seen corresponding path program 2 times [2019-01-18 18:09:35,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:35,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:09:35,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:35,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:35,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:35,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:35,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:09:35,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:09:35,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:35,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:09:35,346 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:09:35,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:09:35,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 18:09:35,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:09:35,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:09:35,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-18 18:09:35,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 21 [2019-01-18 18:09:35,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-01-18 18:09:35,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:35,525 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:35,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 18:09:35,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:35,548 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:19, output treesize:22 [2019-01-18 18:09:35,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-18 18:09:35,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:35,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:35,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 18:09:35,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 18:09:35,869 INFO L303 Elim1Store]: Index analysis took 150 ms [2019-01-18 18:09:35,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-18 18:09:35,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 18:09:35,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-18 18:09:35,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-18 18:09:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:35,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:09:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:36,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 18:09:36,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2019-01-18 18:09:36,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:36,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:09:36,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:09:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:09:36,013 INFO L87 Difference]: Start difference. First operand 11 states and 21 transitions. Second operand 5 states. [2019-01-18 18:09:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:09:36,117 INFO L93 Difference]: Finished difference Result 18 states and 40 transitions. [2019-01-18 18:09:36,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:09:36,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-18 18:09:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:09:36,119 INFO L225 Difference]: With dead ends: 18 [2019-01-18 18:09:36,119 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 18:09:36,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 18:09:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 18:09:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-01-18 18:09:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 18:09:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2019-01-18 18:09:36,131 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 4 [2019-01-18 18:09:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:09:36,131 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 35 transitions. [2019-01-18 18:09:36,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:09:36,131 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 35 transitions. [2019-01-18 18:09:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:09:36,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:09:36,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:09:36,132 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:09:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-18 18:09:36,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:09:36,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:36,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:09:36,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:09:36,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:09:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:09:36,308 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-18 18:09:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:09:36,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:09:36,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:09:36,342 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:09:36,343 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-18 18:09:36,344 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:09:36,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:09:47,109 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:09:47,109 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-01-18 18:09:47,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:09:47,110 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:09:47,479 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 61.9% of their original sizes. [2019-01-18 18:09:47,479 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:09:49,964 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_465 Int) (v_idx_466 Int) (v_idx_460 Int) (v_idx_463 Int) (v_idx_464 Int) (v_idx_461 Int) (v_idx_462 Int)) (exists ((v_b_319_1 Int) (v_v_3591_1 Int) (v_b_318_1 Int) (v_v_3585_1 Int) (v_v_3586_1 Int) (v_v_3587_1 Int) (v_v_3588_1 Int) (v_v_3589_1 Int)) (let ((.cse2 (+ v_b_318_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_461 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_461) v_v_3586_1) (<= .cse0 v_idx_461)) (or (< v_idx_463 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_463) v_v_3588_1) (<= .cse1 v_idx_463)) (<= v_b_319_1 .cse2) (or (< v_idx_465 v_b_318_1) (= (select |c_#memory_int| v_idx_465) 0) (<= v_b_319_1 v_idx_465)) (<= .cse2 v_b_319_1) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_318_1) (or (= (select |c_#memory_int| v_idx_466) v_v_3591_1) (< v_idx_466 v_b_319_1)) (or (<= c_ULTIMATE.start_main_p2 v_idx_462) (< v_idx_462 .cse0) (= (select |c_#memory_int| v_idx_462) v_v_3587_1)) (<= v_v_3588_1 0) (<= .cse1 v_b_318_1) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_319_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_460) (= (select |c_#memory_int| v_idx_460) v_v_3585_1)) (<= 0 v_v_3586_1) (<= v_v_3588_1 v_v_3586_1) (<= 0 (* 2 v_v_3586_1)) (or (<= v_b_318_1 v_idx_464) (< v_idx_464 .cse1) (= (select |c_#memory_int| v_idx_464) v_v_3589_1)) (<= .cse0 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_319_1) (<= (* 2 v_v_3588_1) 0))))) is different from false [2019-01-18 18:09:52,402 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_467 Int) (v_idx_468 Int) (v_idx_469 Int) (v_idx_470 Int) (v_idx_471 Int) (v_idx_472 Int) (v_idx_473 Int)) (exists ((v_b_319_1 Int) (v_v_3591_1 Int) (v_b_318_1 Int) (v_v_3585_1 Int) (v_v_3586_1 Int) (v_v_3587_1 Int) (v_v_3588_1 Int) (v_v_3589_1 Int)) (let ((.cse0 (+ v_b_318_1 1)) (.cse2 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= c_ULTIMATE.start_main_p1 v_idx_467) (= (select |c_#memory_int| v_idx_467) v_v_3585_1)) (<= v_b_319_1 .cse0) (<= .cse0 v_b_319_1) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_318_1) (or (= (select |c_#memory_int| v_idx_469) v_v_3587_1) (<= c_ULTIMATE.start_main_p2 v_idx_469) (< v_idx_469 .cse1)) (or (< v_idx_468 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_468) v_v_3586_1) (<= .cse1 v_idx_468)) (or (= (select |c_#memory_int| v_idx_471) v_v_3589_1) (<= v_b_318_1 v_idx_471) (< v_idx_471 .cse2)) (<= v_v_3588_1 0) (<= .cse2 v_b_318_1) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_319_1) (<= 0 v_v_3586_1) (<= v_v_3588_1 v_v_3586_1) (or (= (select |c_#memory_int| v_idx_473) v_v_3591_1) (< v_idx_473 v_b_319_1)) (or (< v_idx_472 v_b_318_1) (<= v_b_319_1 v_idx_472) (= (select |c_#memory_int| v_idx_472) 0)) (or (< v_idx_470 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_470) v_v_3588_1) (<= .cse2 v_idx_470)) (<= 0 (* 2 v_v_3586_1)) (<= .cse1 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_319_1) (<= (* 2 v_v_3588_1) 0))))) is different from false [2019-01-18 18:09:56,010 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_478 Int) (v_idx_479 Int) (v_idx_476 Int) (v_idx_477 Int) (v_idx_480 Int) (v_idx_474 Int) (v_idx_475 Int)) (exists ((v_b_317_1 Int) (v_b_316_1 Int) (v_v_3591_1 Int) (v_b_319_1 Int) (v_b_318_1 Int) (v_v_3585_1 Int) (v_v_3586_1 Int) (v_v_3587_1 Int) (v_v_3588_1 Int) (v_v_3589_1 Int)) (let ((.cse2 (+ v_b_318_1 1)) (.cse1 (+ v_b_316_1 1)) (.cse3 (+ c_ULTIMATE.start_main_p1 2)) (.cse0 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_476 .cse0) (= (select |c_#memory_int| v_idx_476) v_v_3587_1) (<= v_b_316_1 v_idx_476)) (or (= (select |c_#memory_int| v_idx_480) v_v_3591_1) (< v_idx_480 v_b_319_1)) (<= v_b_317_1 .cse1) (<= v_b_319_1 .cse2) (<= v_b_317_1 v_b_318_1) (or (< v_idx_478 v_b_317_1) (<= v_b_318_1 v_idx_478) (= (select |c_#memory_int| v_idx_478) v_v_3589_1)) (<= .cse2 v_b_319_1) (<= .cse3 v_b_318_1) (<= .cse0 v_b_316_1) (<= (+ v_b_316_1 2) v_b_319_1) (<= .cse1 v_b_318_1) (<= (+ v_b_317_1 1) v_b_319_1) (or (= (select |c_#memory_int| v_idx_479) 0) (< v_idx_479 v_b_318_1) (<= v_b_319_1 v_idx_479)) (or (= (select |c_#memory_int| v_idx_474) v_v_3585_1) (<= c_ULTIMATE.start_main_p1 v_idx_474)) (<= v_v_3588_1 0) (<= .cse1 v_b_317_1) (<= 0 v_v_3586_1) (<= v_v_3588_1 v_v_3586_1) (<= .cse3 v_b_317_1) (or (= (select |c_#memory_int| v_idx_475) v_v_3586_1) (<= .cse0 v_idx_475) (< v_idx_475 c_ULTIMATE.start_main_p1)) (<= 0 (* 2 v_v_3586_1)) (or (= (select |c_#memory_int| v_idx_477) v_v_3588_1) (<= v_b_317_1 v_idx_477) (< v_idx_477 v_b_316_1)) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_319_1) (<= (* 2 v_v_3588_1) 0))))) is different from false [2019-01-18 18:09:56,068 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-18 18:09:56,069 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:09:56,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:09:56,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-18 18:09:56,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:09:56,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:09:56,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:09:56,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:09:56,070 INFO L87 Difference]: Start difference. First operand 14 states and 35 transitions. Second operand 5 states. [2019-01-18 18:09:58,659 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_465 Int) (v_idx_466 Int) (v_idx_460 Int) (v_idx_463 Int) (v_idx_464 Int) (v_idx_461 Int) (v_idx_462 Int)) (exists ((v_b_319_1 Int) (v_v_3591_1 Int) (v_b_318_1 Int) (v_v_3585_1 Int) (v_v_3586_1 Int) (v_v_3587_1 Int) (v_v_3588_1 Int) (v_v_3589_1 Int)) (let ((.cse2 (+ v_b_318_1 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_461 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_461) v_v_3586_1) (<= .cse0 v_idx_461)) (or (< v_idx_463 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_463) v_v_3588_1) (<= .cse1 v_idx_463)) (<= v_b_319_1 .cse2) (or (< v_idx_465 v_b_318_1) (= (select |c_#memory_int| v_idx_465) 0) (<= v_b_319_1 v_idx_465)) (<= .cse2 v_b_319_1) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_318_1) (or (= (select |c_#memory_int| v_idx_466) v_v_3591_1) (< v_idx_466 v_b_319_1)) (or (<= c_ULTIMATE.start_main_p2 v_idx_462) (< v_idx_462 .cse0) (= (select |c_#memory_int| v_idx_462) v_v_3587_1)) (<= v_v_3588_1 0) (<= .cse1 v_b_318_1) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_319_1) (or (<= c_ULTIMATE.start_main_p1 v_idx_460) (= (select |c_#memory_int| v_idx_460) v_v_3585_1)) (<= 0 v_v_3586_1) (<= v_v_3588_1 v_v_3586_1) (<= 0 (* 2 v_v_3586_1)) (or (<= v_b_318_1 v_idx_464) (< v_idx_464 .cse1) (= (select |c_#memory_int| v_idx_464) v_v_3589_1)) (<= .cse0 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_319_1) (<= (* 2 v_v_3588_1) 0))))) (forall ((v_idx_467 Int) (v_idx_468 Int) (v_idx_469 Int) (v_idx_470 Int) (v_idx_471 Int) (v_idx_472 Int) (v_idx_473 Int)) (exists ((v_b_319_1 Int) (v_v_3591_1 Int) (v_b_318_1 Int) (v_v_3585_1 Int) (v_v_3586_1 Int) (v_v_3587_1 Int) (v_v_3588_1 Int) (v_v_3589_1 Int)) (let ((.cse3 (+ v_b_318_1 1)) (.cse5 (+ c_ULTIMATE.start_main_p2 1)) (.cse4 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= c_ULTIMATE.start_main_p1 v_idx_467) (= (select |c_#memory_int| v_idx_467) v_v_3585_1)) (<= v_b_319_1 .cse3) (<= .cse3 v_b_319_1) (<= (+ c_ULTIMATE.start_main_p1 2) v_b_318_1) (or (= (select |c_#memory_int| v_idx_469) v_v_3587_1) (<= c_ULTIMATE.start_main_p2 v_idx_469) (< v_idx_469 .cse4)) (or (< v_idx_468 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_468) v_v_3586_1) (<= .cse4 v_idx_468)) (or (= (select |c_#memory_int| v_idx_471) v_v_3589_1) (<= v_b_318_1 v_idx_471) (< v_idx_471 .cse5)) (<= v_v_3588_1 0) (<= .cse5 v_b_318_1) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_319_1) (<= 0 v_v_3586_1) (<= v_v_3588_1 v_v_3586_1) (or (= (select |c_#memory_int| v_idx_473) v_v_3591_1) (< v_idx_473 v_b_319_1)) (or (< v_idx_472 v_b_318_1) (<= v_b_319_1 v_idx_472) (= (select |c_#memory_int| v_idx_472) 0)) (or (< v_idx_470 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_470) v_v_3588_1) (<= .cse5 v_idx_470)) (<= 0 (* 2 v_v_3586_1)) (<= .cse4 c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_319_1) (<= (* 2 v_v_3588_1) 0))))) (forall ((v_idx_478 Int) (v_idx_479 Int) (v_idx_476 Int) (v_idx_477 Int) (v_idx_480 Int) (v_idx_474 Int) (v_idx_475 Int)) (exists ((v_b_317_1 Int) (v_b_316_1 Int) (v_v_3591_1 Int) (v_b_319_1 Int) (v_b_318_1 Int) (v_v_3585_1 Int) (v_v_3586_1 Int) (v_v_3587_1 Int) (v_v_3588_1 Int) (v_v_3589_1 Int)) (let ((.cse8 (+ v_b_318_1 1)) (.cse7 (+ v_b_316_1 1)) (.cse9 (+ c_ULTIMATE.start_main_p1 2)) (.cse6 (+ c_ULTIMATE.start_main_p1 1))) (and (or (< v_idx_476 .cse6) (= (select |c_#memory_int| v_idx_476) v_v_3587_1) (<= v_b_316_1 v_idx_476)) (or (= (select |c_#memory_int| v_idx_480) v_v_3591_1) (< v_idx_480 v_b_319_1)) (<= v_b_317_1 .cse7) (<= v_b_319_1 .cse8) (<= v_b_317_1 v_b_318_1) (or (< v_idx_478 v_b_317_1) (<= v_b_318_1 v_idx_478) (= (select |c_#memory_int| v_idx_478) v_v_3589_1)) (<= .cse8 v_b_319_1) (<= .cse9 v_b_318_1) (<= .cse6 v_b_316_1) (<= (+ v_b_316_1 2) v_b_319_1) (<= .cse7 v_b_318_1) (<= (+ v_b_317_1 1) v_b_319_1) (or (= (select |c_#memory_int| v_idx_479) 0) (< v_idx_479 v_b_318_1) (<= v_b_319_1 v_idx_479)) (or (= (select |c_#memory_int| v_idx_474) v_v_3585_1) (<= c_ULTIMATE.start_main_p1 v_idx_474)) (<= v_v_3588_1 0) (<= .cse7 v_b_317_1) (<= 0 v_v_3586_1) (<= v_v_3588_1 v_v_3586_1) (<= .cse9 v_b_317_1) (or (= (select |c_#memory_int| v_idx_475) v_v_3586_1) (<= .cse6 v_idx_475) (< v_idx_475 c_ULTIMATE.start_main_p1)) (<= 0 (* 2 v_v_3586_1)) (or (= (select |c_#memory_int| v_idx_477) v_v_3588_1) (<= v_b_317_1 v_idx_477) (< v_idx_477 v_b_316_1)) (<= (+ c_ULTIMATE.start_main_p1 3) v_b_319_1) (<= (* 2 v_v_3588_1) 0)))))) is different from false [2019-01-18 18:10:25,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:10:25,691 INFO L93 Difference]: Finished difference Result 16 states and 40 transitions. [2019-01-18 18:10:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 18:10:25,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-18 18:10:25,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:10:25,692 INFO L225 Difference]: With dead ends: 16 [2019-01-18 18:10:25,692 INFO L226 Difference]: Without dead ends: 15 [2019-01-18 18:10:25,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=9, Invalid=5, Unknown=4, NotChecked=12, Total=30 [2019-01-18 18:10:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-18 18:10:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-18 18:10:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 18:10:25,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2019-01-18 18:10:25,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 35 transitions. Word has length 4 [2019-01-18 18:10:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:10:25,702 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 35 transitions. [2019-01-18 18:10:25,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 18:10:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 35 transitions. [2019-01-18 18:10:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 18:10:25,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:10:25,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 18:10:25,703 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:10:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:25,704 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-18 18:10:25,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:10:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:25,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:10:25,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:10:25,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:10:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:10:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:10:25,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:10:25,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:10:25,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 18:10:25,740 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-18 18:10:25,741 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 18:10:25,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 18:10:29,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-18 18:10:29,526 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 18:10:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:10:29,526 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-18 18:10:29,768 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 71.43% of their original sizes. [2019-01-18 18:10:29,769 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-18 18:10:32,665 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_588 Int) (v_idx_589 Int) (v_idx_586 Int) (v_idx_587 Int) (v_idx_580 Int) (v_idx_591 Int) (v_idx_581 Int) (v_idx_592 Int) (v_idx_590 Int) (v_idx_584 Int) (v_idx_585 Int) (v_idx_582 Int) (v_idx_583 Int)) (exists ((v_v_1088_6 Int) (v_v_1089_6 Int) (v_v_1079_6 Int) (v_v_1090_6 Int) (v_v_1081_6 Int) (v_v_1092_6 Int) (v_v_1083_6 Int) (v_v_1085_6 Int) (v_v_1086_6 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse3 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= c_ULTIMATE.start_main_p1 v_idx_586) (= (select |c_#memory_int| v_idx_586) v_v_1086_6)) (<= .cse0 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_582 .cse1) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_582) v_v_1081_6)) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_592 .cse1) (= (select |c_#memory_int| v_idx_592) v_v_1092_6)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_581) 0) (< v_idx_581 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_581)) (or (<= c_ULTIMATE.start_main_p2 v_idx_588) (= (select |c_#memory_int| v_idx_588) v_v_1088_6) (< v_idx_588 .cse2)) (<= .cse3 c_ULTIMATE.start_main_p3) (or (<= .cse1 v_idx_584) (= 1 (select |c_#valid| v_idx_584)) (< v_idx_584 c_ULTIMATE.start_malloc_ptr)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (= (select |c_#valid| v_idx_583) v_v_1083_6) (<= c_ULTIMATE.start_malloc_ptr v_idx_583)) (<= (* 2 v_v_1089_6) 0) (or (<= .cse1 v_idx_591) (< v_idx_591 c_ULTIMATE.start_malloc_ptr) (= (select |c_#memory_int| v_idx_591) 0)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_580) v_v_1079_6) (<= c_ULTIMATE.start_malloc_ptr v_idx_580)) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (<= .cse3 v_idx_589) (= (select |c_#memory_int| v_idx_589) v_v_1089_6) (< v_idx_589 c_ULTIMATE.start_main_p2)) (<= .cse2 c_ULTIMATE.start_main_p2) (<= v_v_1089_6 0) (or (< v_idx_585 .cse1) (= (select |c_#valid| v_idx_585) v_v_1085_6)) (or (= (select |c_#memory_int| v_idx_590) v_v_1090_6) (<= c_ULTIMATE.start_malloc_ptr v_idx_590) (< v_idx_590 .cse3)) (or (= (select |c_#memory_int| v_idx_587) 0) (< v_idx_587 c_ULTIMATE.start_main_p1) (<= .cse2 v_idx_587)))))) is different from false [2019-01-18 18:10:35,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_605 Int) (v_idx_599 Int) (v_idx_600 Int) (v_idx_597 Int) (v_idx_598 Int) (v_idx_603 Int) (v_idx_604 Int) (v_idx_601 Int) (v_idx_602 Int) (v_idx_595 Int) (v_idx_596 Int) (v_idx_593 Int) (v_idx_594 Int)) (exists ((v_v_1088_6 Int) (v_v_1079_6 Int) (v_v_1089_6 Int) (v_v_1090_6 Int) (v_v_1092_6 Int) (v_v_1081_6 Int) (v_v_1083_6 Int) (v_v_1085_6 Int) (v_v_1086_6 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse3 (+ c_ULTIMATE.start_main_p2 1)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1))) (and (<= .cse0 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (= 1 (select |c_#valid| v_idx_597)) (<= .cse1 v_idx_597) (< v_idx_597 c_ULTIMATE.start_malloc_ptr)) (or (<= c_ULTIMATE.start_main_p2 v_idx_601) (= (select |c_#memory_int| v_idx_601) v_v_1088_6) (< v_idx_601 .cse2)) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_604) 0) (< v_idx_604 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_604)) (or (= (select |c_#valid| v_idx_596) v_v_1083_6) (<= c_ULTIMATE.start_malloc_ptr v_idx_596)) (or (= v_v_1079_6 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_593)) (<= c_ULTIMATE.start_malloc_ptr v_idx_593)) (or (<= c_ULTIMATE.start_main_p1 v_idx_599) (= (select |c_#memory_int| v_idx_599) v_v_1086_6)) (<= .cse3 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (< v_idx_594 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_594) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_594))) (or (= (select |c_#memory_int| v_idx_602) v_v_1089_6) (< v_idx_602 c_ULTIMATE.start_main_p2) (<= .cse3 v_idx_602)) (or (< v_idx_605 .cse1) (= (select |c_#memory_int| v_idx_605) v_v_1092_6)) (<= (* 2 v_v_1089_6) 0) (or (< v_idx_603 .cse3) (<= c_ULTIMATE.start_malloc_ptr v_idx_603) (= (select |c_#memory_int| v_idx_603) v_v_1090_6)) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_598 .cse1) (= (select |c_#valid| v_idx_598) v_v_1085_6)) (<= .cse2 c_ULTIMATE.start_main_p2) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_595) v_v_1081_6) (< v_idx_595 .cse1)) (<= v_v_1089_6 0) (or (<= .cse2 v_idx_600) (< v_idx_600 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_600) 0)))))) is different from false [2019-01-18 18:10:37,632 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_610 Int) (v_idx_611 Int) (v_idx_612 Int) (v_idx_607 Int) (v_idx_608 Int) (v_idx_606 Int) (v_idx_609 Int)) (exists ((v_v_41_6 Int) (v_b_22_6 Int) (v_b_24_6 Int) (v_b_23_6 Int) (v_v_38_6 Int) (v_b_19_6 Int) (v_v_35_6 Int) (v_v_43_6 Int)) (let ((.cse0 (+ v_b_24_6 1)) (.cse2 (+ v_b_22_6 1)) (.cse1 (+ c_ULTIMATE.start_main_p2 1))) (and (<= v_b_19_6 .cse0) (<= .cse0 c_ULTIMATE.start_main_p2) (or (< v_idx_609 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_609) 0) (<= .cse1 v_idx_609)) (or (< v_idx_612 v_b_23_6) (= (select |c_#memory_int| v_idx_612) v_v_43_6)) (<= .cse0 v_b_19_6) (<= (+ v_b_24_6 3) v_b_23_6) (or (< v_idx_611 v_b_22_6) (<= v_b_23_6 v_idx_611) (= (select |c_#memory_int| v_idx_611) 0)) (<= v_b_23_6 .cse2) (or (< v_idx_607 v_b_24_6) (= (select |c_#memory_int| v_idx_607) 0) (<= v_b_19_6 v_idx_607)) (or (= (select |c_#memory_int| v_idx_608) v_v_38_6) (<= c_ULTIMATE.start_main_p2 v_idx_608) (< v_idx_608 v_b_19_6)) (<= (+ v_b_19_6 2) v_b_23_6) (<= (+ v_b_24_6 2) v_b_22_6) (<= .cse2 v_b_23_6) (<= v_b_19_6 c_ULTIMATE.start_main_p2) (<= (+ v_b_19_6 1) v_b_22_6) (or (= (select |c_#memory_int| v_idx_606) v_v_35_6) (<= v_b_24_6 v_idx_606)) (or (<= v_b_22_6 v_idx_610) (= (select |c_#memory_int| v_idx_610) v_v_41_6) (< v_idx_610 .cse1)) (<= .cse1 v_b_22_6) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_23_6))))) is different from false [2019-01-18 18:10:37,672 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-18 18:10:37,672 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-18 18:10:37,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-18 18:10:37,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-01-18 18:10:37,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 18:10:37,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 18:10:37,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 18:10:37,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2019-01-18 18:10:37,673 INFO L87 Difference]: Start difference. First operand 14 states and 35 transitions. Second operand 5 states. [2019-01-18 18:10:40,694 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_588 Int) (v_idx_589 Int) (v_idx_586 Int) (v_idx_587 Int) (v_idx_580 Int) (v_idx_591 Int) (v_idx_581 Int) (v_idx_592 Int) (v_idx_590 Int) (v_idx_584 Int) (v_idx_585 Int) (v_idx_582 Int) (v_idx_583 Int)) (exists ((v_v_1088_6 Int) (v_v_1089_6 Int) (v_v_1079_6 Int) (v_v_1090_6 Int) (v_v_1081_6 Int) (v_v_1092_6 Int) (v_v_1083_6 Int) (v_v_1085_6 Int) (v_v_1086_6 Int)) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 2)) (.cse1 (+ c_ULTIMATE.start_main_p3 1)) (.cse3 (+ c_ULTIMATE.start_main_p2 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1))) (and (or (<= c_ULTIMATE.start_main_p1 v_idx_586) (= (select |c_#memory_int| v_idx_586) v_v_1086_6)) (<= .cse0 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_582 .cse1) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_582) v_v_1081_6)) (<= .cse0 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_592 .cse1) (= (select |c_#memory_int| v_idx_592) v_v_1092_6)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_581) 0) (< v_idx_581 c_ULTIMATE.start_malloc_ptr) (<= .cse1 v_idx_581)) (or (<= c_ULTIMATE.start_main_p2 v_idx_588) (= (select |c_#memory_int| v_idx_588) v_v_1088_6) (< v_idx_588 .cse2)) (<= .cse3 c_ULTIMATE.start_main_p3) (or (<= .cse1 v_idx_584) (= 1 (select |c_#valid| v_idx_584)) (< v_idx_584 c_ULTIMATE.start_malloc_ptr)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (= (select |c_#valid| v_idx_583) v_v_1083_6) (<= c_ULTIMATE.start_malloc_ptr v_idx_583)) (<= (* 2 v_v_1089_6) 0) (or (<= .cse1 v_idx_591) (< v_idx_591 c_ULTIMATE.start_malloc_ptr) (= (select |c_#memory_int| v_idx_591) 0)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_580) v_v_1079_6) (<= c_ULTIMATE.start_malloc_ptr v_idx_580)) (<= .cse3 c_ULTIMATE.start_malloc_ptr) (or (<= .cse3 v_idx_589) (= (select |c_#memory_int| v_idx_589) v_v_1089_6) (< v_idx_589 c_ULTIMATE.start_main_p2)) (<= .cse2 c_ULTIMATE.start_main_p2) (<= v_v_1089_6 0) (or (< v_idx_585 .cse1) (= (select |c_#valid| v_idx_585) v_v_1085_6)) (or (= (select |c_#memory_int| v_idx_590) v_v_1090_6) (<= c_ULTIMATE.start_malloc_ptr v_idx_590) (< v_idx_590 .cse3)) (or (= (select |c_#memory_int| v_idx_587) 0) (< v_idx_587 c_ULTIMATE.start_main_p1) (<= .cse2 v_idx_587)))))) (forall ((v_idx_605 Int) (v_idx_599 Int) (v_idx_600 Int) (v_idx_597 Int) (v_idx_598 Int) (v_idx_603 Int) (v_idx_604 Int) (v_idx_601 Int) (v_idx_602 Int) (v_idx_595 Int) (v_idx_596 Int) (v_idx_593 Int) (v_idx_594 Int)) (exists ((v_v_1088_6 Int) (v_v_1079_6 Int) (v_v_1089_6 Int) (v_v_1090_6 Int) (v_v_1092_6 Int) (v_v_1081_6 Int) (v_v_1083_6 Int) (v_v_1085_6 Int) (v_v_1086_6 Int)) (let ((.cse4 (+ c_ULTIMATE.start_main_p1 2)) (.cse7 (+ c_ULTIMATE.start_main_p2 1)) (.cse5 (+ c_ULTIMATE.start_main_p3 1)) (.cse6 (+ c_ULTIMATE.start_main_p1 1))) (and (<= .cse4 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (or (= 1 (select |c_#valid| v_idx_597)) (<= .cse5 v_idx_597) (< v_idx_597 c_ULTIMATE.start_malloc_ptr)) (or (<= c_ULTIMATE.start_main_p2 v_idx_601) (= (select |c_#memory_int| v_idx_601) v_v_1088_6) (< v_idx_601 .cse6)) (<= .cse4 c_ULTIMATE.start_malloc_ptr) (or (= (select |c_#memory_int| v_idx_604) 0) (< v_idx_604 c_ULTIMATE.start_malloc_ptr) (<= .cse5 v_idx_604)) (or (= (select |c_#valid| v_idx_596) v_v_1083_6) (<= c_ULTIMATE.start_malloc_ptr v_idx_596)) (or (= v_v_1079_6 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_593)) (<= c_ULTIMATE.start_malloc_ptr v_idx_593)) (or (<= c_ULTIMATE.start_main_p1 v_idx_599) (= (select |c_#memory_int| v_idx_599) v_v_1086_6)) (<= .cse7 c_ULTIMATE.start_main_p3) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (or (< v_idx_594 c_ULTIMATE.start_malloc_ptr) (<= .cse5 v_idx_594) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_594))) (or (= (select |c_#memory_int| v_idx_602) v_v_1089_6) (< v_idx_602 c_ULTIMATE.start_main_p2) (<= .cse7 v_idx_602)) (or (< v_idx_605 .cse5) (= (select |c_#memory_int| v_idx_605) v_v_1092_6)) (<= (* 2 v_v_1089_6) 0) (or (< v_idx_603 .cse7) (<= c_ULTIMATE.start_malloc_ptr v_idx_603) (= (select |c_#memory_int| v_idx_603) v_v_1090_6)) (<= .cse7 c_ULTIMATE.start_malloc_ptr) (or (< v_idx_598 .cse5) (= (select |c_#valid| v_idx_598) v_v_1085_6)) (<= .cse6 c_ULTIMATE.start_main_p2) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_595) v_v_1081_6) (< v_idx_595 .cse5)) (<= v_v_1089_6 0) (or (<= .cse6 v_idx_600) (< v_idx_600 c_ULTIMATE.start_main_p1) (= (select |c_#memory_int| v_idx_600) 0)))))) (forall ((v_idx_610 Int) (v_idx_611 Int) (v_idx_612 Int) (v_idx_607 Int) (v_idx_608 Int) (v_idx_606 Int) (v_idx_609 Int)) (exists ((v_v_41_6 Int) (v_b_22_6 Int) (v_b_24_6 Int) (v_b_23_6 Int) (v_v_38_6 Int) (v_b_19_6 Int) (v_v_35_6 Int) (v_v_43_6 Int)) (let ((.cse8 (+ v_b_24_6 1)) (.cse10 (+ v_b_22_6 1)) (.cse9 (+ c_ULTIMATE.start_main_p2 1))) (and (<= v_b_19_6 .cse8) (<= .cse8 c_ULTIMATE.start_main_p2) (or (< v_idx_609 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_609) 0) (<= .cse9 v_idx_609)) (or (< v_idx_612 v_b_23_6) (= (select |c_#memory_int| v_idx_612) v_v_43_6)) (<= .cse8 v_b_19_6) (<= (+ v_b_24_6 3) v_b_23_6) (or (< v_idx_611 v_b_22_6) (<= v_b_23_6 v_idx_611) (= (select |c_#memory_int| v_idx_611) 0)) (<= v_b_23_6 .cse10) (or (< v_idx_607 v_b_24_6) (= (select |c_#memory_int| v_idx_607) 0) (<= v_b_19_6 v_idx_607)) (or (= (select |c_#memory_int| v_idx_608) v_v_38_6) (<= c_ULTIMATE.start_main_p2 v_idx_608) (< v_idx_608 v_b_19_6)) (<= (+ v_b_19_6 2) v_b_23_6) (<= (+ v_b_24_6 2) v_b_22_6) (<= .cse10 v_b_23_6) (<= v_b_19_6 c_ULTIMATE.start_main_p2) (<= (+ v_b_19_6 1) v_b_22_6) (or (= (select |c_#memory_int| v_idx_606) v_v_35_6) (<= v_b_24_6 v_idx_606)) (or (<= v_b_22_6 v_idx_610) (= (select |c_#memory_int| v_idx_610) v_v_41_6) (< v_idx_610 .cse9)) (<= .cse9 v_b_22_6) (<= (+ c_ULTIMATE.start_main_p2 2) v_b_23_6)))))) is different from false [2019-01-18 18:10:41,154 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-18 18:10:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 18:10:41,156 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-01-18 18:10:41,160 INFO L168 Benchmark]: Toolchain (without parser) took 187239.81 ms. Allocated memory was 139.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 106.9 MB in the beginning and 813.0 MB in the end (delta: -706.1 MB). Peak memory consumption was 714.2 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:41,163 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 18:10:41,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.27 ms. Allocated memory is still 139.5 MB. Free memory was 106.7 MB in the beginning and 104.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:41,165 INFO L168 Benchmark]: Boogie Preprocessor took 30.90 ms. Allocated memory is still 139.5 MB. Free memory was 104.6 MB in the beginning and 103.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:41,167 INFO L168 Benchmark]: RCFGBuilder took 282.97 ms. Allocated memory is still 139.5 MB. Free memory was 103.4 MB in the beginning and 93.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:41,168 INFO L168 Benchmark]: TraceAbstraction took 186851.61 ms. Allocated memory was 139.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 93.2 MB in the beginning and 813.0 MB in the end (delta: -719.8 MB). Peak memory consumption was 700.5 MB. Max. memory is 7.1 GB. [2019-01-18 18:10:41,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.24 ms. Allocated memory is still 139.5 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.27 ms. Allocated memory is still 139.5 MB. Free memory was 106.7 MB in the beginning and 104.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.90 ms. Allocated memory is still 139.5 MB. Free memory was 104.6 MB in the beginning and 103.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 282.97 ms. Allocated memory is still 139.5 MB. Free memory was 103.4 MB in the beginning and 93.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186851.61 ms. Allocated memory was 139.5 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 93.2 MB in the beginning and 813.0 MB in the end (delta: -719.8 MB). Peak memory consumption was 700.5 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...