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_1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:36:33,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:36:33,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:36:33,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:36:33,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:36:33,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:36:33,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:36:33,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:36:33,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:36:33,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:36:33,950 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:36:33,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:36:33,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:36:33,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:36:33,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:36:33,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:36:33,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:36:33,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:36:33,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:36:33,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:36:33,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:36:33,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:36:33,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:36:33,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:36:33,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:36:33,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:36:33,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:36:33,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:36:33,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:36:33,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:36:33,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:36:33,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:36:33,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:36:33,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:36:33,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:36:33,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:36:33,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:36:33,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:36:33,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:36:33,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:36:34,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:36:34,038 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:36:34,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:36:34,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:36:34,060 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:36:34,061 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:36:34,062 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl [2019-08-04 21:36:34,062 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/num_conversion_1.i_3.bpl' [2019-08-04 21:36:34,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:36:34,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:36:34,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:36:34,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:36:34,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:36:34,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/1) ... [2019-08-04 21:36:34,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/1) ... [2019-08-04 21:36:34,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:36:34,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:36:34,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:36:34,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:36:34,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/1) ... [2019-08-04 21:36:34,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/1) ... [2019-08-04 21:36:34,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/1) ... [2019-08-04 21:36:34,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/1) ... [2019-08-04 21:36:34,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/1) ... [2019-08-04 21:36:34,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/1) ... [2019-08-04 21:36:34,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/1) ... [2019-08-04 21:36:34,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:36:34,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:36:34,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:36:34,173 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:36:34,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (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-04 21:36:34,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:36:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:36:34,477 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:36:34,478 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:36:34,479 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:36:34 BoogieIcfgContainer [2019-08-04 21:36:34,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:36:34,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:36:34,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:36:34,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:36:34,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:36:34" (1/2) ... [2019-08-04 21:36:34,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4771df36 and model type num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:36:34, skipping insertion in model container [2019-08-04 21:36:34,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:36:34" (2/2) ... [2019-08-04 21:36:34,487 INFO L109 eAbstractionObserver]: Analyzing ICFG num_conversion_1.i_3.bpl [2019-08-04 21:36:34,497 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:36:34,504 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:36:34,521 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:36:34,546 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:36:34,547 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:36:34,547 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:36:34,547 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:36:34,547 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:36:34,548 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:36:34,548 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:36:34,548 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:36:34,548 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:36:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:36:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:36:34,569 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:34,570 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:36:34,573 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:34,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:34,579 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:36:34,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:34,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:36:34,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:34,718 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-04 21:36:34,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:36:34,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:36:34,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:36:34,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:36:34,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:36:34,745 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:36:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:34,790 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:36:34,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:36:34,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:36:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:34,804 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:36:34,804 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:36:34,807 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-04 21:36:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:36:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:36:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:36:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:36:34,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:36:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:34,840 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:36:34,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:36:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:36:34,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:36:34,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:34,841 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:36:34,841 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:34,842 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:36:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:34,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:36:34,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:34,920 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-04 21:36:34,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:34,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:36:34,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:36:34,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:36:34,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:36:34,923 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:36:35,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:35,029 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:36:35,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:36:35,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:36:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:35,031 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:36:35,031 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:36:35,032 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-04 21:36:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:36:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:36:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:36:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:36:35,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:36:35,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:35,035 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:36:35,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:36:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:36:35,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:36:35,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:35,037 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:36:35,037 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:35,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:35,038 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:36:35,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:35,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:36:35,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:35,150 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-04 21:36:35,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:35,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:36:35,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:36:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:36:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:36:35,152 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:36:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:35,206 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:36:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:36:35,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:36:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:35,208 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:36:35,208 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:36:35,209 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-04 21:36:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:36:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:36:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:36:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:36:35,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:36:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:35,212 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:36:35,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:36:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:36:35,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:36:35,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:35,213 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:36:35,213 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:35,214 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:36:35,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:35,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:36:35,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:35,319 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-04 21:36:35,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:35,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:36:35,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:36:35,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:36:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:36:35,322 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:36:35,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:35,435 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:36:35,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:36:35,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:36:35,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:35,436 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:36:35,436 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:36:35,437 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-04 21:36:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:36:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:36:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:36:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:36:35,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:36:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:35,440 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:36:35,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:36:35,440 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:36:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:36:35,440 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:35,441 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:36:35,441 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:35,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:35,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:36:35,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:35,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:36:35,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:35,735 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-04 21:36:35,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:35,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:36:35,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:36:35,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:36:35,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:36:35,737 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:36:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:35,820 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:36:35,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:36:35,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:36:35,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:35,822 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:36:35,822 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:36:35,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:36:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:36:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:36:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:36:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:36:35,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:36:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:35,826 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:36:35,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:36:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:36:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:36:35,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:35,827 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:36:35,828 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:35,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:35,828 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:36:35,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:35,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:36:35,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:35,970 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-04 21:36:35,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:35,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:36:35,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:36:35,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:36:35,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:36:35,973 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:36:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:36,205 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:36:36,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:36:36,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:36:36,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:36,206 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:36:36,206 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:36:36,207 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-04 21:36:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:36:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:36:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:36:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:36:36,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:36:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:36,212 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:36:36,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:36:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:36:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:36:36,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:36,214 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:36:36,215 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:36:36,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:36,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-04 21:36:36,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:36,401 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-04 21:36:36,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:36,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:36:36,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:36:36,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:36:36,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:36:36,404 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:36:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:36,478 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:36:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:36:36,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:36:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:36,480 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:36:36,481 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:36:36,482 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-04 21:36:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:36:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:36:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:36:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:36:36,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:36:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:36,485 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:36:36,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:36:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:36:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:36:36,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:36,486 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:36:36,486 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:36,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:36:36,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:36:36,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-04 21:36:36,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:36:36,932 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-04 21:36:36,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:36:36,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:36:36,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:36:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:36:36,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:36:36,935 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:36:37,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:36:37,034 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:36:37,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:36:37,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:36:37,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:36:37,035 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:36:37,036 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:36:37,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:36:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:36:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:36:37,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:36:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:36:37,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:36:37,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:36:37,039 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:36:37,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:36:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:36:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:36:37,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:36:37,040 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:36:37,040 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:36:37,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:36:37,041 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:36:37,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:36:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:36:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:36:37,117 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-04 21:36:37,139 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:36:37 BoogieIcfgContainer [2019-08-04 21:36:37,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:36:37,142 INFO L168 Benchmark]: Toolchain (without parser) took 3033.44 ms. Allocated memory was 136.8 MB in the beginning and 173.5 MB in the end (delta: 36.7 MB). Free memory was 110.0 MB in the beginning and 78.9 MB in the end (delta: 31.1 MB). Peak memory consumption was 67.8 MB. Max. memory is 7.1 GB. [2019-08-04 21:36:37,143 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:36:37,144 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 136.8 MB. Free memory was 109.8 MB in the beginning and 108.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-04 21:36:37,145 INFO L168 Benchmark]: Boogie Preprocessor took 24.49 ms. Allocated memory is still 136.8 MB. Free memory was 108.1 MB in the beginning and 107.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:36:37,146 INFO L168 Benchmark]: RCFGBuilder took 306.49 ms. Allocated memory is still 136.8 MB. Free memory was 106.9 MB in the beginning and 97.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:36:37,147 INFO L168 Benchmark]: TraceAbstraction took 2658.61 ms. Allocated memory was 136.8 MB in the beginning and 173.5 MB in the end (delta: 36.7 MB). Free memory was 97.2 MB in the beginning and 78.9 MB in the end (delta: 18.3 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. [2019-08-04 21:36:37,152 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 136.8 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.27 ms. Allocated memory is still 136.8 MB. Free memory was 109.8 MB in the beginning and 108.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.49 ms. Allocated memory is still 136.8 MB. Free memory was 108.1 MB in the beginning and 107.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 306.49 ms. Allocated memory is still 136.8 MB. Free memory was 106.9 MB in the beginning and 97.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2658.61 ms. Allocated memory was 136.8 MB in the beginning and 173.5 MB in the end (delta: 36.7 MB). Free memory was 97.2 MB in the beginning and 78.9 MB in the end (delta: 18.3 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 45]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 38, overapproximation of bitwiseAnd at line 39. Possible FailurePath: [L14] havoc main_#res; [L15] havoc main_~i~5, main_~bit~5, main_~x~4, main_~y~4, main_~c~4; [L16] havoc main_~x~4; [L17] havoc main_~y~4; [L18] havoc main_~c~4; [L19] main_~x~4 := 37; [L20] main_~y~4 := 0; [L21] main_~c~4 := 0; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=1, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=2, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=3, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=4, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=5, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=6, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=7, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L37] assume !!(main_~c~4 % 256 < 8); [L38] main_~i~5 := ~shiftLeft(1, main_~c~4 % 256); [L39] main_~bit~5 := ~bitwiseAnd(main_~x~4 % 256, main_~i~5 % 256); [L40] assume main_~bit~5 % 256 != 0; [L41] main_~y~4 := main_~y~4 % 256 + main_~i~5 % 256; [L42] main_~c~4 := main_~c~4 % 256 + 1; VAL [main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L29] assume !(main_~c~4 % 256 < 8); [L30] __VERIFIER_assert_#in~cond := (if main_~x~4 % 256 == main_~y~4 % 256 then 1 else 0); [L31] havoc __VERIFIER_assert_~cond; [L32] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L33] assume __VERIFIER_assert_~cond == 0; [L34] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=0] [L45] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=1, main_~c~4=8, main_~i~5=0, main_~x~4=37, main_~y~4=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.8s 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.6s 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, 80 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...