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/20170319-ConjunctivePathPrograms/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:27:14,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:27:14,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:27:14,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:27:14,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:27:14,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:27:14,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:27:14,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:27:14,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:27:14,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:27:14,057 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:27:14,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:27:14,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:27:14,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:27:14,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:27:14,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:27:14,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:27:14,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:27:14,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:27:14,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:27:14,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:27:14,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:27:14,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:27:14,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:27:14,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:27:14,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:27:14,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:27:14,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:27:14,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:27:14,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:27:14,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:27:14,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:27:14,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:27:14,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:27:14,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:27:14,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:27:14,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:27:14,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:27:14,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:27:14,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:27:14,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:27:14,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:27:14,145 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:27:14,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:27:14,152 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:27:14,153 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:27:14,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl [2019-08-04 21:27:14,155 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl' [2019-08-04 21:27:14,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:27:14,208 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:27:14,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:27:14,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:27:14,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:27:14,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/1) ... [2019-08-04 21:27:14,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/1) ... [2019-08-04 21:27:14,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:27:14,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:27:14,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:27:14,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:27:14,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/1) ... [2019-08-04 21:27:14,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/1) ... [2019-08-04 21:27:14,261 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/1) ... [2019-08-04 21:27:14,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/1) ... [2019-08-04 21:27:14,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/1) ... [2019-08-04 21:27:14,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/1) ... [2019-08-04 21:27:14,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/1) ... [2019-08-04 21:27:14,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:27:14,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:27:14,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:27:14,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:27:14,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (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:27:14,344 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-04 21:27:14,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:27:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:27:14,509 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:27:14,509 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:27:14,510 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:27:14 BoogieIcfgContainer [2019-08-04 21:27:14,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:27:14,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:27:14,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:27:14,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:27:14,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:27:14" (1/2) ... [2019-08-04 21:27:14,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1103246f and model type num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:27:14, skipping insertion in model container [2019-08-04 21:27:14,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:27:14" (2/2) ... [2019-08-04 21:27:14,519 INFO L109 eAbstractionObserver]: Analyzing ICFG num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl [2019-08-04 21:27:14,528 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:27:14,536 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:27:14,553 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:27:14,577 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:27:14,578 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:27:14,578 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:27:14,578 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:27:14,578 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:27:14,579 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:27:14,579 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:27:14,579 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:27:14,579 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:27:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:27:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:27:14,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:14,601 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:27:14,603 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:14,610 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:27:14,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:14,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-04 21:27:14,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:14,737 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:27:14,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:27:14,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:27:14,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:27:14,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:27:14,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:27:14,760 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:27:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:14,803 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:27:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:27:14,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:27:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:14,816 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:27:14,816 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:27:14,818 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:27:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:27:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:27:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:27:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:27:14,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:27:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:14,852 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:27:14,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:27:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:27:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:27:14,853 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:14,854 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:27:14,854 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:14,855 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:27:14,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:14,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:27:14,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:14,974 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:27:14,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:14,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:27:14,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:27:14,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:27:14,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:27:14,977 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:27:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:15,068 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:27:15,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:27:15,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:27:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:15,070 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:27:15,070 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:27:15,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:27:15,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:27:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:27:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:27:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:27:15,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:27:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:15,075 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:27:15,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:27:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:27:15,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:27:15,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:15,076 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:27:15,076 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:27:15,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:15,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-04 21:27:15,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:15,191 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:27:15,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:15,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:27:15,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:27:15,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:27:15,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:27:15,194 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:27:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:15,240 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:27:15,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:27:15,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:27:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:15,241 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:27:15,241 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:27:15,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:27:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:27:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:27:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:27:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:27:15,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:27:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:15,245 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:27:15,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:27:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:27:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:27:15,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:15,246 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:27:15,247 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:27:15,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:15,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:27:15,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:15,378 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:27:15,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:15,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:27:15,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:27:15,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:27:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:27:15,381 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:27:15,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:15,413 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:27:15,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:27:15,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:27:15,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:15,425 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:27:15,426 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:27:15,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:27:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:27:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:27:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:27:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:27:15,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:27:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:15,430 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:27:15,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:27:15,430 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:27:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:27:15,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:15,431 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:27:15,431 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:15,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:27:15,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:15,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-04 21:27:15,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:15,636 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:27:15,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:15,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:27:15,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:27:15,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:27:15,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:27:15,638 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:27:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:15,765 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:27:15,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:27:15,766 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:27:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:15,767 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:27:15,767 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:27:15,768 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:27:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:27:15,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:27:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:27:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:27:15,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:27:15,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:15,773 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:27:15,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:27:15,773 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:27:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:27:15,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:15,774 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:27:15,774 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:27:15,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:15,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:27:15,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:15,957 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:27:15,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:15,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:27:15,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:27:15,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:27:15,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:27:15,960 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:27:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:16,004 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:27:16,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:27:16,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:27:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:16,006 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:27:16,006 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:27:16,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:27:16,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:27:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:27:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:27:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:27:16,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:27:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:16,010 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:27:16,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:27:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:27:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:27:16,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:16,011 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:27:16,012 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:16,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:27:16,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:16,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:27:16,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:16,241 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:27:16,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:27:16,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:27:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:27:16,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:27:16,244 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-04 21:27:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:16,292 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-04 21:27:16,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-04 21:27:16,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-04 21:27:16,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:16,294 INFO L225 Difference]: With dead ends: 11 [2019-08-04 21:27:16,294 INFO L226 Difference]: Without dead ends: 11 [2019-08-04 21:27:16,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:27:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-04 21:27:16,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-04 21:27:16,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-04 21:27:16,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-04 21:27:16,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-04 21:27:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:16,298 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-04 21:27:16,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:27:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-04 21:27:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:27:16,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:16,299 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-04 21:27:16,299 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-04 21:27:16,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:27:16,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:27:16,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:27:16,463 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:27:16,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:27:16,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:27:16,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:27:16,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:27:16,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:27:16,465 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-04 21:27:16,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:27:16,507 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-04 21:27:16,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:27:16,515 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-04 21:27:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:27:16,516 INFO L225 Difference]: With dead ends: 12 [2019-08-04 21:27:16,516 INFO L226 Difference]: Without dead ends: 12 [2019-08-04 21:27:16,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:27:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-04 21:27:16,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-04 21:27:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-04 21:27:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-04 21:27:16,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-04 21:27:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:27:16,520 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-04 21:27:16,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:27:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-04 21:27:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-04 21:27:16,521 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:27:16,521 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-04 21:27:16,521 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:27:16,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:27:16,522 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-04 21:27:16,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:27:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:27:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:27:16,617 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-04 21:27:16,638 INFO L202 PluginConnector]: Adding new model num_conversion_2.i_3.bplTransformedIcfg_BEv2_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:27:16 BoogieIcfgContainer [2019-08-04 21:27:16,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:27:16,641 INFO L168 Benchmark]: Toolchain (without parser) took 2431.97 ms. Allocated memory was 138.9 MB in the beginning and 176.2 MB in the end (delta: 37.2 MB). Free memory was 109.8 MB in the beginning and 94.7 MB in the end (delta: 15.2 MB). Peak memory consumption was 52.4 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:16,642 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 138.9 MB. Free memory was 111.1 MB in the beginning and 110.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-04 21:27:16,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.39 ms. Allocated memory is still 138.9 MB. Free memory was 109.6 MB in the beginning and 108.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:16,644 INFO L168 Benchmark]: Boogie Preprocessor took 24.88 ms. Allocated memory is still 138.9 MB. Free memory was 108.1 MB in the beginning and 106.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:16,645 INFO L168 Benchmark]: RCFGBuilder took 237.24 ms. Allocated memory is still 138.9 MB. Free memory was 106.9 MB in the beginning and 97.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:16,646 INFO L168 Benchmark]: TraceAbstraction took 2126.58 ms. Allocated memory was 138.9 MB in the beginning and 176.2 MB in the end (delta: 37.2 MB). Free memory was 97.1 MB in the beginning and 94.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:27:16,650 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.25 ms. Allocated memory is still 138.9 MB. Free memory was 111.1 MB in the beginning and 110.9 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 38.39 ms. Allocated memory is still 138.9 MB. Free memory was 109.6 MB in the beginning and 108.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.88 ms. Allocated memory is still 138.9 MB. Free memory was 108.1 MB in the beginning and 106.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 237.24 ms. Allocated memory is still 138.9 MB. Free memory was 106.9 MB in the beginning and 97.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2126.58 ms. Allocated memory was 138.9 MB in the beginning and 176.2 MB in the end (delta: 37.2 MB). Free memory was 97.1 MB in the beginning and 94.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 47]: assertion can be violated assertion can be violated We found a FailurePath: [L15] havoc main_#res; [L16] havoc main_#t~nondet0, main_~i~6, main_~bit~6, main_~c~5, main_~x~5, main_~y~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] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=1, main_~i~6=0, main_~x~5=-1, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=2, main_~i~6=0, main_~x~5=-1, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=3, main_~i~6=0, main_~x~5=-1, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=4, main_~i~6=0, main_~x~5=-1, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=5, main_~i~6=0, main_~x~5=-1, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=6, main_~i~6=0, main_~x~5=-1, main_~y~5=0] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=7, main_~i~6=1, main_~x~5=-1, main_~y~5=1] [L37] assume 0 <= main_~c~5 && main_~c~5 < 8; [L38] havoc main_~i~6; [L39] havoc main_~bit~6; [L40] assume (!(main_~bit~6 == 0) && main_~bit~6 < 256) && 0 <= main_~bit~6; [L41] assume ((0 <= main_~y~5 && 0 <= main_~i~6) && main_~i~6 < 256) && main_~y~5 < 256; [L42] main_~y~5 := main_~i~6 + main_~y~5; [L43] assume main_~c~5 < 256 && 0 <= main_~c~5; [L44] main_~c~5 := main_~c~5 + 1; VAL [main_~bit~6=1, main_~c~5=8, main_~i~6=255, main_~x~5=-1, main_~y~5=256] [L29] assume main_~c~5 < 256 && !(main_~c~5 < 8); [L30] assume (((!(main_~x~5 + 256 == main_~y~5 - 256) && -256 <= main_~x~5) && main_~y~5 < 256 + 256) && 256 <= main_~y~5) && main_~x~5 < 0; [L31] __VERIFIER_assert_#in~cond := 0; [L32] havoc __VERIFIER_assert_~cond; [L33] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L34] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=255, main_~x~5=-1, main_~y~5=256] [L47] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~6=1, main_~c~5=8, main_~i~6=255, main_~x~5=-1, main_~y~5=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 2.0s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 0 SDslu, 21 SDs, 0 SdLazy, 65 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s 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.0s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 SizeOfPredicates, 9 NumberOfNonLiveVariables, 568 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 0/84 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...