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 -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:01:08,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:01:08,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:01:08,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:01:08,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:01:08,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:01:08,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:01:08,132 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:01:08,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:01:08,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:01:08,136 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:01:08,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:01:08,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:01:08,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:01:08,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:01:08,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:01:08,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:01:08,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:01:08,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:01:08,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:01:08,149 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:01:08,150 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:01:08,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:01:08,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:01:08,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:01:08,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:01:08,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:01:08,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:01:08,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:01:08,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:01:08,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:01:08,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:01:08,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:01:08,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:01:08,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:01:08,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:01:08,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:01:08,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:01:08,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:01:08,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:01:08,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:01:08,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:01:08,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:01:08,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:01:08,235 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:01:08,235 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:01:08,236 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl [2019-08-05 11:01:08,236 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl' [2019-08-05 11:01:08,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:01:08,301 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:01:08,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:08,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:01:08,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:01:08,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/1) ... [2019-08-05 11:01:08,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/1) ... [2019-08-05 11:01:08,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:08,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:01:08,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:01:08,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:01:08,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/1) ... [2019-08-05 11:01:08,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/1) ... [2019-08-05 11:01:08,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/1) ... [2019-08-05 11:01:08,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/1) ... [2019-08-05 11:01:08,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/1) ... [2019-08-05 11:01:08,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/1) ... [2019-08-05 11:01:08,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/1) ... [2019-08-05 11:01:08,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:01:08,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:01:08,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:01:08,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:01:08,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:01:08,461 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:01:08,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:01:08,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:01:09,139 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:01:09,140 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:01:09,141 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:09 BoogieIcfgContainer [2019-08-05 11:01:09,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:01:09,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:01:09,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:01:09,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:01:09,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:08" (1/2) ... [2019-08-05 11:01:09,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@296ac9c2 and model type alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:01:09, skipping insertion in model container [2019-08-05 11:01:09,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:09" (2/2) ... [2019-08-05 11:01:09,150 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl [2019-08-05 11:01:09,160 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:01:09,168 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:01:09,183 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:01:09,209 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:01:09,210 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:01:09,210 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:01:09,211 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:01:09,211 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:01:09,211 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:01:09,211 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:01:09,211 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:01:09,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:01:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 11:01:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:01:09,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:09,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:09,238 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:09,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash 149184785, now seen corresponding path program 1 times [2019-08-05 11:01:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:09,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:01:09,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:09,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:09,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:09,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:09,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:09,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 11:01:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:09,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:09,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:01:09,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:09,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:09,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:09,667 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2019-08-05 11:01:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:10,120 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 11:01:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:01:10,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:01:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:10,134 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:01:10,138 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:01:10,141 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:01:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 11:01:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:01:10,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 11:01:10,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2019-08-05 11:01:10,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:10,175 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 11:01:10,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 11:01:10,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:01:10,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:10,176 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:10,177 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:10,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:10,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1632710475, now seen corresponding path program 1 times [2019-08-05 11:01:10,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:10,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:01:10,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:10,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-08-05 11:01:10,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:10,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:10,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:10,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 11:01:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:10,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:10,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:01:10,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:01:10,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:01:10,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:10,718 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-08-05 11:01:10,936 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-08-05 11:01:11,187 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-08-05 11:01:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:11,308 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 11:01:11,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:01:11,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:01:11,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:11,309 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:01:11,309 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:01:11,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:01:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:01:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:01:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:01:11,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2019-08-05 11:01:11,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:11,313 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:01:11,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:01:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:01:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:01:11,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:11,314 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:11,314 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:11,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:11,315 INFO L82 PathProgramCache]: Analyzing trace with hash 271750501, now seen corresponding path program 1 times [2019-08-05 11:01:11,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:11,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:01:11,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:11,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:11,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:11,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:11,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:11,582 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-08-05 11:01:11,610 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:11,628 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_19|], 1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:01:11,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-08-05 11:01:11,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:11,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:11,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:11,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 11:01:11,728 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:11,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:11,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:11,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:01:11,868 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:11,986 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:01:11,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:11,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:11,988 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2019-08-05 11:01:12,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-08-05 11:01:12,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:12,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2019-08-05 11:01:12,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 11:01:12,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2019-08-05 11:01:12,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-08-05 11:01:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:01:12,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:12,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:01:12,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:01:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:01:12,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:12,260 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 6 states. [2019-08-05 11:01:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:12,384 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-08-05 11:01:12,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:01:12,385 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-08-05 11:01:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:12,385 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:01:12,386 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:01:12,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:01:12,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:01:12,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:01:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-08-05 11:01:12,390 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2019-08-05 11:01:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:12,390 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-08-05 11:01:12,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:01:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-08-05 11:01:12,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:01:12,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:12,391 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:12,391 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 986193113, now seen corresponding path program 1 times [2019-08-05 11:01:12,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:12,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:01:12,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:12,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:12,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-08-05 11:01:12,691 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:12,716 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|ULTIMATE.start_#Ultimate.alloc_old_#valid|]} [2019-08-05 11:01:12,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-08-05 11:01:12,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-08-05 11:01:12,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:01:12,850 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,859 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:23 [2019-08-05 11:01:12,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-08-05 11:01:12,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,944 INFO L567 ElimStorePlain]: treesize reduction 8, result has 75.8 percent of original size [2019-08-05 11:01:12,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-08-05 11:01:12,951 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:12,958 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2019-08-05 11:01:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:01:13,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:13,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:01:13,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:01:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:01:13,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:13,029 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 8 states. [2019-08-05 11:01:13,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:13,363 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-08-05 11:01:13,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:01:13,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 11:01:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:13,364 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:01:13,365 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:01:13,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:01:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:01:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-08-05 11:01:13,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:01:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-08-05 11:01:13,369 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2019-08-05 11:01:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:13,370 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-08-05 11:01:13,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:01:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-08-05 11:01:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:01:13,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:13,371 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:13,371 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:13,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1456137965, now seen corresponding path program 2 times [2019-08-05 11:01:13,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:13,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:01:13,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:13,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:01:13,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:13,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:13,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 11:01:13,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:13,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:13,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:13,680 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2019-08-05 11:01:13,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-08-05 11:01:13,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:13,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:13,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:13,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2019-08-05 11:01:13,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-08-05 11:01:13,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:13,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:13,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:13,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:14 [2019-08-05 11:01:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:13,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:13,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:01:13,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:01:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:01:13,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:13,837 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 10 states. [2019-08-05 11:01:14,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:14,341 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-08-05 11:01:14,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:01:14,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-08-05 11:01:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:14,342 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:01:14,342 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:01:14,343 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:01:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:01:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:01:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:01:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-08-05 11:01:14,346 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 16 [2019-08-05 11:01:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:14,346 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-08-05 11:01:14,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:01:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-08-05 11:01:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:01:14,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:14,347 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:01:14,347 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:14,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1022335047, now seen corresponding path program 2 times [2019-08-05 11:01:14,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:14,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:01:14,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 11:01:14,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:14,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:01:14,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:01:14,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:01:14,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:14,703 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 7 states. [2019-08-05 11:01:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:14,858 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-08-05 11:01:14,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:01:14,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-08-05 11:01:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:14,859 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:01:14,859 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:01:14,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:01:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:01:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:01:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-08-05 11:01:14,864 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-08-05 11:01:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:14,865 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-08-05 11:01:14,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:01:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-08-05 11:01:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:01:14,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:14,866 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:01:14,866 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:14,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:14,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2027916639, now seen corresponding path program 3 times [2019-08-05 11:01:14,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:14,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:01:14,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-08-05 11:01:14,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:14,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:01:14,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:01:14,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:01:14,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:14,957 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2019-08-05 11:01:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:15,010 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:01:15,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:01:15,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 11:01:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:15,012 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:01:15,012 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:01:15,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-08-05 11:01:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:01:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:01:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:01:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:01:15,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-08-05 11:01:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:15,014 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:01:15,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:01:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:01:15,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:01:15,019 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_47.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:01:15 BoogieIcfgContainer [2019-08-05 11:01:15,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:01:15,022 INFO L168 Benchmark]: Toolchain (without parser) took 6720.37 ms. Allocated memory was 140.5 MB in the beginning and 240.6 MB in the end (delta: 100.1 MB). Free memory was 109.2 MB in the beginning and 141.3 MB in the end (delta: -32.0 MB). Peak memory consumption was 68.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:15,022 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:01:15,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.60 ms. Allocated memory is still 140.5 MB. Free memory was 108.8 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:15,024 INFO L168 Benchmark]: Boogie Preprocessor took 36.49 ms. Allocated memory is still 140.5 MB. Free memory was 107.1 MB in the beginning and 105.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:15,024 INFO L168 Benchmark]: RCFGBuilder took 757.12 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 80.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:15,028 INFO L168 Benchmark]: TraceAbstraction took 5876.89 ms. Allocated memory was 140.5 MB in the beginning and 240.6 MB in the end (delta: 100.1 MB). Free memory was 79.9 MB in the beginning and 141.3 MB in the end (delta: -61.4 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:15,031 INFO L335 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.22 ms. Allocated memory is still 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.60 ms. Allocated memory is still 140.5 MB. Free memory was 108.8 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.49 ms. Allocated memory is still 140.5 MB. Free memory was 107.1 MB in the beginning and 105.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 757.12 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 80.3 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5876.89 ms. Allocated memory was 140.5 MB in the beginning and 240.6 MB in the end (delta: 100.1 MB). Free memory was 79.9 MB in the beginning and 141.3 MB in the end (delta: -61.4 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 260]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. SAFE Result, 5.8s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 54 SDslu, 90 SDs, 0 SdLazy, 297 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 17 QuantifiedInterpolants, 10200 SizeOfPredicates, 147 NumberOfNonLiveVariables, 1653 ConjunctsInSsa, 258 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 40/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...