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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-0302a3f
[2019-02-25 15:10:23,813 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2019-02-25 15:10:23,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-02-25 15:10:23,828 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-02-25 15:10:23,829 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-02-25 15:10:23,830 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-02-25 15:10:23,833 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-02-25 15:10:23,835 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-02-25 15:10:23,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-02-25 15:10:23,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-02-25 15:10:23,841 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-02-25 15:10:23,842 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-02-25 15:10:23,843 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-02-25 15:10:23,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-02-25 15:10:23,847 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-02-25 15:10:23,848 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-02-25 15:10:23,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-02-25 15:10:23,857 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-02-25 15:10:23,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-02-25 15:10:23,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-02-25 15:10:23,866 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-02-25 15:10:23,869 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-02-25 15:10:23,873 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-02-25 15:10:23,873 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-02-25 15:10:23,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-02-25 15:10:23,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-02-25 15:10:23,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-02-25 15:10:23,878 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-02-25 15:10:23,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-02-25 15:10:23,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-02-25 15:10:23,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2019-02-25 15:10:23,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-02-25 15:10:23,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-02-25 15:10:23,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2019-02-25 15:10:23,884 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-02-25 15:10:23,885 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2019-02-25 15:10:23,886 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf
[2019-02-25 15:10:23,900 INFO L110 SettingsManager]: Loading preferences was successful
[2019-02-25 15:10:23,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2019-02-25 15:10:23,901 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2019-02-25 15:10:23,902 INFO L133 SettingsManager]: * Show backtranslation warnings=false
[2019-02-25 15:10:23,902 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2019-02-25 15:10:23,902 INFO L133 SettingsManager]: * User list type=DISABLED
[2019-02-25 15:10:23,902 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true
[2019-02-25 15:10:23,902 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2019-02-25 15:10:23,903 INFO L133 SettingsManager]: * Explicit value domain=true
[2019-02-25 15:10:23,903 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2019-02-25 15:10:23,903 INFO L133 SettingsManager]: * Octagon Domain=false
[2019-02-25 15:10:23,903 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain
[2019-02-25 15:10:23,903 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true
[2019-02-25 15:10:23,904 INFO L133 SettingsManager]: * Interval Domain=false
[2019-02-25 15:10:23,905 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-02-25 15:10:23,905 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2019-02-25 15:10:23,905 INFO L133 SettingsManager]: * Use SBE=true
[2019-02-25 15:10:23,905 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-02-25 15:10:23,905 INFO L133 SettingsManager]: * sizeof long=4
[2019-02-25 15:10:23,905 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2019-02-25 15:10:23,907 INFO L133 SettingsManager]: * sizeof POINTER=4
[2019-02-25 15:10:23,907 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2019-02-25 15:10:23,908 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-02-25 15:10:23,908 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-02-25 15:10:23,908 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-02-25 15:10:23,908 INFO L133 SettingsManager]: * sizeof long double=12
[2019-02-25 15:10:23,908 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2019-02-25 15:10:23,908 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-02-25 15:10:23,909 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-02-25 15:10:23,909 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-02-25 15:10:23,909 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2019-02-25 15:10:23,909 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-02-25 15:10:23,910 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-02-25 15:10:23,910 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-02-25 15:10:23,910 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-02-25 15:10:23,910 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN
[2019-02-25 15:10:23,910 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2019-02-25 15:10:23,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-02-25 15:10:23,911 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-02-25 15:10:23,911 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES
[2019-02-25 15:10:23,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-02-25 15:10:23,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-02-25 15:10:23,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-02-25 15:10:23,983 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2019-02-25 15:10:23,984 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized
[2019-02-25 15:10:23,985 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl
[2019-02-25 15:10:23,985 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl'
[2019-02-25 15:10:24,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-02-25 15:10:24,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-02-25 15:10:24,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2019-02-25 15:10:24,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2019-02-25 15:10:24,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2019-02-25 15:10:24,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
[2019-02-25 15:10:24,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
[2019-02-25 15:10:24,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2019-02-25 15:10:24,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-02-25 15:10:24,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-02-25 15:10:24,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2019-02-25 15:10:24,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
[2019-02-25 15:10:24,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
[2019-02-25 15:10:24,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
[2019-02-25 15:10:24,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
[2019-02-25 15:10:24,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
[2019-02-25 15:10:24,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
[2019-02-25 15:10:24,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
[2019-02-25 15:10:24,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-02-25 15:10:24,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-02-25 15:10:24,099 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-02-25 15:10:24,100 INFO L276 PluginConnector]: RCFGBuilder initialized
[2019-02-25 15:10:24,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-02-25 15:10:24,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-02-25 15:10:24,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-02-25 15:10:24,430 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-02-25 15:10:24,431 INFO L286 CfgBuilder]: Removed 5 assue(true) statements.
[2019-02-25 15:10:24,432 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:24 BoogieIcfgContainer
[2019-02-25 15:10:24,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-02-25 15:10:24,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-02-25 15:10:24,433 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-02-25 15:10:24,435 INFO L276 PluginConnector]: TraceAbstraction initialized
[2019-02-25 15:10:24,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:24" (1/2) ...
[2019-02-25 15:10:24,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708af5f5 and model type string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:10:24, skipping insertion in model container
[2019-02-25 15:10:24,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:24" (2/2) ...
[2019-02-25 15:10:24,439 INFO L112 eAbstractionObserver]: Analyzing ICFG string.i_3.bpl
[2019-02-25 15:10:24,447 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-02-25 15:10:24,453 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-02-25 15:10:24,464 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-02-25 15:10:24,494 INFO L382 AbstractCegarLoop]: Interprodecural is true
[2019-02-25 15:10:24,495 INFO L383 AbstractCegarLoop]: Hoare is true
[2019-02-25 15:10:24,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-02-25 15:10:24,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-02-25 15:10:24,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-02-25 15:10:24,495 INFO L387 AbstractCegarLoop]: Difference is false
[2019-02-25 15:10:24,496 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-02-25 15:10:24,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-02-25 15:10:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states.
[2019-02-25 15:10:24,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2019-02-25 15:10:24,516 INFO L394 BasicCegarLoop]: Found error trace
[2019-02-25 15:10:24,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2019-02-25 15:10:24,519 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2019-02-25 15:10:24,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-02-25 15:10:24,524 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times
[2019-02-25 15:10:24,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-25 15:10:24,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:24,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-25 15:10:24,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:24,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-25 15:10:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-25 15:10:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-02-25 15:10:24,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-02-25 15:10:24,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-02-25 15:10:24,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence
[2019-02-25 15:10:24,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-02-25 15:10:24,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-02-25 15:10:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-25 15:10:24,684 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states.
[2019-02-25 15:10:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-25 15:10:24,813 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions.
[2019-02-25 15:10:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-02-25 15:10:24,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4
[2019-02-25 15:10:24,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-25 15:10:24,830 INFO L225 Difference]: With dead ends: 12
[2019-02-25 15:10:24,830 INFO L226 Difference]: Without dead ends: 7
[2019-02-25 15:10:24,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-02-25 15:10:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states.
[2019-02-25 15:10:24,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7.
[2019-02-25 15:10:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2019-02-25 15:10:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions.
[2019-02-25 15:10:24,871 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4
[2019-02-25 15:10:24,871 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-02-25 15:10:24,872 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions.
[2019-02-25 15:10:24,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-02-25 15:10:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions.
[2019-02-25 15:10:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7
[2019-02-25 15:10:24,872 INFO L394 BasicCegarLoop]: Found error trace
[2019-02-25 15:10:24,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1]
[2019-02-25 15:10:24,873 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2019-02-25 15:10:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-02-25 15:10:24,874 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times
[2019-02-25 15:10:24,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-25 15:10:24,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:24,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-25 15:10:24,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:24,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-25 15:10:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-25 15:10:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2019-02-25 15:10:24,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-25 15:10:24,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-25 15:10:24,973 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions:
[2019-02-25 15:10:24,975 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16]
[2019-02-25 15:10:25,016 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain]
[2019-02-25 15:10:25,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2)
[2019-02-25 15:10:25,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable
[2019-02-25 15:10:25,155 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 2 different actions 6 times. Never widened. Performed 206 root evaluator evaluations with a maximum evaluation depth of 5. Performed 206 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 4 different actions. Largest state had 0 variables.
[2019-02-25 15:10:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-02-25 15:10:25,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown
[2019-02-25 15:10:25,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-25 15:10:25,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2019-02-25 15:10:25,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-25 15:10:25,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2019-02-25 15:10:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-25 15:10:25,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-02-25 15:10:25,244 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-02-25 15:10:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2019-02-25 15:10:25,268 INFO L322 TraceCheckSpWp]: Computing backward predicates...
[2019-02-25 15:10:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2019-02-25 15:10:25,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-02-25 15:10:25,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5
[2019-02-25 15:10:25,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2019-02-25 15:10:25,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-02-25 15:10:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-02-25 15:10:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2019-02-25 15:10:25,416 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states.
[2019-02-25 15:10:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-25 15:10:25,495 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions.
[2019-02-25 15:10:25,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2019-02-25 15:10:25,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6
[2019-02-25 15:10:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-25 15:10:25,496 INFO L225 Difference]: With dead ends: 13
[2019-02-25 15:10:25,496 INFO L226 Difference]: Without dead ends: 9
[2019-02-25 15:10:25,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2019-02-25 15:10:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states.
[2019-02-25 15:10:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2019-02-25 15:10:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2019-02-25 15:10:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions.
[2019-02-25 15:10:25,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6
[2019-02-25 15:10:25,501 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-02-25 15:10:25,501 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions.
[2019-02-25 15:10:25,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-02-25 15:10:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions.
[2019-02-25 15:10:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2019-02-25 15:10:25,501 INFO L394 BasicCegarLoop]: Found error trace
[2019-02-25 15:10:25,502 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1]
[2019-02-25 15:10:25,502 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2019-02-25 15:10:25,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-02-25 15:10:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times
[2019-02-25 15:10:25,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-25 15:10:25,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:25,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-25 15:10:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:25,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-25 15:10:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-25 15:10:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2019-02-25 15:10:25,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-25 15:10:25,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-25 15:10:25,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program
[2019-02-25 15:10:25,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints
[2019-02-25 15:10:25,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-25 15:10:25,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2019-02-25 15:10:25,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2019-02-25 15:10:25,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)
[2019-02-25 15:10:25,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2019-02-25 15:10:25,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2019-02-25 15:10:25,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core
[2019-02-25 15:10:25,636 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-02-25 15:10:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2019-02-25 15:10:25,644 INFO L322 TraceCheckSpWp]: Computing backward predicates...
[2019-02-25 15:10:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2019-02-25 15:10:25,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-02-25 15:10:25,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2019-02-25 15:10:25,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2019-02-25 15:10:25,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-02-25 15:10:25,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-02-25 15:10:25,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2019-02-25 15:10:25,747 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states.
[2019-02-25 15:10:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-25 15:10:25,930 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions.
[2019-02-25 15:10:25,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-02-25 15:10:25,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8
[2019-02-25 15:10:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-25 15:10:25,932 INFO L225 Difference]: With dead ends: 16
[2019-02-25 15:10:25,933 INFO L226 Difference]: Without dead ends: 11
[2019-02-25 15:10:25,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2019-02-25 15:10:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states.
[2019-02-25 15:10:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11.
[2019-02-25 15:10:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2019-02-25 15:10:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions.
[2019-02-25 15:10:25,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8
[2019-02-25 15:10:25,939 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-02-25 15:10:25,939 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions.
[2019-02-25 15:10:25,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-02-25 15:10:25,939 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions.
[2019-02-25 15:10:25,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2019-02-25 15:10:25,941 INFO L394 BasicCegarLoop]: Found error trace
[2019-02-25 15:10:25,941 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1]
[2019-02-25 15:10:25,941 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2019-02-25 15:10:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-02-25 15:10:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times
[2019-02-25 15:10:25,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-25 15:10:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:25,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2019-02-25 15:10:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:25,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-25 15:10:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-25 15:10:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2019-02-25 15:10:26,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-25 15:10:26,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-25 15:10:26,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program
[2019-02-25 15:10:26,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints
[2019-02-25 15:10:26,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-25 15:10:26,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2019-02-25 15:10:26,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2019-02-25 15:10:26,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP)
[2019-02-25 15:10:26,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2019-02-25 15:10:26,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2019-02-25 15:10:26,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core
[2019-02-25 15:10:26,144 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-02-25 15:10:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2019-02-25 15:10:26,152 INFO L322 TraceCheckSpWp]: Computing backward predicates...
[2019-02-25 15:10:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2019-02-25 15:10:26,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-02-25 15:10:26,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6
[2019-02-25 15:10:26,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2019-02-25 15:10:26,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states
[2019-02-25 15:10:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2019-02-25 15:10:26,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2019-02-25 15:10:26,265 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states.
[2019-02-25 15:10:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-25 15:10:26,315 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions.
[2019-02-25 15:10:26,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2019-02-25 15:10:26,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10
[2019-02-25 15:10:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-25 15:10:26,316 INFO L225 Difference]: With dead ends: 19
[2019-02-25 15:10:26,316 INFO L226 Difference]: Without dead ends: 13
[2019-02-25 15:10:26,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2019-02-25 15:10:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2019-02-25 15:10:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2019-02-25 15:10:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2019-02-25 15:10:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions.
[2019-02-25 15:10:26,322 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10
[2019-02-25 15:10:26,322 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-02-25 15:10:26,322 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions.
[2019-02-25 15:10:26,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2019-02-25 15:10:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions.
[2019-02-25 15:10:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2019-02-25 15:10:26,324 INFO L394 BasicCegarLoop]: Found error trace
[2019-02-25 15:10:26,325 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1]
[2019-02-25 15:10:26,325 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2019-02-25 15:10:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-02-25 15:10:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times
[2019-02-25 15:10:26,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-25 15:10:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:26,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2019-02-25 15:10:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:26,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-25 15:10:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-25 15:10:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2019-02-25 15:10:26,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-25 15:10:26,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION
[2019-02-25 15:10:26,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program
[2019-02-25 15:10:26,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints
[2019-02-25 15:10:26,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2019-02-25 15:10:26,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2019-02-25 15:10:26,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-25 15:10:26,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP)
[2019-02-25 15:10:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-02-25 15:10:26,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core
[2019-02-25 15:10:26,524 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-02-25 15:10:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2019-02-25 15:10:26,530 INFO L322 TraceCheckSpWp]: Computing backward predicates...
[2019-02-25 15:10:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2019-02-25 15:10:26,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences.
[2019-02-25 15:10:26,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6
[2019-02-25 15:10:26,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences
[2019-02-25 15:10:26,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2019-02-25 15:10:26,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2019-02-25 15:10:26,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2019-02-25 15:10:26,616 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states.
[2019-02-25 15:10:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-02-25 15:10:26,668 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions.
[2019-02-25 15:10:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2019-02-25 15:10:26,669 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12
[2019-02-25 15:10:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-02-25 15:10:26,669 INFO L225 Difference]: With dead ends: 22
[2019-02-25 15:10:26,670 INFO L226 Difference]: Without dead ends: 15
[2019-02-25 15:10:26,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2019-02-25 15:10:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2019-02-25 15:10:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2019-02-25 15:10:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2019-02-25 15:10:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions.
[2019-02-25 15:10:26,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12
[2019-02-25 15:10:26,674 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-02-25 15:10:26,674 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions.
[2019-02-25 15:10:26,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2019-02-25 15:10:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions.
[2019-02-25 15:10:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2019-02-25 15:10:26,675 INFO L394 BasicCegarLoop]: Found error trace
[2019-02-25 15:10:26,675 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1]
[2019-02-25 15:10:26,675 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]===
[2019-02-25 15:10:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-02-25 15:10:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times
[2019-02-25 15:10:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy
[2019-02-25 15:10:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:26,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-02-25 15:10:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-02-25 15:10:26,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)
[2019-02-25 15:10:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-02-25 15:10:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2019-02-25 15:10:26,854 INFO L469 BasicCegarLoop]: Counterexample might be feasible
[2019-02-25 15:10:26,873 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 03:10:26 BoogieIcfgContainer
[2019-02-25 15:10:26,874 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-02-25 15:10:26,874 INFO L168 Benchmark]: Toolchain (without parser) took 2839.42 ms. Allocated memory was 132.6 MB in the beginning and 215.5 MB in the end (delta: 82.8 MB). Free memory was 106.4 MB in the beginning and 198.1 MB in the end (delta: -91.7 MB). Peak memory consumption was 67.4 MB. Max. memory is 7.1 GB.
[2019-02-25 15:10:26,877 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB.
[2019-02-25 15:10:26,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.97 ms. Allocated memory is still 132.6 MB. Free memory was 106.4 MB in the beginning and 104.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB.
[2019-02-25 15:10:26,878 INFO L168 Benchmark]: Boogie Preprocessor took 23.74 ms. Allocated memory is still 132.6 MB. Free memory was 104.6 MB in the beginning and 103.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB.
[2019-02-25 15:10:26,879 INFO L168 Benchmark]: RCFGBuilder took 333.30 ms. Allocated memory is still 132.6 MB. Free memory was 103.4 MB in the beginning and 93.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB.
[2019-02-25 15:10:26,880 INFO L168 Benchmark]: TraceAbstraction took 2440.67 ms. Allocated memory was 132.6 MB in the beginning and 215.5 MB in the end (delta: 82.8 MB). Free memory was 93.2 MB in the beginning and 198.1 MB in the end (delta: -104.9 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB.
[2019-02-25 15:10:26,886 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 37.97 ms. Allocated memory is still 132.6 MB. Free memory was 106.4 MB in the beginning and 104.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 23.74 ms. Allocated memory is still 132.6 MB. Free memory was 104.6 MB in the beginning and 103.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 333.30 ms. Allocated memory is still 132.6 MB. Free memory was 103.4 MB in the beginning and 93.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 2440.67 ms. Allocated memory was 132.6 MB in the beginning and 215.5 MB in the end (delta: 82.8 MB). Free memory was 93.2 MB in the beginning and 198.1 MB in the end (delta: -104.9 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 89]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: overapproximation of shiftLeft at line 72.
Possible FailurePath:
[L23] havoc main_#res;
[L24] havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;
[L25] havoc main_~string_A~5;
[L26] havoc main_~string_B~5;
[L27] havoc main_~i~5;
[L28] havoc main_~j~5;
[L29] havoc main_~nc_A~5;
[L30] havoc main_~nc_B~5;
[L31] main_~found~5 := 0;
[L32] main_~i~5 := 0;
VAL [main_~found~5=0, main_~i~5=0]
[L45] assume !!(main_~i~5 < 5);
[L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;
[L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];
[L48] havoc main_#t~nondet1;
[L49] main_#t~post0 := main_~i~5;
[L50] main_~i~5 := main_#t~post0 + 1;
[L51] havoc main_#t~post0;
VAL [main_~found~5=0, main_~i~5=1]
[L45] assume !!(main_~i~5 < 5);
[L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;
[L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];
[L48] havoc main_#t~nondet1;
[L49] main_#t~post0 := main_~i~5;
[L50] main_~i~5 := main_#t~post0 + 1;
[L51] havoc main_#t~post0;
VAL [main_~found~5=0, main_~i~5=2]
[L45] assume !!(main_~i~5 < 5);
[L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;
[L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];
[L48] havoc main_#t~nondet1;
[L49] main_#t~post0 := main_~i~5;
[L50] main_~i~5 := main_#t~post0 + 1;
[L51] havoc main_#t~post0;
VAL [main_~found~5=0, main_~i~5=3]
[L45] assume !!(main_~i~5 < 5);
[L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;
[L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];
[L48] havoc main_#t~nondet1;
[L49] main_#t~post0 := main_~i~5;
[L50] main_~i~5 := main_#t~post0 + 1;
[L51] havoc main_#t~post0;
VAL [main_~found~5=0, main_~i~5=4]
[L45] assume !!(main_~i~5 < 5);
[L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;
[L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];
[L48] havoc main_#t~nondet1;
[L49] main_#t~post0 := main_~i~5;
[L50] main_~i~5 := main_#t~post0 + 1;
[L51] havoc main_#t~post0;
VAL [main_~found~5=0, main_~i~5=5]
[L40] assume !(main_~i~5 < 5);
[L41] assume !!(main_~string_A~5[4] == 0);
[L42] main_~i~5 := 0;
VAL [main_~found~5=0, main_~i~5=0]
[L80] assume !!(main_~i~5 < 5);
[L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;
[L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];
[L83] havoc main_#t~nondet3;
[L84] main_#t~post2 := main_~i~5;
[L85] main_~i~5 := main_#t~post2 + 1;
[L86] havoc main_#t~post2;
VAL [main_~found~5=0, main_~i~5=1]
[L80] assume !!(main_~i~5 < 5);
[L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;
[L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];
[L83] havoc main_#t~nondet3;
[L84] main_#t~post2 := main_~i~5;
[L85] main_~i~5 := main_#t~post2 + 1;
[L86] havoc main_#t~post2;
VAL [main_~found~5=0, main_~i~5=2]
[L80] assume !!(main_~i~5 < 5);
[L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;
[L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];
[L83] havoc main_#t~nondet3;
[L84] main_#t~post2 := main_~i~5;
[L85] main_~i~5 := main_#t~post2 + 1;
[L86] havoc main_#t~post2;
VAL [main_~found~5=0, main_~i~5=3]
[L80] assume !!(main_~i~5 < 5);
[L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;
[L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];
[L83] havoc main_#t~nondet3;
[L84] main_#t~post2 := main_~i~5;
[L85] main_~i~5 := main_#t~post2 + 1;
[L86] havoc main_#t~post2;
VAL [main_~found~5=0, main_~i~5=4]
[L80] assume !!(main_~i~5 < 5);
[L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;
[L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];
[L83] havoc main_#t~nondet3;
[L84] main_#t~post2 := main_~i~5;
[L85] main_~i~5 := main_#t~post2 + 1;
[L86] havoc main_#t~post2;
VAL [main_~found~5=0, main_~i~5=5]
[L59] assume !(main_~i~5 < 5);
[L60] assume !!(main_~string_B~5[4] == 0);
[L61] main_~nc_A~5 := 0;
[L63] assume !(main_~string_A~5[main_~nc_A~5] != 0);
[L64] main_~nc_B~5 := 0;
[L66] assume !(main_~string_B~5[main_~nc_B~5] != 0);
[L67] assume !!(main_~nc_B~5 >= main_~nc_A~5);
[L68] main_~j~5 := 0;
[L69] main_~i~5 := main_~j~5;
[L71] assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);
[L72] main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);
[L73] __VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);
[L74] havoc __VERIFIER_assert_~cond;
[L75] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;
[L76] assume __VERIFIER_assert_~cond == 0;
[L77] assume !false;
VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0]
[L89] assert false;
VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 2.3s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 5 SDslu, 0 SDs, 0 SdLazy, 40 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 1575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 60/120 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
Received shutdown request...