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_37.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:58:03,700 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:58:03,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:58:03,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:58:03,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:58:03,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:58:03,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:58:03,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:58:03,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:58:03,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:58:03,725 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:58:03,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:58:03,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:58:03,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:58:03,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:58:03,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:58:03,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:58:03,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:58:03,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:58:03,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:58:03,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:58:03,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:58:03,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:58:03,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:58:03,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:58:03,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:58:03,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:58:03,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:58:03,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:58:03,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:58:03,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:58:03,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:58:03,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:58:03,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:58:03,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:58:03,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:58:03,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:58:03,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:58:03,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:58:03,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:58:03,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:58:03,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:58:03,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:58:03,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:58:03,809 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:58:03,810 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:58:03,810 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_37.bpl [2019-08-05 10:58:03,811 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_37.bpl' [2019-08-05 10:58:03,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:58:03,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:58:03,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:58:03,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:58:03,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:58:03,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/1) ... [2019-08-05 10:58:03,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/1) ... [2019-08-05 10:58:03,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:58:03,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:58:03,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:58:03,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:58:03,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/1) ... [2019-08-05 10:58:03,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/1) ... [2019-08-05 10:58:03,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/1) ... [2019-08-05 10:58:03,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/1) ... [2019-08-05 10:58:03,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/1) ... [2019-08-05 10:58:03,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/1) ... [2019-08-05 10:58:03,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/1) ... [2019-08-05 10:58:03,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:58:03,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:58:03,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:58:03,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:58:03,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (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 10:58:04,023 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:58:04,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:58:04,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:58:04,485 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:58:04,486 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:58:04,487 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:58:04 BoogieIcfgContainer [2019-08-05 10:58:04,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:58:04,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:58:04,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:58:04,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:58:04,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:58:03" (1/2) ... [2019-08-05 10:58:04,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5d621c and model type alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:58:04, skipping insertion in model container [2019-08-05 10:58:04,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:58:04" (2/2) ... [2019-08-05 10:58:04,496 INFO L109 eAbstractionObserver]: Analyzing ICFG alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl [2019-08-05 10:58:04,506 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:58:04,513 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:58:04,526 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:58:04,553 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:58:04,554 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:58:04,554 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:58:04,554 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:58:04,554 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:58:04,554 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:58:04,555 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:58:04,555 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:58:04,555 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:58:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 10:58:04,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:58:04,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:04,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:04,582 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash 148998095, now seen corresponding path program 1 times [2019-08-05 10:58:04,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:04,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:58:04,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:04,865 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 10:58:04,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:04,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:04,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-08-05 10:58:05,128 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 10:58:05,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:58:05,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:58:05,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:58:05,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:58:05,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:58:05,172 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 7 states. [2019-08-05 10:58:05,428 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-08-05 10:58:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:05,856 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 10:58:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:58:05,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:58:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:05,867 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:58:05,868 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:58:05,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:58:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:58:05,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-08-05 10:58:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:58:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 10:58:05,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2019-08-05 10:58:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:05,905 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 10:58:05,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:58:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 10:58:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:58:05,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:05,906 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:05,908 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1453301129, now seen corresponding path program 1 times [2019-08-05 10:58:05,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:06,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:58:06,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:06,192 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 10:58:06,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:06,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:06,255 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 10:58:06,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-08-05 10:58:06,403 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 10:58:06,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:58:06,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:58:06,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:58:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:58:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:58:06,406 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-08-05 10:58:06,551 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2019-08-05 10:58:06,838 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-08-05 10:58:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:06,974 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 10:58:06,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:58:06,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 10:58:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:06,975 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:58:06,975 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:58:06,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:58:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:58:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:58:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:58:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 10:58:06,979 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2019-08-05 10:58:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:06,979 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 10:58:06,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:58:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 10:58:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:58:06,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:06,980 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:06,981 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2085806019, now seen corresponding path program 1 times [2019-08-05 10:58:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:07,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:58:07,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:58:07,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:58:07,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 10:58:07,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:58:07,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:58:07,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:58:07,559 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2019-08-05 10:58:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:07,815 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-08-05 10:58:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:58:07,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 10:58:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:07,816 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:58:07,816 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:58:07,817 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:58:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:58:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:58:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:58:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-08-05 10:58:07,821 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-08-05 10:58:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:07,821 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-08-05 10:58:07,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:58:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-08-05 10:58:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:58:07,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:07,822 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:07,822 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:07,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:07,823 INFO L82 PathProgramCache]: Analyzing trace with hash -895823363, now seen corresponding path program 1 times [2019-08-05 10:58:07,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:08,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:58:08,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:08,091 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 10:58:08,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:08,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:08,123 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 10:58:08,124 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:08,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:08,173 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 10:58:08,174 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:08,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:08,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:08,182 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:33, output treesize:21 [2019-08-05 10:58:08,251 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 10:58:08,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:08,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:08,300 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 15 treesize of output 7 [2019-08-05 10:58:08,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:08,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:08,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:08,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2019-08-05 10:58:08,359 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 10:58:08,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:08,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:58:08,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:58:08,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:58:08,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:58:08,361 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 7 states. [2019-08-05 10:58:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:08,758 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-08-05 10:58:08,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:58:08,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:58:08,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:08,761 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:58:08,761 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:58:08,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:58:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:58:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-08-05 10:58:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:58:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-08-05 10:58:08,766 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2019-08-05 10:58:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:08,766 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-08-05 10:58:08,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:58:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-08-05 10:58:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:58:08,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:08,767 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:08,768 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:08,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:08,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1892740041, now seen corresponding path program 2 times [2019-08-05 10:58:08,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:08,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:58:08,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:09,064 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 10:58:09,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,084 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2019-08-05 10:58:09,138 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 23 treesize of output 13 [2019-08-05 10:58:09,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,150 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 10:58:09,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:26 [2019-08-05 10:58:09,227 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 10:58:09,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:09,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:09,244 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 10:58:09,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:14 [2019-08-05 10:58:09,297 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 10:58:09,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:09,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:58:09,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:58:09,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:58:09,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:58:09,299 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 9 states. [2019-08-05 10:58:09,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:09,528 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-08-05 10:58:09,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:58:09,528 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-05 10:58:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:09,529 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:58:09,530 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:58:09,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:58:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:58:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:58:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:58:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-08-05 10:58:09,534 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2019-08-05 10:58:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:09,535 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-08-05 10:58:09,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:58:09,535 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-08-05 10:58:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:58:09,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:09,536 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:58:09,536 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:09,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:09,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1173208335, now seen corresponding path program 3 times [2019-08-05 10:58:09,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:09,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:58:09,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:58:09,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:58:09,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:58:09,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:58:09,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:58:09,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:58:09,629 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2019-08-05 10:58:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:09,639 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2019-08-05 10:58:09,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:58:09,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-08-05 10:58:09,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:09,640 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:58:09,640 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:58:09,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 10:58:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:58:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:58:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:58:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:58:09,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-08-05 10:58:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:09,642 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:58:09,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:58:09,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:58:09,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:58:09,648 INFO L202 PluginConnector]: Adding new model alternating_list_true-unreach-call_true-valid-memsafety.i_37.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:58:09 BoogieIcfgContainer [2019-08-05 10:58:09,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:58:09,650 INFO L168 Benchmark]: Toolchain (without parser) took 5778.58 ms. Allocated memory was 134.7 MB in the beginning and 231.2 MB in the end (delta: 96.5 MB). Free memory was 109.1 MB in the beginning and 206.1 MB in the end (delta: -97.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:58:09,651 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 134.7 MB. Free memory was 111.1 MB in the beginning and 110.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:58:09,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.51 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 107.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:09,652 INFO L168 Benchmark]: Boogie Preprocessor took 34.26 ms. Allocated memory is still 134.7 MB. Free memory was 107.1 MB in the beginning and 105.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:09,653 INFO L168 Benchmark]: RCFGBuilder took 536.38 ms. Allocated memory is still 134.7 MB. Free memory was 105.5 MB in the beginning and 88.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:09,654 INFO L168 Benchmark]: TraceAbstraction took 5158.95 ms. Allocated memory was 134.7 MB in the beginning and 231.2 MB in the end (delta: 96.5 MB). Free memory was 88.1 MB in the beginning and 206.1 MB in the end (delta: -118.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:58:09,660 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.16 ms. Allocated memory is still 134.7 MB. Free memory was 111.1 MB in the beginning and 110.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.51 ms. Allocated memory is still 134.7 MB. Free memory was 109.1 MB in the beginning and 107.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.26 ms. Allocated memory is still 134.7 MB. Free memory was 107.1 MB in the beginning and 105.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 536.38 ms. Allocated memory is still 134.7 MB. Free memory was 105.5 MB in the beginning and 88.3 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5158.95 ms. Allocated memory was 134.7 MB in the beginning and 231.2 MB in the end (delta: 96.5 MB). Free memory was 88.1 MB in the beginning and 206.1 MB in the end (delta: -118.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 242]: 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.1s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 71 SDslu, 62 SDs, 0 SdLazy, 227 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 72 ConstructedInterpolants, 15 QuantifiedInterpolants, 8547 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1428 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 26/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...