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/toy/PreprocessorBranchingTest.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:43:29,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:43:29,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:43:29,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:43:29,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:43:29,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:43:29,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:43:29,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:43:29,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:43:29,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:43:29,722 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:43:29,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:43:29,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:43:29,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:43:29,724 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:43:29,726 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:43:29,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:43:29,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:43:29,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:43:29,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:43:29,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:43:29,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:43:29,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:43:29,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:43:29,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:43:29,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:43:29,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:43:29,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:43:29,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:43:29,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:43:29,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:43:29,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:43:29,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:43:29,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:43:29,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:43:29,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:43:29,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:43:29,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:43:29,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:43:29,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:43:29,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:43:29,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:43:29,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:43:29,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:43:29,819 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:43:29,819 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:43:29,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/PreprocessorBranchingTest.bpl [2019-08-05 10:43:29,820 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/PreprocessorBranchingTest.bpl' [2019-08-05 10:43:29,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:43:29,857 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:43:29,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:29,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:43:29,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:43:29,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/1) ... [2019-08-05 10:43:29,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/1) ... [2019-08-05 10:43:29,889 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:43:29,890 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:43:29,890 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:43:29,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:29,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:43:29,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:43:29,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:43:29,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/1) ... [2019-08-05 10:43:29,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/1) ... [2019-08-05 10:43:29,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/1) ... [2019-08-05 10:43:29,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/1) ... [2019-08-05 10:43:29,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/1) ... [2019-08-05 10:43:29,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/1) ... [2019-08-05 10:43:29,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/1) ... [2019-08-05 10:43:29,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:43:29,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:43:29,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:43:29,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:43:29,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (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:43:29,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure if2 given in one single declaration [2019-08-05 10:43:29,985 INFO L130 BoogieDeclarations]: Found specification of procedure if2 [2019-08-05 10:43:29,986 INFO L138 BoogieDeclarations]: Found implementation of procedure if2 [2019-08-05 10:43:29,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure if1 given in one single declaration [2019-08-05 10:43:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure if1 [2019-08-05 10:43:29,987 INFO L138 BoogieDeclarations]: Found implementation of procedure if1 [2019-08-05 10:43:29,987 INFO L124 BoogieDeclarations]: Specification and implementation of procedure if4 given in one single declaration [2019-08-05 10:43:29,987 INFO L130 BoogieDeclarations]: Found specification of procedure if4 [2019-08-05 10:43:29,988 INFO L138 BoogieDeclarations]: Found implementation of procedure if4 [2019-08-05 10:43:29,988 INFO L124 BoogieDeclarations]: Specification and implementation of procedure if3 given in one single declaration [2019-08-05 10:43:29,988 INFO L130 BoogieDeclarations]: Found specification of procedure if3 [2019-08-05 10:43:29,988 INFO L138 BoogieDeclarations]: Found implementation of procedure if3 [2019-08-05 10:43:29,989 INFO L124 BoogieDeclarations]: Specification and implementation of procedure while4 given in one single declaration [2019-08-05 10:43:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure while4 [2019-08-05 10:43:29,989 INFO L138 BoogieDeclarations]: Found implementation of procedure while4 [2019-08-05 10:43:29,989 INFO L124 BoogieDeclarations]: Specification and implementation of procedure while3 given in one single declaration [2019-08-05 10:43:29,989 INFO L130 BoogieDeclarations]: Found specification of procedure while3 [2019-08-05 10:43:29,990 INFO L138 BoogieDeclarations]: Found implementation of procedure while3 [2019-08-05 10:43:29,990 INFO L124 BoogieDeclarations]: Specification and implementation of procedure while2 given in one single declaration [2019-08-05 10:43:29,990 INFO L130 BoogieDeclarations]: Found specification of procedure while2 [2019-08-05 10:43:29,990 INFO L138 BoogieDeclarations]: Found implementation of procedure while2 [2019-08-05 10:43:29,991 INFO L124 BoogieDeclarations]: Specification and implementation of procedure while1 given in one single declaration [2019-08-05 10:43:29,991 INFO L130 BoogieDeclarations]: Found specification of procedure while1 [2019-08-05 10:43:29,991 INFO L138 BoogieDeclarations]: Found implementation of procedure while1 [2019-08-05 10:43:30,624 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:43:30,625 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 10:43:30,626 INFO L202 PluginConnector]: Adding new model PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:30 BoogieIcfgContainer [2019-08-05 10:43:30,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:43:30,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:43:30,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:43:30,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:43:30,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:29" (1/2) ... [2019-08-05 10:43:30,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65346ced and model type PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:43:30, skipping insertion in model container [2019-08-05 10:43:30,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:30" (2/2) ... [2019-08-05 10:43:30,634 INFO L109 eAbstractionObserver]: Analyzing ICFG PreprocessorBranchingTest.bpl [2019-08-05 10:43:30,643 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:43:30,650 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-08-05 10:43:30,663 INFO L252 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-08-05 10:43:30,688 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:43:30,689 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:43:30,689 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:43:30,690 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:43:30,690 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:43:30,690 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:43:30,690 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:43:30,690 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:43:30,690 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:43:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-08-05 10:43:30,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:43:30,715 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:30,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:43:30,719 INFO L418 AbstractCegarLoop]: === Iteration 1 === [if2Err0ASSERT_VIOLATIONASSERT, if1Err0ASSERT_VIOLATIONASSERT, if4Err0ASSERT_VIOLATIONASSERT, if3Err0ASSERT_VIOLATIONASSERT, while4Err0ASSERT_VIOLATIONASSERT, while3Err0ASSERT_VIOLATIONASSERT, while2Err0ASSERT_VIOLATIONASSERT, while1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:30,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:30,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2823, now seen corresponding path program 1 times [2019-08-05 10:43:30,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:30,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:43:30,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:30,825 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:43:30,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:30,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:43:30,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:43:30,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:43:30,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:30,850 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-08-05 10:43:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:30,885 INFO L93 Difference]: Finished difference Result 34 states and 30 transitions. [2019-08-05 10:43:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:30,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:43:30,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:30,898 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:43:30,898 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:43:30,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:43:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:43:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:43:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 20 transitions. [2019-08-05 10:43:30,935 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 20 transitions. Word has length 2 [2019-08-05 10:43:30,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:30,936 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 20 transitions. [2019-08-05 10:43:30,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:43:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 20 transitions. [2019-08-05 10:43:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:43:30,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:30,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:43:30,938 INFO L418 AbstractCegarLoop]: === Iteration 2 === [if2Err0ASSERT_VIOLATIONASSERT, if1Err0ASSERT_VIOLATIONASSERT, if4Err0ASSERT_VIOLATIONASSERT, if3Err0ASSERT_VIOLATIONASSERT, while4Err0ASSERT_VIOLATIONASSERT, while3Err0ASSERT_VIOLATIONASSERT, while2Err0ASSERT_VIOLATIONASSERT, while1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:30,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:30,938 INFO L82 PathProgramCache]: Analyzing trace with hash 3714, now seen corresponding path program 1 times [2019-08-05 10:43:30,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:30,945 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:43:30,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,021 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:43:31,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:31,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:43:31,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:43:31,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:43:31,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,025 INFO L87 Difference]: Start difference. First operand 24 states and 20 transitions. Second operand 3 states. [2019-08-05 10:43:31,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,027 INFO L93 Difference]: Finished difference Result 23 states and 19 transitions. [2019-08-05 10:43:31,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:31,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:43:31,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,029 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:43:31,029 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:43:31,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:43:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:43:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:43:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 18 transitions. [2019-08-05 10:43:31,034 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 18 transitions. Word has length 2 [2019-08-05 10:43:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,034 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 18 transitions. [2019-08-05 10:43:31,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:43:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 18 transitions. [2019-08-05 10:43:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:43:31,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:43:31,036 INFO L418 AbstractCegarLoop]: === Iteration 3 === [if2Err0ASSERT_VIOLATIONASSERT, if1Err0ASSERT_VIOLATIONASSERT, if4Err0ASSERT_VIOLATIONASSERT, if3Err0ASSERT_VIOLATIONASSERT, while4Err0ASSERT_VIOLATIONASSERT, while3Err0ASSERT_VIOLATIONASSERT, while2Err0ASSERT_VIOLATIONASSERT, while1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash 3828, now seen corresponding path program 1 times [2019-08-05 10:43:31,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,041 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,067 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:43:31,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:31,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:43:31,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:43:31,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:43:31,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,069 INFO L87 Difference]: Start difference. First operand 21 states and 18 transitions. Second operand 3 states. [2019-08-05 10:43:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,071 INFO L93 Difference]: Finished difference Result 20 states and 17 transitions. [2019-08-05 10:43:31,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:31,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:43:31,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,072 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:43:31,073 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:43:31,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:43:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:43:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:43:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 16 transitions. [2019-08-05 10:43:31,077 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 16 transitions. Word has length 2 [2019-08-05 10:43:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,077 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 16 transitions. [2019-08-05 10:43:31,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:43:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 16 transitions. [2019-08-05 10:43:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:43:31,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,078 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:43:31,079 INFO L418 AbstractCegarLoop]: === Iteration 4 === [if2Err0ASSERT_VIOLATIONASSERT, if1Err0ASSERT_VIOLATIONASSERT, if4Err0ASSERT_VIOLATIONASSERT, if3Err0ASSERT_VIOLATIONASSERT, while4Err0ASSERT_VIOLATIONASSERT, while3Err0ASSERT_VIOLATIONASSERT, while2Err0ASSERT_VIOLATIONASSERT, while1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,079 INFO L82 PathProgramCache]: Analyzing trace with hash 3662, now seen corresponding path program 1 times [2019-08-05 10:43:31,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,083 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,103 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:43:31,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:31,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:43:31,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:43:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:43:31,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,105 INFO L87 Difference]: Start difference. First operand 18 states and 16 transitions. Second operand 3 states. [2019-08-05 10:43:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,108 INFO L93 Difference]: Finished difference Result 17 states and 15 transitions. [2019-08-05 10:43:31,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:31,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:43:31,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,109 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:43:31,109 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:43:31,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:43:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:43:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:43:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2019-08-05 10:43:31,125 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 2 [2019-08-05 10:43:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,125 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2019-08-05 10:43:31,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:43:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2019-08-05 10:43:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:43:31,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,126 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:43:31,127 INFO L418 AbstractCegarLoop]: === Iteration 5 === [if2Err0ASSERT_VIOLATIONASSERT, if1Err0ASSERT_VIOLATIONASSERT, if4Err0ASSERT_VIOLATIONASSERT, if3Err0ASSERT_VIOLATIONASSERT, while4Err0ASSERT_VIOLATIONASSERT, while3Err0ASSERT_VIOLATIONASSERT, while2Err0ASSERT_VIOLATIONASSERT, while1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash 3756, now seen corresponding path program 1 times [2019-08-05 10:43:31,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,165 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:43:31,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:31,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:43:31,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:43:31,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:43:31,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,167 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 3 states. [2019-08-05 10:43:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,168 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2019-08-05 10:43:31,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:31,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:43:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,169 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:43:31,170 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:43:31,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:43:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:43:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:43:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:43:31,173 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 2 [2019-08-05 10:43:31,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,173 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:43:31,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:43:31,173 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:43:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:43:31,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:43:31,174 INFO L418 AbstractCegarLoop]: === Iteration 6 === [if2Err0ASSERT_VIOLATIONASSERT, if1Err0ASSERT_VIOLATIONASSERT, if4Err0ASSERT_VIOLATIONASSERT, if3Err0ASSERT_VIOLATIONASSERT, while4Err0ASSERT_VIOLATIONASSERT, while3Err0ASSERT_VIOLATIONASSERT, while2Err0ASSERT_VIOLATIONASSERT, while1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash 77648, now seen corresponding path program 1 times [2019-08-05 10:43:31,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,183 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,250 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:43:31,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:31,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:43:31,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:43:31,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:43:31,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:31,252 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 4 states. [2019-08-05 10:43:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,261 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2019-08-05 10:43:31,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:43:31,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:43:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,262 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:43:31,262 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:43:31,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:43:31,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:43:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:43:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:43:31,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 3 [2019-08-05 10:43:31,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,265 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:43:31,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:43:31,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:43:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:43:31,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,266 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:43:31,267 INFO L418 AbstractCegarLoop]: === Iteration 7 === [if2Err0ASSERT_VIOLATIONASSERT, if1Err0ASSERT_VIOLATIONASSERT, if4Err0ASSERT_VIOLATIONASSERT, if3Err0ASSERT_VIOLATIONASSERT, while4Err0ASSERT_VIOLATIONASSERT, while3Err0ASSERT_VIOLATIONASSERT, while2Err0ASSERT_VIOLATIONASSERT, while1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,267 INFO L82 PathProgramCache]: Analyzing trace with hash 67718, now seen corresponding path program 1 times [2019-08-05 10:43:31,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,350 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:43:31,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:31,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:43:31,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:43:31,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:43:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:31,351 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2019-08-05 10:43:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,381 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:43:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:43:31,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 10:43:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,383 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:43:31,383 INFO L226 Difference]: Without dead ends: 4 [2019-08-05 10:43:31,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:43:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-08-05 10:43:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-08-05 10:43:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-08-05 10:43:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-08-05 10:43:31,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 3 [2019-08-05 10:43:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,385 INFO L475 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-08-05 10:43:31,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:43:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-08-05 10:43:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:43:31,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:43:31,386 INFO L418 AbstractCegarLoop]: === Iteration 8 === [if2Err0ASSERT_VIOLATIONASSERT, if1Err0ASSERT_VIOLATIONASSERT, if4Err0ASSERT_VIOLATIONASSERT, if3Err0ASSERT_VIOLATIONASSERT, while4Err0ASSERT_VIOLATIONASSERT, while3Err0ASSERT_VIOLATIONASSERT, while2Err0ASSERT_VIOLATIONASSERT, while1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash 96515, now seen corresponding path program 1 times [2019-08-05 10:43:31,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,390 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,407 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:43:31,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:31,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:43:31,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:43:31,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:43:31,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,409 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 3 states. [2019-08-05 10:43:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,418 INFO L93 Difference]: Finished difference Result 3 states and 2 transitions. [2019-08-05 10:43:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:31,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:43:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,418 INFO L225 Difference]: With dead ends: 3 [2019-08-05 10:43:31,419 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:43:31,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:43:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:43:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:43:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:43:31,420 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-08-05 10:43:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,420 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:43:31,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:43:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:43:31,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:43:31,426 INFO L202 PluginConnector]: Adding new model PreprocessorBranchingTest.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:43:31 BoogieIcfgContainer [2019-08-05 10:43:31,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:43:31,430 INFO L168 Benchmark]: Toolchain (without parser) took 1571.15 ms. Allocated memory was 141.0 MB in the beginning and 176.2 MB in the end (delta: 35.1 MB). Free memory was 111.2 MB in the beginning and 132.0 MB in the end (delta: -20.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:31,430 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:43:31,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.25 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:31,432 INFO L168 Benchmark]: Boogie Preprocessor took 25.03 ms. Allocated memory is still 141.0 MB. Free memory was 109.1 MB in the beginning and 107.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:43:31,433 INFO L168 Benchmark]: RCFGBuilder took 708.47 ms. Allocated memory is still 141.0 MB. Free memory was 107.8 MB in the beginning and 89.3 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:31,434 INFO L168 Benchmark]: TraceAbstraction took 799.02 ms. Allocated memory was 141.0 MB in the beginning and 176.2 MB in the end (delta: 35.1 MB). Free memory was 89.3 MB in the beginning and 132.0 MB in the end (delta: -42.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:43:31,438 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 141.0 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.25 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.03 ms. Allocated memory is still 141.0 MB. Free memory was 109.1 MB in the beginning and 107.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 708.47 ms. Allocated memory is still 141.0 MB. Free memory was 107.8 MB in the beginning and 89.3 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 799.02 ms. Allocated memory was 141.0 MB in the beginning and 176.2 MB in the end (delta: 35.1 MB). Free memory was 89.3 MB in the beginning and 132.0 MB in the end (delta: -42.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 61]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 83]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 72]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 33]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 23]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 14]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 35 locations, 8 error locations. SAFE Result, 0.7s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 107 SDtfs, 1 SDslu, 107 SDs, 0 SdLazy, 9 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 46 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...