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/recursive/regression/bpl/EvenOdd.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:07:54,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:07:54,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:07:54,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:07:54,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:07:54,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:07:54,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:07:54,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:07:54,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:07:54,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:07:54,949 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:07:54,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:07:54,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:07:54,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:07:54,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:07:54,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:07:54,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:07:54,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:07:54,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:07:54,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:07:54,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:07:54,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:07:54,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:07:54,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:07:54,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:07:54,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:07:54,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:07:54,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:07:54,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:07:54,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:07:54,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:07:54,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:07:54,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:07:54,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:07:54,982 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:07:54,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:07:54,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:07:54,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:07:54,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:07:54,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:07:54,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:07:55,013 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:07:55,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:07:55,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:07:55,031 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:07:55,031 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:07:55,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/regression/bpl/EvenOdd.bpl [2019-08-05 11:07:55,032 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/regression/bpl/EvenOdd.bpl' [2019-08-05 11:07:55,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:07:55,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:07:55,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:55,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:07:55,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:07:55,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/1) ... [2019-08-05 11:07:55,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/1) ... [2019-08-05 11:07:55,100 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:07:55,100 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:07:55,101 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:07:55,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:55,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:07:55,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:07:55,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:07:55,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/1) ... [2019-08-05 11:07:55,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/1) ... [2019-08-05 11:07:55,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/1) ... [2019-08-05 11:07:55,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/1) ... [2019-08-05 11:07:55,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/1) ... [2019-08-05 11:07:55,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/1) ... [2019-08-05 11:07:55,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/1) ... [2019-08-05 11:07:55,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:07:55,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:07:55,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:07:55,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:07:55,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (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:07:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure even [2019-08-05 11:07:55,201 INFO L138 BoogieDeclarations]: Found implementation of procedure even [2019-08-05 11:07:55,201 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 11:07:55,202 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 11:07:55,202 INFO L130 BoogieDeclarations]: Found specification of procedure odd [2019-08-05 11:07:55,202 INFO L138 BoogieDeclarations]: Found implementation of procedure odd [2019-08-05 11:07:55,494 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:07:55,495 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:07:55,497 INFO L202 PluginConnector]: Adding new model EvenOdd.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:55 BoogieIcfgContainer [2019-08-05 11:07:55,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:07:55,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:07:55,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:07:55,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:07:55,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:55" (1/2) ... [2019-08-05 11:07:55,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329a6830 and model type EvenOdd.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:07:55, skipping insertion in model container [2019-08-05 11:07:55,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EvenOdd.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:55" (2/2) ... [2019-08-05 11:07:55,508 INFO L109 eAbstractionObserver]: Analyzing ICFG EvenOdd.bpl [2019-08-05 11:07:55,517 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:07:55,525 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:07:55,540 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:07:55,563 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:07:55,564 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:07:55,564 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:07:55,564 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:07:55,564 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:07:55,565 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:07:55,565 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:07:55,565 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:07:55,565 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:07:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-08-05 11:07:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:07:55,589 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,590 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:07:55,593 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1145231439, now seen corresponding path program 1 times [2019-08-05 11:07:55,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:55,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:55,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:55,861 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:07:55,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:55,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:55,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:55,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:55,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:55,888 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states. [2019-08-05 11:07:56,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,025 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-08-05 11:07:56,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:56,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:07:56,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,040 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:07:56,040 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:07:56,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:07:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 11:07:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:07:56,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-08-05 11:07:56,086 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 6 [2019-08-05 11:07:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,086 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-08-05 11:07:56,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2019-08-05 11:07:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:07:56,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,089 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,089 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:56,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,090 INFO L82 PathProgramCache]: Analyzing trace with hash -948201294, now seen corresponding path program 1 times [2019-08-05 11:07:56,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,155 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:07:56,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:56,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:56,158 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 4 states. [2019-08-05 11:07:56,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,209 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 11:07:56,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:56,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:07:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,212 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:07:56,212 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:07:56,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:07:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 11:07:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:07:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-08-05 11:07:56,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 7 [2019-08-05 11:07:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,222 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-08-05 11:07:56,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2019-08-05 11:07:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:07:56,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,223 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,224 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1921819312, now seen corresponding path program 1 times [2019-08-05 11:07:56,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,331 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:07:56,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:07:56,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:56,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:56,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,334 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 5 states. [2019-08-05 11:07:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,536 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-08-05 11:07:56,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:56,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-05 11:07:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,539 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:07:56,539 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:07:56,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:07:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-08-05 11:07:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:07:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2019-08-05 11:07:56,546 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 10 [2019-08-05 11:07:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,546 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-08-05 11:07:56,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2019-08-05 11:07:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:07:56,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,547 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,548 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1213563699, now seen corresponding path program 1 times [2019-08-05 11:07:56,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,689 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:07:56,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 11:07:56,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:56,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:56,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,691 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 5 states. [2019-08-05 11:07:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,771 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-08-05 11:07:56,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:56,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-08-05 11:07:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,773 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:07:56,773 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:07:56,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:07:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-08-05 11:07:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:07:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-05 11:07:56,780 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2019-08-05 11:07:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,780 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-05 11:07:56,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-05 11:07:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:07:56,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,782 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,782 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:56,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1750061391, now seen corresponding path program 1 times [2019-08-05 11:07:56,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:07:56,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:56,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:56,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:56,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,858 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 5 states. [2019-08-05 11:07:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,884 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-08-05 11:07:56,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:56,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-08-05 11:07:56,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,886 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:07:56,886 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:07:56,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:07:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:07:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:07:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-08-05 11:07:56,891 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2019-08-05 11:07:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,892 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-08-05 11:07:56,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:56,892 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-08-05 11:07:56,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:07:56,893 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,893 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,894 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1630318187, now seen corresponding path program 1 times [2019-08-05 11:07:56,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:07:57,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:57,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:07:57,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:07:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:07:57,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:57,019 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 7 states. [2019-08-05 11:07:57,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:57,234 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-08-05 11:07:57,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:07:57,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-08-05 11:07:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:57,236 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:07:57,236 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:07:57,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:57,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:07:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-08-05 11:07:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:07:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-08-05 11:07:57,242 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 19 [2019-08-05 11:07:57,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:57,244 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-08-05 11:07:57,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:07:57,244 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-08-05 11:07:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:07:57,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:57,245 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:07:57,246 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2087046676, now seen corresponding path program 1 times [2019-08-05 11:07:57,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:57,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:07:57,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:07:57,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:57,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:07:57,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:07:57,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:07:57,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:57,379 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 9 states. [2019-08-05 11:07:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:57,469 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-08-05 11:07:57,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:07:57,471 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-08-05 11:07:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:57,472 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:07:57,472 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:07:57,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:57,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:07:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-08-05 11:07:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:07:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-08-05 11:07:57,479 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 26 [2019-08-05 11:07:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:57,479 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-08-05 11:07:57,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:07:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-08-05 11:07:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:07:57,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:57,481 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:57,481 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:57,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:57,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1109784073, now seen corresponding path program 2 times [2019-08-05 11:07:57,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:57,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:07:57,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:57,879 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:07:57,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:57,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:07:57,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:07:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:07:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:57,881 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 9 states. [2019-08-05 11:07:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:57,920 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-08-05 11:07:57,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:07:57,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-08-05 11:07:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:57,923 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:07:57,923 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:07:57,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:07:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-08-05 11:07:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:07:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-08-05 11:07:57,930 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 27 [2019-08-05 11:07:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:57,930 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-08-05 11:07:57,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:07:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-08-05 11:07:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:07:57,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:57,932 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-08-05 11:07:57,932 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1750801034, now seen corresponding path program 2 times [2019-08-05 11:07:57,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:57,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:07:57,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:07:58,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:58,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:07:58,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:07:58,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:07:58,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:58,056 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 10 states. [2019-08-05 11:07:58,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:58,412 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. [2019-08-05 11:07:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:07:58,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-08-05 11:07:58,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:58,414 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:07:58,414 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:07:58,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:07:58,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:07:58,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:07:58,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:07:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 11:07:58,434 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 34 [2019-08-05 11:07:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:58,435 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 11:07:58,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:07:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 11:07:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:07:58,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:58,437 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:58,437 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:58,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2060037209, now seen corresponding path program 3 times [2019-08-05 11:07:58,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:58,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:07:58,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-08-05 11:07:58,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:58,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:07:58,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:07:58,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:07:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:58,678 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 10 states. [2019-08-05 11:07:58,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:58,997 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2019-08-05 11:07:58,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:07:58,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-08-05 11:07:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:58,998 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:07:58,998 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:07:58,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:07:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:07:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:07:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:07:59,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:07:59,000 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-08-05 11:07:59,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:59,000 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:07:59,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:07:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:07:59,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:07:59,005 INFO L202 PluginConnector]: Adding new model EvenOdd.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:07:59 BoogieIcfgContainer [2019-08-05 11:07:59,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:07:59,009 INFO L168 Benchmark]: Toolchain (without parser) took 3942.38 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 107.4 MB in the beginning and 145.4 MB in the end (delta: -38.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:59,010 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:07:59,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.31 ms. Allocated memory is still 138.9 MB. Free memory was 107.4 MB in the beginning and 105.6 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:07:59,012 INFO L168 Benchmark]: Boogie Preprocessor took 21.75 ms. Allocated memory is still 138.9 MB. Free memory was 105.4 MB in the beginning and 104.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:59,013 INFO L168 Benchmark]: RCFGBuilder took 371.39 ms. Allocated memory is still 138.9 MB. Free memory was 104.2 MB in the beginning and 94.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:59,014 INFO L168 Benchmark]: TraceAbstraction took 3506.85 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 93.5 MB in the beginning and 145.4 MB in the end (delta: -51.9 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:07:59,018 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 138.9 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.31 ms. Allocated memory is still 138.9 MB. Free memory was 107.4 MB in the beginning and 105.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.75 ms. Allocated memory is still 138.9 MB. Free memory was 105.4 MB in the beginning and 104.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 371.39 ms. Allocated memory is still 138.9 MB. Free memory was 104.2 MB in the beginning and 94.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3506.85 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 93.5 MB in the beginning and 145.4 MB in the end (delta: -51.9 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: 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 3 procedures, 16 locations, 1 error locations. SAFE Result, 3.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 179 SDtfs, 25 SDslu, 464 SDs, 0 SdLazy, 283 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=7, 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, 10 MinimizatonAttempts, 16 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 179 ConstructedInterpolants, 0 QuantifiedInterpolants, 9336 SizeOfPredicates, 8 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 80/144 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...