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_25.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:04:27,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:04:27,075 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:04:27,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:04:27,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:04:27,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:04:27,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:04:27,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:04:27,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:04:27,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:04:27,095 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:04:27,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:04:27,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:04:27,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:04:27,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:04:27,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:04:27,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:04:27,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:04:27,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:04:27,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:04:27,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:04:27,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:04:27,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:04:27,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:04:27,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:04:27,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:04:27,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:04:27,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:04:27,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:04:27,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:04:27,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:04:27,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:04:27,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:04:27,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:04:27,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:04:27,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:04:27,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:04:27,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:04:27,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:04:27,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:04:27,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:04:27,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:04:27,161 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:04:27,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:04:27,168 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:04:27,168 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:04:27,169 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_25.bpl [2019-08-05 11:04:27,170 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_25.bpl' [2019-08-05 11:04:27,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:04:27,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:04:27,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:27,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:04:27,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:04:27,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/1) ... [2019-08-05 11:04:27,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/1) ... [2019-08-05 11:04:27,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:27,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:04:27,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:04:27,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:04:27,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/1) ... [2019-08-05 11:04:27,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/1) ... [2019-08-05 11:04:27,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/1) ... [2019-08-05 11:04:27,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/1) ... [2019-08-05 11:04:27,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/1) ... [2019-08-05 11:04:27,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/1) ... [2019-08-05 11:04:27,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/1) ... [2019-08-05 11:04:27,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:04:27,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:04:27,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:04:27,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:04:27,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (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:04:27,404 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:04:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:04:27,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:04:27,847 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:04:27,848 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:04:27,849 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:27 BoogieIcfgContainer [2019-08-05 11:04:27,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:04:27,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:04:27,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:04:27,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:04:27,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:27" (1/2) ... [2019-08-05 11:04:27,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19f5c2ce and model type alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:04:27, skipping insertion in model container [2019-08-05 11:04:27,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:27" (2/2) ... [2019-08-05 11:04:27,862 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl [2019-08-05 11:04:27,871 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:04:27,882 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:04:27,899 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:04:27,928 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:04:27,929 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:04:27,929 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:04:27,929 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:04:27,930 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:04:27,930 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:04:27,930 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:04:27,930 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:04:27,930 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:04:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:04:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:04:27,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:27,953 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:04:27,955 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:27,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:27,961 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2019-08-05 11:04:28,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:28,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:04:28,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:28,181 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:04:28,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:28,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:28,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:28,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 11:04:28,289 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:04:28,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:28,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:04:28,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:04:28,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:04:28,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:28,309 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 5 states. [2019-08-05 11:04:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:28,585 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:04:28,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:04:28,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:04:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:28,599 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:04:28,599 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:04:28,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:04:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:04:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:04:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:04:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:04:28,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 11:04:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:28,652 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:04:28,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:04:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:04:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:04:28,653 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:28,654 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:04:28,654 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:28,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash 149049733, now seen corresponding path program 1 times [2019-08-05 11:04:28,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:28,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:04:28,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:28,845 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:04:28,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:28,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:28,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:28,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-08-05 11:04:29,047 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:04:29,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:29,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:04:29,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:04:29,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:04:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:04:29,053 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2019-08-05 11:04:29,250 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-08-05 11:04:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:29,317 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:04:29,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:04:29,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 11:04:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:29,319 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:04:29,319 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:04:29,320 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:29,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:04:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:04:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:04:29,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:04:29,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 11:04:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:29,323 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:04:29,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:04:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:04:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:04:29,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:29,325 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:04:29,325 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2019-08-05 11:04:29,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:29,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:04:29,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:29,545 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:04:29,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,562 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:04:29,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:11 [2019-08-05 11:04:29,685 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:04:29,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:29,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:29,688 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:04:29,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-08-05 11:04:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:29,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:29,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:04:29,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:29,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:29,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:29,733 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 7 states. [2019-08-05 11:04:30,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:30,099 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:04:30,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:04:30,100 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 11:04:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:30,101 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:04:30,101 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:04:30,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:04:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:04:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:04:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:04:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:04:30,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 11:04:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:30,105 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:04:30,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:04:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:04:30,106 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:30,106 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:04:30,107 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2135429881, now seen corresponding path program 2 times [2019-08-05 11:04:30,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:30,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:04:30,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:04:30,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:30,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:04:30,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:04:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:04:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:04:30,208 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2019-08-05 11:04:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:30,229 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2019-08-05 11:04:30,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:04:30,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 11:04:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:30,230 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:04:30,231 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:04:30,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:04:30,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:04:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:04:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:04:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:04:30,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-05 11:04:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:30,235 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:04:30,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:04:30,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:04:30,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:04:30,241 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:04:30 BoogieIcfgContainer [2019-08-05 11:04:30,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:04:30,244 INFO L168 Benchmark]: Toolchain (without parser) took 2997.93 ms. Allocated memory was 142.1 MB in the beginning and 176.2 MB in the end (delta: 34.1 MB). Free memory was 110.9 MB in the beginning and 84.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:30,244 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 142.1 MB. Free memory is still 112.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:04:30,245 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.95 ms. Allocated memory is still 142.1 MB. Free memory was 110.9 MB in the beginning and 109.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:30,246 INFO L168 Benchmark]: Boogie Preprocessor took 30.69 ms. Allocated memory is still 142.1 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:30,247 INFO L168 Benchmark]: RCFGBuilder took 516.17 ms. Allocated memory is still 142.1 MB. Free memory was 107.4 MB in the beginning and 91.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:30,248 INFO L168 Benchmark]: TraceAbstraction took 2389.00 ms. Allocated memory was 142.1 MB in the beginning and 176.2 MB in the end (delta: 34.1 MB). Free memory was 91.7 MB in the beginning and 84.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:30,251 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.23 ms. Allocated memory is still 142.1 MB. Free memory is still 112.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.95 ms. Allocated memory is still 142.1 MB. Free memory was 110.9 MB in the beginning and 109.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.69 ms. Allocated memory is still 142.1 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 516.17 ms. Allocated memory is still 142.1 MB. Free memory was 107.4 MB in the beginning and 91.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2389.00 ms. Allocated memory was 142.1 MB in the beginning and 176.2 MB in the end (delta: 34.1 MB). Free memory was 91.7 MB in the beginning and 84.4 MB in the end (delta: 7.3 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 201]: 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, 8 locations, 1 error locations. SAFE Result, 2.3s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21 SDtfs, 17 SDslu, 21 SDs, 0 SdLazy, 61 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=3, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 2 QuantifiedInterpolants, 1318 SizeOfPredicates, 37 NumberOfNonLiveVariables, 624 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 10/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...