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/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:22:03,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:22:03,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:22:03,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:22:03,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:22:03,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:22:03,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:22:03,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:22:03,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:22:03,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:22:03,791 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:22:03,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:22:03,792 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:22:03,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:22:03,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:22:03,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:22:03,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:22:03,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:22:03,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:22:03,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:22:03,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:22:03,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:22:03,805 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:22:03,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:22:03,808 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:22:03,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:22:03,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:22:03,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:22:03,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:22:03,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:22:03,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:22:03,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:22:03,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:22:03,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:22:03,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:22:03,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:22:03,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:22:03,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:22:03,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:22:03,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:22:03,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:22:03,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:22:03,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:22:03,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:22:03,863 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:22:03,863 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:22:03,864 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl [2019-08-05 10:22:03,864 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_3.BV.c.cil.c_19.bpl' [2019-08-05 10:22:03,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:22:03,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:22:03,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:22:03,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:22:03,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:22:03,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/1) ... [2019-08-05 10:22:03,962 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/1) ... [2019-08-05 10:22:03,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:22:03,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:22:03,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:22:03,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:22:03,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/1) ... [2019-08-05 10:22:03,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/1) ... [2019-08-05 10:22:03,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/1) ... [2019-08-05 10:22:03,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/1) ... [2019-08-05 10:22:04,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/1) ... [2019-08-05 10:22:04,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/1) ... [2019-08-05 10:22:04,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/1) ... [2019-08-05 10:22:04,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:22:04,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:22:04,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:22:04,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:22:04,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22: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:22:04,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:22:04,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:22:04,787 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:22:05,015 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:22:05,015 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:22:05,017 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:22:05 BoogieIcfgContainer [2019-08-05 10:22:05,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:22:05,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:22:05,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:22:05,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:22:05,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:22:03" (1/2) ... [2019-08-05 10:22:05,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18947378 and model type s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:22:05, skipping insertion in model container [2019-08-05 10:22:05,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:22:05" (2/2) ... [2019-08-05 10:22:05,027 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil.c_19.bpl [2019-08-05 10:22:05,036 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:22:05,045 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:22:05,062 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:22:05,095 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:22:05,096 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:22:05,096 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:22:05,097 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:22:05,097 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:22:05,097 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:22:05,097 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:22:05,097 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:22:05,098 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:22:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-08-05 10:22:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:22:05,119 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:05,120 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:05,123 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:05,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1918382949, now seen corresponding path program 1 times [2019-08-05 10:22:05,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:05,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:22:05,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:05,351 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:22:05,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:05,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:22:05,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:05,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:05,378 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-08-05 10:22:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:05,527 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2019-08-05 10:22:05,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:05,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 10:22:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:05,542 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:22:05,543 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:22:05,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:22:05,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:22:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:22:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:22:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-08-05 10:22:05,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2019-08-05 10:22:05,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:05,579 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-08-05 10:22:05,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2019-08-05 10:22:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:22:05,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:05,580 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:05,580 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:05,581 INFO L82 PathProgramCache]: Analyzing trace with hash -688967491, now seen corresponding path program 1 times [2019-08-05 10:22:05,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:05,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:22:05,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:05,661 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:22:05,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:05,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:05,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:05,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:05,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:05,664 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 3 states. [2019-08-05 10:22:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:05,900 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2019-08-05 10:22:05,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:05,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-08-05 10:22:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:05,902 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:22:05,902 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:22:05,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:22:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:22:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:22:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:22:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-08-05 10:22:05,908 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2019-08-05 10:22:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:05,908 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-08-05 10:22:05,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2019-08-05 10:22:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:22:05,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:05,910 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:05,910 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash 485156347, now seen corresponding path program 1 times [2019-08-05 10:22:05,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:05,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:22:05,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:22:06,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:06,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:06,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:06,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:06,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:06,052 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand 3 states. [2019-08-05 10:22:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:06,314 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-08-05 10:22:06,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:06,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-08-05 10:22:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:06,316 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:22:06,316 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:22:06,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:22:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:22:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:22:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:22:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-08-05 10:22:06,323 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 17 [2019-08-05 10:22:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:06,323 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-08-05 10:22:06,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2019-08-05 10:22:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:22:06,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:06,326 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:06,326 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:06,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:06,327 INFO L82 PathProgramCache]: Analyzing trace with hash -916394828, now seen corresponding path program 1 times [2019-08-05 10:22:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:06,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:22:06,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:22:06,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:06,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:22:06,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:22:06,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:22:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:06,481 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2019-08-05 10:22:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:06,603 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-08-05 10:22:06,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:22:06,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-08-05 10:22:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:06,605 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:22:06,605 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:22:06,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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 10:22:06,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:22:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:22:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:22:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2019-08-05 10:22:06,610 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 22 [2019-08-05 10:22:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:06,611 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2019-08-05 10:22:06,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:22:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2019-08-05 10:22:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:22:06,612 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:06,612 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:06,613 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1318200254, now seen corresponding path program 1 times [2019-08-05 10:22:06,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:06,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:22:06,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 10:22:06,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:06,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:06,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:06,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:06,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:06,717 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 3 states. [2019-08-05 10:22:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:06,869 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-08-05 10:22:06,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:06,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-08-05 10:22:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:06,871 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:22:06,871 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:22:06,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:22:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:22:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:22:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:22:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-08-05 10:22:06,877 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 28 [2019-08-05 10:22:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:06,878 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-08-05 10:22:06,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:06,878 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-08-05 10:22:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:22:06,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:06,879 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:06,879 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:06,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash 2119602962, now seen corresponding path program 1 times [2019-08-05 10:22:06,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:06,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:22:06,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:22:06,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:06,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:06,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:06,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:06,989 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 3 states. [2019-08-05 10:22:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:07,041 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2019-08-05 10:22:07,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:07,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-08-05 10:22:07,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:07,044 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:22:07,044 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:22:07,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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:22:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:22:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2019-08-05 10:22:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:22:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2019-08-05 10:22:07,053 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 35 [2019-08-05 10:22:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:07,054 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-08-05 10:22:07,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2019-08-05 10:22:07,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:22:07,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:07,055 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:07,056 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:07,056 INFO L82 PathProgramCache]: Analyzing trace with hash -260516355, now seen corresponding path program 2 times [2019-08-05 10:22:07,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:07,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:22:07,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 10:22:07,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:07,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:07,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:07,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:07,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:07,164 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand 3 states. [2019-08-05 10:22:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:07,449 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2019-08-05 10:22:07,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:07,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-08-05 10:22:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:07,454 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:22:07,454 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:22:07,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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:22:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:22:07,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2019-08-05 10:22:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:22:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-08-05 10:22:07,466 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 40 [2019-08-05 10:22:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:07,466 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-08-05 10:22:07,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-08-05 10:22:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:22:07,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:07,468 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:07,469 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:07,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:07,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1811127759, now seen corresponding path program 1 times [2019-08-05 10:22:07,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:07,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:22:07,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-08-05 10:22:07,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:07,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:07,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:07,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:07,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:07,566 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 3 states. [2019-08-05 10:22:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:07,780 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-08-05 10:22:07,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:07,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-08-05 10:22:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:07,782 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:22:07,782 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:22:07,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:22:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:22:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:22:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:22:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-08-05 10:22:07,789 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 50 [2019-08-05 10:22:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:07,790 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-08-05 10:22:07,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-08-05 10:22:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:22:07,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:07,791 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:07,792 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:07,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1362781927, now seen corresponding path program 1 times [2019-08-05 10:22:07,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:07,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:22:07,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-08-05 10:22:07,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:22:07,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:22:07,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:22:07,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:22:07,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:22:07,903 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 3 states. [2019-08-05 10:22:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:08,135 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2019-08-05 10:22:08,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:22:08,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-08-05 10:22:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:08,137 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:22:08,137 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:22:08,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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:22:08,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:22:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:22:08,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:22:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2019-08-05 10:22:08,145 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 59 [2019-08-05 10:22:08,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:08,145 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2019-08-05 10:22:08,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:22:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2019-08-05 10:22:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:22:08,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:08,147 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 6, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:08,148 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash 541073165, now seen corresponding path program 1 times [2019-08-05 10:22:08,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:08,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:22:08,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:22:08,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:08,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:22:08,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:22:08,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:22:08,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:22:08,347 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand 4 states. [2019-08-05 10:22:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:08,553 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2019-08-05 10:22:08,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:22:08,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-08-05 10:22:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:08,556 INFO L225 Difference]: With dead ends: 149 [2019-08-05 10:22:08,556 INFO L226 Difference]: Without dead ends: 149 [2019-08-05 10:22:08,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 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 10:22:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-08-05 10:22:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-08-05 10:22:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-08-05 10:22:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 163 transitions. [2019-08-05 10:22:08,566 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 163 transitions. Word has length 68 [2019-08-05 10:22:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:08,567 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 163 transitions. [2019-08-05 10:22:08,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:22:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2019-08-05 10:22:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:22:08,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:08,569 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:08,569 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1413403359, now seen corresponding path program 2 times [2019-08-05 10:22:08,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:08,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:22:08,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 175 proven. 20 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:22:08,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:08,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:22:08,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:22:08,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:22:08,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:22:08,824 INFO L87 Difference]: Start difference. First operand 146 states and 163 transitions. Second operand 5 states. [2019-08-05 10:22:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:09,080 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2019-08-05 10:22:09,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:22:09,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-08-05 10:22:09,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:09,084 INFO L225 Difference]: With dead ends: 179 [2019-08-05 10:22:09,085 INFO L226 Difference]: Without dead ends: 179 [2019-08-05 10:22:09,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 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 10:22:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-08-05 10:22:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-08-05 10:22:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-08-05 10:22:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2019-08-05 10:22:09,095 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 78 [2019-08-05 10:22:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:09,095 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2019-08-05 10:22:09,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:22:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2019-08-05 10:22:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:22:09,097 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:09,097 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 8, 7, 6, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:09,098 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:09,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash 794060849, now seen corresponding path program 3 times [2019-08-05 10:22:09,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:09,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:22:09,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:09,467 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-08-05 10:22:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 224 proven. 45 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:22:09,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:09,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:22:09,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:22:09,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:22:09,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:22:09,523 INFO L87 Difference]: Start difference. First operand 176 states and 193 transitions. Second operand 6 states. [2019-08-05 10:22:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:09,974 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2019-08-05 10:22:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:22:09,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-08-05 10:22:09,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:09,977 INFO L225 Difference]: With dead ends: 209 [2019-08-05 10:22:09,978 INFO L226 Difference]: Without dead ends: 209 [2019-08-05 10:22:09,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:22:09,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-08-05 10:22:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-08-05 10:22:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-08-05 10:22:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2019-08-05 10:22:09,985 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 88 [2019-08-05 10:22:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:09,986 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2019-08-05 10:22:09,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:22:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2019-08-05 10:22:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:22:09,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:22:09,988 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 9, 8, 7, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:22:09,988 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:22:09,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:22:09,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1049297149, now seen corresponding path program 4 times [2019-08-05 10:22:09,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:22:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:22:10,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:22:10,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:22:17,446 WARN L188 SmtUtils]: Spent 7.06 s on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-08-05 10:22:17,491 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:17,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:22:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 273 proven. 80 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-08-05 10:22:17,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:22:17,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:22:17,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:22:17,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:22:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:22:17,762 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 7 states. [2019-08-05 10:22:18,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:22:18,553 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2019-08-05 10:22:18,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:22:18,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-08-05 10:22:18,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:22:18,555 INFO L225 Difference]: With dead ends: 157 [2019-08-05 10:22:18,555 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:22:18,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:22:18,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:22:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:22:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:22:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:22:18,557 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2019-08-05 10:22:18,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:22:18,557 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:22:18,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:22:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:22:18,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:22:18,562 INFO L202 PluginConnector]: Adding new model s3_clnt_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:22:18 BoogieIcfgContainer [2019-08-05 10:22:18,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:22:18,564 INFO L168 Benchmark]: Toolchain (without parser) took 14635.15 ms. Allocated memory was 133.2 MB in the beginning and 237.5 MB in the end (delta: 104.3 MB). Free memory was 108.3 MB in the beginning and 157.9 MB in the end (delta: -49.6 MB). Peak memory consumption was 54.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:18,565 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 133.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:22:18,566 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.43 ms. Allocated memory is still 133.2 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:18,567 INFO L168 Benchmark]: Boogie Preprocessor took 60.59 ms. Allocated memory is still 133.2 MB. Free memory was 106.6 MB in the beginning and 104.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:18,568 INFO L168 Benchmark]: RCFGBuilder took 985.15 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 74.3 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:18,569 INFO L168 Benchmark]: TraceAbstraction took 13543.80 ms. Allocated memory was 133.2 MB in the beginning and 237.5 MB in the end (delta: 104.3 MB). Free memory was 73.8 MB in the beginning and 157.9 MB in the end (delta: -84.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:22:18,572 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 133.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.43 ms. Allocated memory is still 133.2 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.59 ms. Allocated memory is still 133.2 MB. Free memory was 106.6 MB in the beginning and 104.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 985.15 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 74.3 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13543.80 ms. Allocated memory was 133.2 MB in the beginning and 237.5 MB in the end (delta: 104.3 MB). Free memory was 73.8 MB in the beginning and 157.9 MB in the end (delta: -84.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 400]: 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, 15 locations, 1 error locations. SAFE Result, 13.4s OverallTime, 13 OverallIterations, 13 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 291 SDtfs, 41 SDslu, 138 SDs, 0 SdLazy, 914 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 593 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=12, 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, 13 MinimizatonAttempts, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 606 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 593 ConstructedInterpolants, 10 QuantifiedInterpolants, 302817 SizeOfPredicates, 54 NumberOfNonLiveVariables, 4192 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 1664/1819 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...