java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/027b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:23:41,768 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:23:41,771 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:23:41,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:23:41,787 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:23:41,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:23:41,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:23:41,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:23:41,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:23:41,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:23:41,798 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:23:41,799 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:23:41,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:23:41,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:23:41,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:23:41,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:23:41,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:23:41,819 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:23:41,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:23:41,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:23:41,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:23:41,824 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:23:41,824 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:23:41,824 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:23:41,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:23:41,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:23:41,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:23:41,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:23:41,832 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:23:41,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:23:41,833 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:23:41,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:23:41,834 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:23:41,834 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:23:41,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:23:41,838 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:23:41,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:23:41,859 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:23:41,859 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:23:41,859 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:23:41,860 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:23:41,860 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:23:41,861 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:23:41,861 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:23:41,861 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:23:41,861 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:23:41,861 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:23:41,861 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:23:41,862 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:23:41,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:23:41,862 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:23:41,862 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:23:41,862 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:23:41,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:23:41,863 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:23:41,866 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:23:41,866 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:23:41,912 INFO ]: Repository-Root is: /tmp [2018-06-22 11:23:41,928 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:23:41,933 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:23:41,935 INFO ]: Initializing SmtParser... [2018-06-22 11:23:41,935 INFO ]: SmtParser initialized [2018-06-22 11:23:41,936 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/027b-horn.smt2 [2018-06-22 11:23:41,938 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/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 [2018-06-22 11:23:42,025 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/027b-horn.smt2 unknown [2018-06-22 11:23:42,263 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/027b-horn.smt2 [2018-06-22 11:23:42,272 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:23:42,277 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:23:42,278 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:23:42,278 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:23:42,278 INFO ]: ChcToBoogie initialized [2018-06-22 11:23:42,282 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:23:42" (1/1) ... [2018-06-22 11:23:42,322 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42 Unit [2018-06-22 11:23:42,322 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:23:42,323 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:23:42,323 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:23:42,323 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:23:42,343 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42" (1/1) ... [2018-06-22 11:23:42,343 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42" (1/1) ... [2018-06-22 11:23:42,348 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42" (1/1) ... [2018-06-22 11:23:42,348 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42" (1/1) ... [2018-06-22 11:23:42,352 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42" (1/1) ... [2018-06-22 11:23:42,353 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42" (1/1) ... [2018-06-22 11:23:42,354 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42" (1/1) ... [2018-06-22 11:23:42,358 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:23:42,359 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:23:42,359 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:23:42,359 INFO ]: RCFGBuilder initialized [2018-06-22 11:23:42,360 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-22 11:23:42,370 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:23:42,371 INFO ]: Found specification of procedure False [2018-06-22 11:23:42,371 INFO ]: Found implementation of procedure False [2018-06-22 11:23:42,371 INFO ]: Specification and implementation of procedure INV1 given in one single declaration [2018-06-22 11:23:42,371 INFO ]: Found specification of procedure INV1 [2018-06-22 11:23:42,371 INFO ]: Found implementation of procedure INV1 [2018-06-22 11:23:42,371 INFO ]: Specification and implementation of procedure INV2 given in one single declaration [2018-06-22 11:23:42,371 INFO ]: Found specification of procedure INV2 [2018-06-22 11:23:42,371 INFO ]: Found implementation of procedure INV2 [2018-06-22 11:23:42,371 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:23:42,371 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:23:42,371 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:23:42,697 INFO ]: Using library mode [2018-06-22 11:23:42,698 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:23:42 BoogieIcfgContainer [2018-06-22 11:23:42,698 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:23:42,699 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:23:42,699 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:23:42,702 INFO ]: TraceAbstraction initialized [2018-06-22 11:23:42,702 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:23:42" (1/3) ... [2018-06-22 11:23:42,703 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e0f114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:23:42, skipping insertion in model container [2018-06-22 11:23:42,703 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:23:42" (2/3) ... [2018-06-22 11:23:42,704 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e0f114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:23:42, skipping insertion in model container [2018-06-22 11:23:42,704 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:23:42" (3/3) ... [2018-06-22 11:23:42,705 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:23:42,714 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:23:42,723 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:23:42,780 INFO ]: Using default assertion order modulation [2018-06-22 11:23:42,780 INFO ]: Interprodecural is true [2018-06-22 11:23:42,780 INFO ]: Hoare is false [2018-06-22 11:23:42,780 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:23:42,780 INFO ]: Backedges is TWOTRACK [2018-06-22 11:23:42,780 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:23:42,781 INFO ]: Difference is false [2018-06-22 11:23:42,781 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:23:42,785 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:23:42,804 INFO ]: Start isEmpty. Operand 23 states. [2018-06-22 11:23:42,825 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:23:42,825 INFO ]: Found error trace [2018-06-22 11:23:42,827 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:42,827 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:42,832 INFO ]: Analyzing trace with hash -1000329844, now seen corresponding path program 1 times [2018-06-22 11:23:42,834 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:42,834 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:42,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:42,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:42,881 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:42,932 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:43,039 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:23:43,041 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:43,041 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:43,042 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:43,052 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:43,052 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:43,054 INFO ]: Start difference. First operand 23 states. Second operand 4 states. [2018-06-22 11:23:43,151 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:43,151 INFO ]: Finished difference Result 23 states and 38 transitions. [2018-06-22 11:23:43,152 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:23:43,153 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:23:43,153 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:43,170 INFO ]: With dead ends: 23 [2018-06-22 11:23:43,170 INFO ]: Without dead ends: 23 [2018-06-22 11:23:43,174 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:43,191 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:23:43,216 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:23:43,217 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:23:43,219 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2018-06-22 11:23:43,220 INFO ]: Start accepts. Automaton has 23 states and 38 transitions. Word has length 9 [2018-06-22 11:23:43,221 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:43,221 INFO ]: Abstraction has 23 states and 38 transitions. [2018-06-22 11:23:43,221 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:43,221 INFO ]: Start isEmpty. Operand 23 states and 38 transitions. [2018-06-22 11:23:43,223 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:23:43,223 INFO ]: Found error trace [2018-06-22 11:23:43,223 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:43,223 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:43,224 INFO ]: Analyzing trace with hash -27111145, now seen corresponding path program 1 times [2018-06-22 11:23:43,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:43,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:43,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:43,224 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:43,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:43,241 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:43,331 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:23:43,331 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:43,331 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:43,332 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:43,332 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:43,332 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:43,333 INFO ]: Start difference. First operand 23 states and 38 transitions. Second operand 4 states. [2018-06-22 11:23:43,536 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:43,536 INFO ]: Finished difference Result 27 states and 46 transitions. [2018-06-22 11:23:43,537 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:23:43,537 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:23:43,537 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:43,538 INFO ]: With dead ends: 27 [2018-06-22 11:23:43,538 INFO ]: Without dead ends: 27 [2018-06-22 11:23:43,539 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:43,539 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:23:43,550 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-22 11:23:43,550 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:23:43,551 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 44 transitions. [2018-06-22 11:23:43,551 INFO ]: Start accepts. Automaton has 25 states and 44 transitions. Word has length 9 [2018-06-22 11:23:43,553 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:43,553 INFO ]: Abstraction has 25 states and 44 transitions. [2018-06-22 11:23:43,553 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:43,554 INFO ]: Start isEmpty. Operand 25 states and 44 transitions. [2018-06-22 11:23:43,555 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:43,555 INFO ]: Found error trace [2018-06-22 11:23:43,555 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:43,555 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:43,555 INFO ]: Analyzing trace with hash 1879944949, now seen corresponding path program 1 times [2018-06-22 11:23:43,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:43,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:43,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:43,556 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:43,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:43,577 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:43,625 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:23:43,625 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:43,625 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:43,625 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:43,625 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:43,625 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:43,625 INFO ]: Start difference. First operand 25 states and 44 transitions. Second operand 4 states. [2018-06-22 11:23:43,694 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:43,694 INFO ]: Finished difference Result 25 states and 42 transitions. [2018-06-22 11:23:43,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:23:43,695 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:23:43,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:43,696 INFO ]: With dead ends: 25 [2018-06-22 11:23:43,696 INFO ]: Without dead ends: 17 [2018-06-22 11:23:43,696 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:43,696 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 11:23:43,700 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 11:23:43,701 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:23:43,702 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2018-06-22 11:23:43,702 INFO ]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 13 [2018-06-22 11:23:43,702 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:43,702 INFO ]: Abstraction has 17 states and 30 transitions. [2018-06-22 11:23:43,702 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:43,702 INFO ]: Start isEmpty. Operand 17 states and 30 transitions. [2018-06-22 11:23:43,703 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:43,703 INFO ]: Found error trace [2018-06-22 11:23:43,703 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:43,703 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:43,703 INFO ]: Analyzing trace with hash 1703437007, now seen corresponding path program 1 times [2018-06-22 11:23:43,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:43,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:43,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:43,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:43,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:43,717 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:43,784 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:23:43,784 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:43,784 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:43,784 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:43,784 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:43,784 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:43,785 INFO ]: Start difference. First operand 17 states and 30 transitions. Second operand 4 states. [2018-06-22 11:23:43,949 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:43,949 INFO ]: Finished difference Result 19 states and 30 transitions. [2018-06-22 11:23:43,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:23:43,950 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:23:43,951 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:43,951 INFO ]: With dead ends: 19 [2018-06-22 11:23:43,951 INFO ]: Without dead ends: 15 [2018-06-22 11:23:43,951 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:43,952 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:23:43,954 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:23:43,954 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:23:43,955 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:23:43,955 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 13 [2018-06-22 11:23:43,955 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:43,955 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:23:43,955 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:43,955 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:23:43,956 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:43,956 INFO ]: Found error trace [2018-06-22 11:23:43,956 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:43,956 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:43,956 INFO ]: Analyzing trace with hash 181630428, now seen corresponding path program 1 times [2018-06-22 11:23:43,956 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:43,956 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:43,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:43,957 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:43,957 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:43,976 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:44,090 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:23:44,091 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:44,091 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:23:44,091 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:23:44,091 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:23:44,091 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:44,091 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 5 states. [2018-06-22 11:23:44,225 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:44,225 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-22 11:23:44,225 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:23:44,225 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-22 11:23:44,225 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:44,226 INFO ]: With dead ends: 19 [2018-06-22 11:23:44,226 INFO ]: Without dead ends: 19 [2018-06-22 11:23:44,227 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:44,227 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:23:44,231 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-22 11:23:44,231 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:23:44,232 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:23:44,232 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 13 [2018-06-22 11:23:44,246 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:44,246 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:23:44,246 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:23:44,246 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:23:44,247 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:44,247 INFO ]: Found error trace [2018-06-22 11:23:44,247 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:44,247 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:44,247 INFO ]: Analyzing trace with hash 329406585, now seen corresponding path program 1 times [2018-06-22 11:23:44,247 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:44,247 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:44,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:44,248 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:44,248 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:44,271 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:44,334 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:23:44,334 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:44,334 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:44,334 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:44,334 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:44,334 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:44,334 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 4 states. [2018-06-22 11:23:44,609 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:44,609 INFO ]: Finished difference Result 26 states and 47 transitions. [2018-06-22 11:23:44,609 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:23:44,609 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:23:44,609 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:44,610 INFO ]: With dead ends: 26 [2018-06-22 11:23:44,610 INFO ]: Without dead ends: 26 [2018-06-22 11:23:44,611 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:44,611 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-22 11:23:44,617 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-06-22 11:23:44,617 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-22 11:23:44,618 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 41 transitions. [2018-06-22 11:23:44,618 INFO ]: Start accepts. Automaton has 24 states and 41 transitions. Word has length 13 [2018-06-22 11:23:44,619 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:44,619 INFO ]: Abstraction has 24 states and 41 transitions. [2018-06-22 11:23:44,619 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:44,619 INFO ]: Start isEmpty. Operand 24 states and 41 transitions. [2018-06-22 11:23:44,620 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:23:44,620 INFO ]: Found error trace [2018-06-22 11:23:44,620 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:44,620 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:44,620 INFO ]: Analyzing trace with hash 1212935301, now seen corresponding path program 1 times [2018-06-22 11:23:44,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:44,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:44,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:44,621 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:44,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:44,629 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:44,760 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:23:44,760 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:44,760 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:23:44,760 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:23:44,760 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:23:44,761 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:23:44,761 INFO ]: Start difference. First operand 24 states and 41 transitions. Second operand 4 states. [2018-06-22 11:23:44,950 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:44,950 INFO ]: Finished difference Result 37 states and 65 transitions. [2018-06-22 11:23:44,950 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 11:23:44,950 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:23:44,950 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:44,951 INFO ]: With dead ends: 37 [2018-06-22 11:23:44,951 INFO ]: Without dead ends: 33 [2018-06-22 11:23:44,952 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:44,952 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:23:44,958 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-06-22 11:23:44,958 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:23:44,959 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 46 transitions. [2018-06-22 11:23:44,959 INFO ]: Start accepts. Automaton has 27 states and 46 transitions. Word has length 13 [2018-06-22 11:23:44,959 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:44,959 INFO ]: Abstraction has 27 states and 46 transitions. [2018-06-22 11:23:44,959 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:23:44,959 INFO ]: Start isEmpty. Operand 27 states and 46 transitions. [2018-06-22 11:23:44,961 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:23:44,961 INFO ]: Found error trace [2018-06-22 11:23:44,961 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:44,961 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:44,961 INFO ]: Analyzing trace with hash 1129422078, now seen corresponding path program 1 times [2018-06-22 11:23:44,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:44,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:44,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:44,962 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:44,962 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:44,980 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:45,027 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:23:45,027 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:45,027 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:23:45,027 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:23:45,027 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:23:45,027 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:45,028 INFO ]: Start difference. First operand 27 states and 46 transitions. Second operand 5 states. [2018-06-22 11:23:45,194 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:45,194 INFO ]: Finished difference Result 27 states and 43 transitions. [2018-06-22 11:23:45,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:23:45,194 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:23:45,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:45,195 INFO ]: With dead ends: 27 [2018-06-22 11:23:45,195 INFO ]: Without dead ends: 22 [2018-06-22 11:23:45,195 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-22 11:23:45,195 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-22 11:23:45,199 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-22 11:23:45,199 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-22 11:23:45,200 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-06-22 11:23:45,200 INFO ]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 17 [2018-06-22 11:23:45,200 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:45,200 INFO ]: Abstraction has 20 states and 29 transitions. [2018-06-22 11:23:45,200 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:23:45,200 INFO ]: Start isEmpty. Operand 20 states and 29 transitions. [2018-06-22 11:23:45,201 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:23:45,201 INFO ]: Found error trace [2018-06-22 11:23:45,201 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:23:45,201 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:23:45,201 INFO ]: Analyzing trace with hash -334713590, now seen corresponding path program 1 times [2018-06-22 11:23:45,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:23:45,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:23:45,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:23:45,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:23:45,215 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:23:45,281 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:23:45,281 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:23:45,281 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:23:45,281 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:23:45,281 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:23:45,281 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:23:45,281 INFO ]: Start difference. First operand 20 states and 29 transitions. Second operand 5 states. [2018-06-22 11:23:45,305 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:23:45,305 INFO ]: Finished difference Result 14 states and 19 transitions. [2018-06-22 11:23:45,305 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:23:45,305 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:23:45,305 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:23:45,305 INFO ]: With dead ends: 14 [2018-06-22 11:23:45,305 INFO ]: Without dead ends: 0 [2018-06-22 11:23:45,305 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:23:45,305 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 11:23:45,306 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 11:23:45,306 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 11:23:45,306 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 11:23:45,306 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-06-22 11:23:45,306 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:23:45,306 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 11:23:45,306 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:23:45,306 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 11:23:45,306 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 11:23:45,310 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:23:45 BoogieIcfgContainer [2018-06-22 11:23:45,310 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:23:45,310 INFO ]: Toolchain (without parser) took 3038.24 ms. Allocated memory was 309.3 MB in the beginning and 326.6 MB in the end (delta: 17.3 MB). Free memory was 263.7 MB in the beginning and 242.5 MB in the end (delta: 21.3 MB). Peak memory consumption was 38.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:45,312 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:23:45,312 INFO ]: ChcToBoogie took 44.49 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:45,313 INFO ]: Boogie Preprocessor took 35.19 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:45,313 INFO ]: RCFGBuilder took 339.09 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 248.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:45,314 INFO ]: TraceAbstraction took 2610.52 ms. Allocated memory was 309.3 MB in the beginning and 326.6 MB in the end (delta: 17.3 MB). Free memory was 248.8 MB in the beginning and 242.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 3.6 GB. [2018-06-22 11:23:45,317 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 44.49 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 35.19 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 339.09 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 248.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 2610.52 ms. Allocated memory was 309.3 MB in the beginning and 326.6 MB in the end (delta: 17.3 MB). Free memory was 248.8 MB in the beginning and 242.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : 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 4 procedures, 23 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 197 SDtfs, 18 SDslu, 245 SDs, 0 SdLazy, 251 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=7, 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, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 2992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 33/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/027b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-23-45-328.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/027b-horn.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-23-45-328.csv Received shutdown request...