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/num_conversion_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:16:10,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:16:10,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:16:10,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:16:10,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:16:10,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:16:10,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:16:10,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:16:10,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:16:10,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:16:10,718 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:16:10,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:16:10,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:16:10,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:16:10,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:16:10,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:16:10,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:16:10,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:16:10,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:16:10,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:16:10,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:16:10,730 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:16:10,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:16:10,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:16:10,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:16:10,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:16:10,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:16:10,736 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:16:10,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:16:10,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:16:10,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:16:10,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:16:10,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:16:10,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:16:10,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:16:10,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:16:10,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:16:10,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:16:10,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:16:10,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:16:10,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:16:10,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:16:10,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:16:10,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:16:10,794 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:16:10,794 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:16:10,795 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl [2019-08-05 10:16:10,795 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_2.i_3.bpl' [2019-08-05 10:16:10,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:16:10,834 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:16:10,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:10,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:16:10,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:16:10,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/1) ... [2019-08-05 10:16:10,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/1) ... [2019-08-05 10:16:10,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:10,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:16:10,872 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:16:10,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:16:10,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/1) ... [2019-08-05 10:16:10,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/1) ... [2019-08-05 10:16:10,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/1) ... [2019-08-05 10:16:10,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/1) ... [2019-08-05 10:16:10,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/1) ... [2019-08-05 10:16:10,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/1) ... [2019-08-05 10:16:10,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/1) ... [2019-08-05 10:16:10,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:16:10,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:16:10,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:16:10,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:16:10,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (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:16:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:16:10,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:16:11,270 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:16:11,270 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:16:11,272 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:11 BoogieIcfgContainer [2019-08-05 10:16:11,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:16:11,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:16:11,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:16:11,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:16:11,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:10" (1/2) ... [2019-08-05 10:16:11,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d00446 and model type num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:16:11, skipping insertion in model container [2019-08-05 10:16:11,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:11" (2/2) ... [2019-08-05 10:16:11,280 INFO L109 eAbstractionObserver]: Analyzing ICFG num_conversion_2.i_3.bpl [2019-08-05 10:16:11,290 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:16:11,299 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:16:11,317 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:16:11,347 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:16:11,347 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:16:11,348 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:16:11,348 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:16:11,348 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:16:11,348 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:16:11,348 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:16:11,348 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:16:11,349 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:16:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:16:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:16:11,371 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:11,372 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:16:11,374 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 10:16:11,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:11,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:11,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:11,520 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:16:11,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:11,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:16:11,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:11,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:11,545 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:16:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:11,580 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:16:11,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:11,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:16:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:11,612 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:16:11,612 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:16:11,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:16:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:16:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:16:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:16:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:16:11,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:16:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:11,666 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:16:11,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:16:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:16:11,667 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:11,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:16:11,671 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:11,671 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 10:16:11,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:11,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:16:11,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:11,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:11,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:16:11,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:11,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:11,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:11,784 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:16:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:11,845 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:16:11,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:16:11,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:16:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:11,846 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:16:11,846 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:16:11,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:16:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:16:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:16:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:16:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:16:11,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:16:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:11,850 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:16:11,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:16:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:16:11,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:11,851 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:16:11,852 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:11,852 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 10:16:11,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:11,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:16:11,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:11,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:11,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:11,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:16:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:16:11,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:11,978 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:16:12,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:12,038 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:16:12,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:12,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:16:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:12,039 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:16:12,039 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:16:12,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 10:16:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:16:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:16:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:16:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:16:12,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:16:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:12,043 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:16:12,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:16:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:16:12,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:16:12,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:12,044 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:16:12,044 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 10:16:12,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:12,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:16:12,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:12,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:12,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:12,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:16:12,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:16:12,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:16:12,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:12,172 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:16:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:12,279 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:16:12,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:16:12,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:16:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:12,280 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:16:12,280 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:16:12,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:16:12,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:16:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:16:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:16:12,283 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:16:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:12,284 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:16:12,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:16:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:16:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:16:12,284 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:12,285 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:16:12,285 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:12,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 10:16:12,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:12,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:16:12,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:12,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:12,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:16:12,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:16:12,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:16:12,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:12,462 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:16:12,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:12,652 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:16:12,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:16:12,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:16:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:12,653 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:16:12,653 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:16:12,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:16:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:16:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:16:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:16:12,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:16:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:12,657 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:16:12,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:16:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:16:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:16:12,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:12,658 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:16:12,659 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:12,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 10:16:12,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:12,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:16:12,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:12,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:12,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:16:12,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:16:12,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:16:12,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:16:12,841 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:16:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:13,029 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:16:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:16:13,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:16:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:13,036 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:16:13,037 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:16:13,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:16:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:16:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:16:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:16:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:16:13,041 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:16:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:13,041 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:16:13,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:16:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:16:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:16:13,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:13,042 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:16:13,042 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:13,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 10:16:13,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:13,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:16:13,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:13,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:13,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:16:13,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:16:13,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:16:13,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:16:13,224 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:16:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:13,313 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:16:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:16:13,314 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:16:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:13,315 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:16:13,315 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:16:13,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:16:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:16:13,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:16:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:16:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:16:13,319 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:16:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:13,319 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:16:13,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:16:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:16:13,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:16:13,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:13,320 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:16:13,321 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 10:16:13,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:13,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:16:13,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:13,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:13,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:16:13,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:16:13,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:16:13,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:16:13,756 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:16:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:13,851 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:16:13,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:16:13,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:16:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:13,853 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:16:13,853 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:16:13,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:16:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:16:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:16:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:16:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:16:13,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:16:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:13,857 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:16:13,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:16:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:16:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:16:13,858 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:13,858 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:16:13,858 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:13,859 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 10:16:13,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:16:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:16:13,941 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:16:13,972 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:16:13 BoogieIcfgContainer [2019-08-05 10:16:13,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:16:13,977 INFO L168 Benchmark]: Toolchain (without parser) took 3141.12 ms. Allocated memory was 140.5 MB in the beginning and 174.1 MB in the end (delta: 33.6 MB). Free memory was 111.2 MB in the beginning and 77.5 MB in the end (delta: 33.7 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:13,978 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 112.5 MB in the beginning and 112.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:16:13,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.68 ms. Allocated memory is still 140.5 MB. Free memory was 111.0 MB in the beginning and 109.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:13,982 INFO L168 Benchmark]: Boogie Preprocessor took 21.95 ms. Allocated memory is still 140.5 MB. Free memory was 109.4 MB in the beginning and 108.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:13,983 INFO L168 Benchmark]: RCFGBuilder took 378.07 ms. Allocated memory is still 140.5 MB. Free memory was 108.1 MB in the beginning and 98.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:13,992 INFO L168 Benchmark]: TraceAbstraction took 2699.55 ms. Allocated memory was 140.5 MB in the beginning and 174.1 MB in the end (delta: 33.6 MB). Free memory was 98.3 MB in the beginning and 77.5 MB in the end (delta: 20.8 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:13,996 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.20 ms. Allocated memory is still 140.5 MB. Free memory was 112.5 MB in the beginning and 112.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.68 ms. Allocated memory is still 140.5 MB. Free memory was 111.0 MB in the beginning and 109.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.95 ms. Allocated memory is still 140.5 MB. Free memory was 109.4 MB in the beginning and 108.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 378.07 ms. Allocated memory is still 140.5 MB. Free memory was 108.1 MB in the beginning and 98.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2699.55 ms. Allocated memory was 140.5 MB in the beginning and 174.1 MB in the end (delta: 33.6 MB). Free memory was 98.3 MB in the beginning and 77.5 MB in the end (delta: 20.8 MB). Peak memory consumption was 54.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 39, overapproximation of bitwiseAnd at line 40. Possible FailurePath: [L15] havoc main_#res; [L16] havoc main_#t~nondet0, main_~i~6, main_~bit~6, main_~x~5, main_~y~5, main_~c~5; [L17] main_~x~5 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] havoc main_~y~5; [L20] havoc main_~c~5; [L21] main_~y~5 := 0; [L22] main_~c~5 := 0; VAL [main_~c~5=0, main_~x~5=1, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L38] assume !!(main_~c~5 % 256 < 8); [L39] main_~i~6 := ~shiftLeft(1, main_~c~5 % 256); [L40] main_~bit~6 := ~bitwiseAnd(main_~x~5 % 256, main_~i~6 % 256); [L41] assume main_~bit~6 % 256 != 0; [L42] main_~y~5 := main_~y~5 % 256 + main_~i~6 % 256; [L43] main_~c~5 := main_~c~5 % 256 + 1; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L30] assume !(main_~c~5 % 256 < 8); [L31] __VERIFIER_assert_#in~cond := (if main_~x~5 % 256 == main_~y~5 % 256 then 1 else 0); [L32] havoc __VERIFIER_assert_~cond; [L33] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L34] assume __VERIFIER_assert_~cond == 0; [L35] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=0, main_~x~5=1, main_~y~5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 2.6s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 0 SDslu, 36 SDs, 0 SdLazy, 276 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=8, 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 SizeOfPredicates, 8 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...