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/scalable/INC_likeFlaggedButNoFlag8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:49:51,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:49:51,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:49:51,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:49:51,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:49:51,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:49:51,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:49:51,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:49:51,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:49:51,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:49:51,820 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:49:51,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:49:51,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:49:51,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:49:51,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:49:51,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:49:51,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:49:51,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:49:51,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:49:51,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:49:51,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:49:51,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:49:51,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:49:51,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:49:51,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:49:51,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:49:51,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:49:51,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:49:51,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:49:51,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:49:51,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:49:51,841 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:49:51,841 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:49:51,842 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:49:51,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:49:51,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:49:51,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:49:51,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:49:51,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:49:51,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:49:51,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:49:51,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:49:51,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:49:51,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:49:51,893 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:49:51,893 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:49:51,894 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/INC_likeFlaggedButNoFlag8.bpl [2019-08-05 10:49:51,894 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/INC_likeFlaggedButNoFlag8.bpl' [2019-08-05 10:49:51,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:49:51,941 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:49:51,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:51,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:49:51,945 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:49:51,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... [2019-08-05 10:49:51,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... [2019-08-05 10:49:51,980 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:49:51,981 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:49:51,981 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:49:51,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:49:51,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:49:51,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:49:51,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:49:51,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... [2019-08-05 10:49:51,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... [2019-08-05 10:49:52,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... [2019-08-05 10:49:52,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... [2019-08-05 10:49:52,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... [2019-08-05 10:49:52,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... [2019-08-05 10:49:52,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... [2019-08-05 10:49:52,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:49:52,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:49:52,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:49:52,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:49:52,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:49:52,109 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2019-08-05 10:49:52,109 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-05 10:49:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-05 10:49:52,563 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:49:52,563 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-08-05 10:49:52,564 INFO L202 PluginConnector]: Adding new model INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:52 BoogieIcfgContainer [2019-08-05 10:49:52,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:49:52,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:49:52,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:49:52,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:49:52,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:49:51" (1/2) ... [2019-08-05 10:49:52,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da05c73 and model type INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:49:52, skipping insertion in model container [2019-08-05 10:49:52,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:49:52" (2/2) ... [2019-08-05 10:49:52,573 INFO L109 eAbstractionObserver]: Analyzing ICFG INC_likeFlaggedButNoFlag8.bpl [2019-08-05 10:49:52,583 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:49:52,595 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:49:52,614 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:49:52,639 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:49:52,640 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:49:52,640 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:49:52,640 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:49:52,640 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:49:52,640 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:49:52,640 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:49:52,641 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:49:52,641 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:49:52,652 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-08-05 10:49:52,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:49:52,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:52,661 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:49:52,664 INFO L418 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:52,670 INFO L82 PathProgramCache]: Analyzing trace with hash 955536, now seen corresponding path program 1 times [2019-08-05 10:49:52,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:52,769 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:49:52,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:52,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:52,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:49:52,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:49:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:49:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:52,914 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-08-05 10:49:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:53,058 INFO L93 Difference]: Finished difference Result 22 states and 42 transitions. [2019-08-05 10:49:53,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:49:53,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 10:49:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:53,075 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:49:53,075 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:49:53,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:49:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:49:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:49:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:49:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2019-08-05 10:49:53,113 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 4 [2019-08-05 10:49:53,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:53,115 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 30 transitions. [2019-08-05 10:49:53,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:49:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. [2019-08-05 10:49:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:53,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:53,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:49:53,117 INFO L418 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash 29622166, now seen corresponding path program 1 times [2019-08-05 10:49:53,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:53,141 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:49:53,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:53,405 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:49:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:53,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:53,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:53,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:53,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:53,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:53,557 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. Second operand 4 states. [2019-08-05 10:49:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:53,793 INFO L93 Difference]: Finished difference Result 19 states and 30 transitions. [2019-08-05 10:49:53,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:53,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:49:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:53,795 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:49:53,795 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:49:53,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:49:53,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:49:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:49:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2019-08-05 10:49:53,800 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2019-08-05 10:49:53,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:53,801 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2019-08-05 10:49:53,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2019-08-05 10:49:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:53,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:53,802 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:49:53,802 INFO L418 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:53,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:53,802 INFO L82 PathProgramCache]: Analyzing trace with hash 29156546, now seen corresponding path program 1 times [2019-08-05 10:49:53,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:53,820 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:49:53,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:53,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:53,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:53,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:53,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:53,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:53,978 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 4 states. [2019-08-05 10:49:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:54,096 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2019-08-05 10:49:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:54,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:49:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:54,098 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:49:54,098 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:49:54,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:54,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:49:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:49:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:49:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2019-08-05 10:49:54,102 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 22 transitions. Word has length 5 [2019-08-05 10:49:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:54,103 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 22 transitions. [2019-08-05 10:49:54,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 22 transitions. [2019-08-05 10:49:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:54,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:54,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:49:54,104 INFO L418 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:54,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash 29191204, now seen corresponding path program 1 times [2019-08-05 10:49:54,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:54,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:49:54,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:54,299 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:49:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:54,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:54,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:54,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:54,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:54,304 INFO L87 Difference]: Start difference. First operand 14 states and 22 transitions. Second operand 4 states. [2019-08-05 10:49:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:54,358 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2019-08-05 10:49:54,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:54,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:49:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:54,359 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:49:54,359 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:49:54,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:49:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:49:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:49:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2019-08-05 10:49:54,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 5 [2019-08-05 10:49:54,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:54,364 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 18 transitions. [2019-08-05 10:49:54,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:54,364 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2019-08-05 10:49:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:54,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:54,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:49:54,365 INFO L418 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:54,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:54,365 INFO L82 PathProgramCache]: Analyzing trace with hash 28821808, now seen corresponding path program 1 times [2019-08-05 10:49:54,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:54,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:49:54,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:54,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:54,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:54,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:54,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:54,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:54,477 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand 4 states. [2019-08-05 10:49:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:54,506 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2019-08-05 10:49:54,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:54,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:49:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:54,508 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:49:54,508 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:49:54,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-05 10:49:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:49:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:49:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:49:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-08-05 10:49:54,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 5 [2019-08-05 10:49:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:54,511 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-08-05 10:49:54,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-08-05 10:49:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:54,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:54,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:49:54,512 INFO L418 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash 29956904, now seen corresponding path program 1 times [2019-08-05 10:49:54,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:54,525 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:49:54,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:54,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:54,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:54,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:54,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:54,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:54,624 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 4 states. [2019-08-05 10:49:54,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:54,776 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-08-05 10:49:54,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:54,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:49:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:54,777 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:49:54,777 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:49:54,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-05 10:49:54,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:49:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:49:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:49:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 10:49:54,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 10:49:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:54,780 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 10:49:54,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 10:49:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:54,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:54,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:49:54,782 INFO L418 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:54,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash 29991562, now seen corresponding path program 1 times [2019-08-05 10:49:54,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:54,807 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:49:54,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:55,011 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:49:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:55,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:55,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:55,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:55,066 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2019-08-05 10:49:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:55,108 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:49:55,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:55,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:49:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:55,109 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:49:55,109 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:49:55,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:49:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:49:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:49:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:49:55,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 5 [2019-08-05 10:49:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:55,112 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:49:55,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:49:55,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:49:55,113 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:49:55,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:49:55,114 INFO L418 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:49:55,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:49:55,114 INFO L82 PathProgramCache]: Analyzing trace with hash 29587508, now seen corresponding path program 1 times [2019-08-05 10:49:55,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:49:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:49:55,125 WARN L254 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:49:55,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:49:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:49:55,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:49:55,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:49:55,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:49:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:49:55,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:49:55,227 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 10:49:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:49:55,244 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 10:49:55,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:49:55,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 10:49:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:49:55,244 INFO L225 Difference]: With dead ends: 5 [2019-08-05 10:49:55,244 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:49:55,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-05 10:49:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:49:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:49:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:49:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:49:55,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-08-05 10:49:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:49:55,246 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:49:55,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:49:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:49:55,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:49:55,251 INFO L202 PluginConnector]: Adding new model INC_likeFlaggedButNoFlag8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:49:55 BoogieIcfgContainer [2019-08-05 10:49:55,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:49:55,254 INFO L168 Benchmark]: Toolchain (without parser) took 3313.00 ms. Allocated memory was 135.8 MB in the beginning and 167.8 MB in the end (delta: 32.0 MB). Free memory was 112.0 MB in the beginning and 76.0 MB in the end (delta: 35.9 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:55,255 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory was 113.4 MB in the beginning and 113.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:49:55,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.41 ms. Allocated memory is still 135.8 MB. Free memory was 112.0 MB in the beginning and 110.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:55,257 INFO L168 Benchmark]: Boogie Preprocessor took 43.65 ms. Allocated memory is still 135.8 MB. Free memory was 110.1 MB in the beginning and 108.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:55,258 INFO L168 Benchmark]: RCFGBuilder took 536.57 ms. Allocated memory is still 135.8 MB. Free memory was 108.8 MB in the beginning and 95.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:55,259 INFO L168 Benchmark]: TraceAbstraction took 2685.69 ms. Allocated memory was 135.8 MB in the beginning and 167.8 MB in the end (delta: 32.0 MB). Free memory was 95.6 MB in the beginning and 76.0 MB in the end (delta: 19.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:49:55,263 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.8 MB. Free memory was 113.4 MB in the beginning and 113.2 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 39.41 ms. Allocated memory is still 135.8 MB. Free memory was 112.0 MB in the beginning and 110.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.65 ms. Allocated memory is still 135.8 MB. Free memory was 110.1 MB in the beginning and 108.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 536.57 ms. Allocated memory is still 135.8 MB. Free memory was 108.8 MB in the beginning and 95.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2685.69 ms. Allocated memory was 135.8 MB in the beginning and 167.8 MB in the end (delta: 32.0 MB). Free memory was 95.6 MB in the beginning and 76.0 MB in the end (delta: 19.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 63]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 87 SDtfs, 43 SDslu, 73 SDs, 0 SdLazy, 108 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=1, 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.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 3025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...