java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:49:56,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:49:56,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:49:56,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:49:56,324 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:49:56,325 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:49:56,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:49:56,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:49:56,330 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:49:56,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:49:56,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:49:56,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:49:56,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:49:56,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:49:56,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:49:56,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:49:56,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:49:56,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:49:56,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:49:56,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:49:56,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:49:56,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:49:56,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:49:56,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:49:56,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:49:56,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:49:56,355 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:49:56,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:49:56,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:49:56,358 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:49:56,358 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:49:56,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:49:56,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:49:56,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:49:56,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:49:56,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:49:56,366 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:49:56,387 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:49:56,387 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:49:56,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:49:56,389 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:49:56,389 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:49:56,390 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:49:56,390 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:49:56,390 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:49:56,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:49:56,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:49:56,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:49:56,452 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:49:56,453 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:49:56,454 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 [2018-07-25 08:49:56,454 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl' [2018-07-25 08:49:56,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:49:56,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:49:56,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:49:56,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:49:56,515 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:49:56,534 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.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,551 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.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:49:56,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:49:56,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:49:56,560 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:49:56,572 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.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,572 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.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,573 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.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,573 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.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,577 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.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,579 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.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,580 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.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:49:56,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:49:56,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:49:56,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:49:56,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:56" (1/1) ... [2018-07-25 08:49:56,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:49:56,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:49:56,836 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:49:56,836 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:49:56 BoogieIcfgContainer [2018-07-25 08:49:56,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:49:56,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:49:56,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:49:56,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:49:56,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:49:56" (1/2) ... [2018-07-25 08:49:56,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6410ae5a and model type string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:49:56, skipping insertion in model container [2018-07-25 08:49:56,844 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.07 08:49:56" (2/2) ... [2018-07-25 08:49:56,848 INFO L112 eAbstractionObserver]: Analyzing ICFG string.i_3.bpl [2018-07-25 08:49:56,859 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:49:56,867 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:49:56,916 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:49:56,917 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:49:56,917 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:49:56,917 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:49:56,917 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:49:56,918 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:49:56,918 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:49:56,918 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:49:56,918 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:49:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-07-25 08:49:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:49:56,946 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:56,947 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 08:49:56,949 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:56,955 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-07-25 08:49:56,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:49:57,027 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:49:57,028 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:49:57,031 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:49:57,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:49:57,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:49:57,046 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-07-25 08:49:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:57,085 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-07-25 08:49:57,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:49:57,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-07-25 08:49:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:57,099 INFO L225 Difference]: With dead ends: 16 [2018-07-25 08:49:57,099 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:49:57,103 INFO L574 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 [2018-07-25 08:49:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:49:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:49:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:49:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-07-25 08:49:57,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2018-07-25 08:49:57,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:57,146 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-07-25 08:49:57,146 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:49:57,146 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-07-25 08:49:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:49:57,147 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:57,147 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 08:49:57,148 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-07-25 08:49:57,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-25 08:49:57,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:57,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:49:57,190 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:49:57,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:49:57,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:49:57,191 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-07-25 08:49:57,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:57,228 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-07-25 08:49:57,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:49:57,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-07-25 08:49:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:57,230 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:49:57,230 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:49:57,231 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:49:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:49:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:49:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:49:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-07-25 08:49:57,236 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-07-25 08:49:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:57,236 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-07-25 08:49:57,236 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:49:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-07-25 08:49:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:49:57,237 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:57,237 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-07-25 08:49:57,238 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 2 times [2018-07-25 08:49:57,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-25 08:49:57,276 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:57,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:49:57,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:49:57,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:49:57,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:49:57,278 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-07-25 08:49:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:57,312 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-07-25 08:49:57,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:49:57,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-07-25 08:49:57,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:57,314 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:49:57,314 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:49:57,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:49:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:49:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:49:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:49:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-07-25 08:49:57,326 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-07-25 08:49:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:57,327 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-07-25 08:49:57,327 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:49:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-07-25 08:49:57,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:49:57,328 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:57,329 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-07-25 08:49:57,329 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:57,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 3 times [2018-07-25 08:49:57,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:57,397 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-25 08:49:57,398 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:57,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:49:57,398 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:49:57,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:49:57,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:49:57,400 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-07-25 08:49:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:57,433 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-07-25 08:49:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:49:57,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-07-25 08:49:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:57,435 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:49:57,435 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:49:57,436 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:49:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:49:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:49:57,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:49:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-07-25 08:49:57,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-07-25 08:49:57,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:57,442 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-07-25 08:49:57,442 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:49:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-07-25 08:49:57,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:49:57,445 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:57,445 INFO L354 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-07-25 08:49:57,445 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:57,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 4 times [2018-07-25 08:49:57,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:49:57,540 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-07-25 08:49:57,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:49:57,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:49:57,541 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:49:57,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:49:57,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:49:57,542 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-07-25 08:49:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:49:57,574 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-07-25 08:49:57,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:49:57,575 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-07-25 08:49:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:49:57,575 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:49:57,576 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:49:57,576 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:49:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:49:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:49:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:49:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-07-25 08:49:57,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-07-25 08:49:57,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:49:57,584 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-07-25 08:49:57,584 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:49:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-07-25 08:49:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:49:57,585 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:49:57,585 INFO L354 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-07-25 08:49:57,586 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:49:57,586 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 5 times [2018-07-25 08:49:57,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:49:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 08:49:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-07-25 08:49:57,709 INFO L420 BasicCegarLoop]: Counterexample might be feasible [2018-07-25 08:49:57,732 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:49:57 BoogieIcfgContainer [2018-07-25 08:49:57,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:49:57,734 INFO L168 Benchmark]: Toolchain (without parser) took 1220.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-07-25 08:49:57,736 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:49:57,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:49:57,738 INFO L168 Benchmark]: Boogie Preprocessor took 22.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:49:57,738 INFO L168 Benchmark]: RCFGBuilder took 253.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:49:57,740 INFO L168 Benchmark]: TraceAbstraction took 895.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-07-25 08:49:57,745 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.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 253.72 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 895.14 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.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] [L35] assume true; 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] [L35] assume true; 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] [L35] assume true; 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] [L35] assume true; 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] [L35] assume true; 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] [L35] assume true; 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] [L54] assume true; 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] [L54] assume true; 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] [L54] assume true; 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] [L54] assume true; 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] [L54] assume true; 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] [L54] assume true; 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; [L62] assume true; [L63] assume !(main_~string_A~5[main_~nc_A~5] != 0); [L64] main_~nc_B~5 := 0; [L65] assume true; [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; [L70] assume true; [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, 9 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 20 SDslu, 30 SDs, 0 SdLazy, 40 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 1945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 40/80 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 Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/string.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-49-57-761.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/string.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-49-57-761.csv Received shutdown request...