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_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/002b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:19:20,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:19:20,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:19:20,808 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:19:20,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:19:20,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:19:20,813 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:19:20,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:19:20,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:19:20,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:19:20,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:19:20,819 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:19:20,820 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:19:20,821 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:19:20,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:19:20,822 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:19:20,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:19:20,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:19:20,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:19:20,841 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:19:20,842 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:19:20,844 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:19:20,845 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:19:20,845 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:19:20,845 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:19:20,846 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:19:20,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:19:20,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:19:20,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:19:20,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:19:20,849 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:19:20,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:19:20,850 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:19:20,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:19:20,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:19:20,852 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:19:20,872 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:19:20,872 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:19:20,872 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:19:20,872 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:19:20,873 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:19:20,874 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:19:20,874 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:19:20,874 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:19:20,874 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:19:20,874 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:19:20,875 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:19:20,875 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:19:20,875 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:19:20,875 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:19:20,875 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:19:20,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:19:20,876 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:19:20,881 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:19:20,882 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:19:20,931 INFO ]: Repository-Root is: /tmp [2018-06-22 01:19:20,949 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:19:20,955 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:19:20,957 INFO ]: Initializing SmtParser... [2018-06-22 01:19:20,957 INFO ]: SmtParser initialized [2018-06-22 01:19:20,957 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/002b-horn.smt2 [2018-06-22 01:19:20,959 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 01:19:21,055 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002b-horn.smt2 unknown [2018-06-22 01:19:21,288 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/002b-horn.smt2 [2018-06-22 01:19:21,296 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:19:21,301 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:19:21,302 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:19:21,302 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:19:21,302 INFO ]: ChcToBoogie initialized [2018-06-22 01:19:21,305 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:19:21" (1/1) ... [2018-06-22 01:19:21,369 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21 Unit [2018-06-22 01:19:21,369 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:19:21,369 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:19:21,369 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:19:21,369 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:19:21,390 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21" (1/1) ... [2018-06-22 01:19:21,390 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21" (1/1) ... [2018-06-22 01:19:21,397 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21" (1/1) ... [2018-06-22 01:19:21,397 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21" (1/1) ... [2018-06-22 01:19:21,409 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21" (1/1) ... [2018-06-22 01:19:21,411 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21" (1/1) ... [2018-06-22 01:19:21,412 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21" (1/1) ... [2018-06-22 01:19:21,423 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:19:21,424 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:19:21,424 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:19:21,424 INFO ]: RCFGBuilder initialized [2018-06-22 01:19:21,424 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:19:21,436 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:19:21,436 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:19:21,436 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:19:21,436 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:19:21,436 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:19:21,436 INFO ]: Found implementation of procedure Ultimate.START [2018-06-22 01:19:21,765 INFO ]: Using library mode [2018-06-22 01:19:21,766 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:19:21 BoogieIcfgContainer [2018-06-22 01:19:21,766 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:19:21,767 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:19:21,767 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:19:21,771 INFO ]: TraceAbstraction initialized [2018-06-22 01:19:21,771 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:19:21" (1/3) ... [2018-06-22 01:19:21,772 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a772d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:19:21, skipping insertion in model container [2018-06-22 01:19:21,772 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:19:21" (2/3) ... [2018-06-22 01:19:21,772 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a772d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:19:21, skipping insertion in model container [2018-06-22 01:19:21,772 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:19:21" (3/3) ... [2018-06-22 01:19:21,774 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:19:21,781 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:19:21,789 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:19:21,826 INFO ]: Using default assertion order modulation [2018-06-22 01:19:21,827 INFO ]: Interprodecural is true [2018-06-22 01:19:21,827 INFO ]: Hoare is false [2018-06-22 01:19:21,827 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:19:21,827 INFO ]: Backedges is TWOTRACK [2018-06-22 01:19:21,827 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:19:21,827 INFO ]: Difference is false [2018-06-22 01:19:21,827 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:19:21,827 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:19:21,839 INFO ]: Start isEmpty. Operand 12 states. [2018-06-22 01:19:21,849 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-22 01:19:21,849 INFO ]: Found error trace [2018-06-22 01:19:21,850 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-22 01:19:21,850 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:21,854 INFO ]: Analyzing trace with hash -1689421424, now seen corresponding path program 1 times [2018-06-22 01:19:21,856 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:21,856 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:21,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:21,895 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:21,895 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:21,921 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:21,947 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:21,948 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:21,948 INFO ]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-06-22 01:19:21,950 INFO ]: Interpolant automaton has 2 states [2018-06-22 01:19:21,964 INFO ]: Constructing interpolant automaton starting with 2 interpolants. [2018-06-22 01:19:21,965 INFO ]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:19:21,969 INFO ]: Start difference. First operand 12 states. Second operand 2 states. [2018-06-22 01:19:21,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:21,993 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-22 01:19:21,993 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-06-22 01:19:21,994 INFO ]: Start accepts. Automaton has 2 states. Word has length 6 [2018-06-22 01:19:21,994 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:22,007 INFO ]: With dead ends: 10 [2018-06-22 01:19:22,008 INFO ]: Without dead ends: 10 [2018-06-22 01:19:22,010 INFO ]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-06-22 01:19:22,025 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 01:19:22,042 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 01:19:22,043 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:19:22,044 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2018-06-22 01:19:22,046 INFO ]: Start accepts. Automaton has 10 states and 18 transitions. Word has length 6 [2018-06-22 01:19:22,046 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:22,046 INFO ]: Abstraction has 10 states and 18 transitions. [2018-06-22 01:19:22,046 INFO ]: Interpolant automaton has 2 states. [2018-06-22 01:19:22,046 INFO ]: Start isEmpty. Operand 10 states and 18 transitions. [2018-06-22 01:19:22,046 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:22,046 INFO ]: Found error trace [2018-06-22 01:19:22,046 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:22,047 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:22,047 INFO ]: Analyzing trace with hash -823495086, now seen corresponding path program 1 times [2018-06-22 01:19:22,047 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:22,047 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:22,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,048 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:22,048 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,070 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:22,176 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:22,176 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:22,176 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:22,178 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:22,178 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:22,178 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,178 INFO ]: Start difference. First operand 10 states and 18 transitions. Second operand 3 states. [2018-06-22 01:19:22,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:22,214 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-22 01:19:22,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:22,215 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:22,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:22,215 INFO ]: With dead ends: 11 [2018-06-22 01:19:22,215 INFO ]: Without dead ends: 11 [2018-06-22 01:19:22,216 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,216 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:19:22,218 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:19:22,218 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:22,220 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-22 01:19:22,220 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-06-22 01:19:22,220 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:22,220 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-22 01:19:22,220 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:22,220 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-22 01:19:22,220 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:22,220 INFO ]: Found error trace [2018-06-22 01:19:22,220 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:22,220 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:22,221 INFO ]: Analyzing trace with hash -836841454, now seen corresponding path program 1 times [2018-06-22 01:19:22,221 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:22,221 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:22,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,221 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:22,221 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,229 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:22,269 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:22,269 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:22,269 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:22,270 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:22,270 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:22,270 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,270 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 3 states. [2018-06-22 01:19:22,289 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:22,289 INFO ]: Finished difference Result 14 states and 21 transitions. [2018-06-22 01:19:22,289 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:22,289 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:22,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:22,291 INFO ]: With dead ends: 14 [2018-06-22 01:19:22,291 INFO ]: Without dead ends: 14 [2018-06-22 01:19:22,292 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,292 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-22 01:19:22,294 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-22 01:19:22,294 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:22,295 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-22 01:19:22,295 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2018-06-22 01:19:22,295 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:22,295 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-22 01:19:22,295 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:22,295 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-22 01:19:22,296 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 01:19:22,296 INFO ]: Found error trace [2018-06-22 01:19:22,296 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:22,296 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:22,296 INFO ]: Analyzing trace with hash -836573335, now seen corresponding path program 1 times [2018-06-22 01:19:22,296 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:22,296 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:22,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:22,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,307 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:22,347 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:22,347 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:22,347 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:22,348 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:22,348 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:22,348 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,348 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2018-06-22 01:19:22,383 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:22,383 INFO ]: Finished difference Result 16 states and 27 transitions. [2018-06-22 01:19:22,384 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:22,384 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 01:19:22,385 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:22,385 INFO ]: With dead ends: 16 [2018-06-22 01:19:22,385 INFO ]: Without dead ends: 16 [2018-06-22 01:19:22,386 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,386 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-22 01:19:22,387 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-22 01:19:22,388 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:22,388 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 20 transitions. [2018-06-22 01:19:22,388 INFO ]: Start accepts. Automaton has 12 states and 20 transitions. Word has length 7 [2018-06-22 01:19:22,388 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:22,388 INFO ]: Abstraction has 12 states and 20 transitions. [2018-06-22 01:19:22,388 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:22,388 INFO ]: Start isEmpty. Operand 12 states and 20 transitions. [2018-06-22 01:19:22,389 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:22,389 INFO ]: Found error trace [2018-06-22 01:19:22,389 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:22,390 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:22,390 INFO ]: Analyzing trace with hash 239335364, now seen corresponding path program 1 times [2018-06-22 01:19:22,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:22,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:22,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,391 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:22,391 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,409 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:22,443 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:22,443 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:22,443 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:19:22,443 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:19:22,443 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:19:22,444 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:19:22,444 INFO ]: Start difference. First operand 12 states and 20 transitions. Second operand 4 states. [2018-06-22 01:19:22,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:22,485 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-22 01:19:22,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:19:22,486 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:19:22,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:22,486 INFO ]: With dead ends: 15 [2018-06-22 01:19:22,486 INFO ]: Without dead ends: 13 [2018-06-22 01:19:22,487 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:19:22,487 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:19:22,488 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-22 01:19:22,488 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:22,489 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2018-06-22 01:19:22,489 INFO ]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 8 [2018-06-22 01:19:22,489 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:22,489 INFO ]: Abstraction has 11 states and 18 transitions. [2018-06-22 01:19:22,489 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:19:22,489 INFO ]: Start isEmpty. Operand 11 states and 18 transitions. [2018-06-22 01:19:22,489 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:22,489 INFO ]: Found error trace [2018-06-22 01:19:22,489 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:22,489 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:22,489 INFO ]: Analyzing trace with hash -166000982, now seen corresponding path program 1 times [2018-06-22 01:19:22,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:22,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:22,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,492 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:22,492 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,513 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:22,533 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:22,533 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:22,533 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:22,534 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:22,534 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:22,534 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,534 INFO ]: Start difference. First operand 11 states and 18 transitions. Second operand 3 states. [2018-06-22 01:19:22,557 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:22,557 INFO ]: Finished difference Result 13 states and 19 transitions. [2018-06-22 01:19:22,557 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:22,557 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:19:22,557 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:22,558 INFO ]: With dead ends: 13 [2018-06-22 01:19:22,558 INFO ]: Without dead ends: 13 [2018-06-22 01:19:22,558 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,558 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 01:19:22,560 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-06-22 01:19:22,560 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:22,560 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-06-22 01:19:22,560 INFO ]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 8 [2018-06-22 01:19:22,560 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:22,560 INFO ]: Abstraction has 11 states and 17 transitions. [2018-06-22 01:19:22,560 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:22,560 INFO ]: Start isEmpty. Operand 11 states and 17 transitions. [2018-06-22 01:19:22,561 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:22,561 INFO ]: Found error trace [2018-06-22 01:19:22,561 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:22,561 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:22,561 INFO ]: Analyzing trace with hash -180092125, now seen corresponding path program 1 times [2018-06-22 01:19:22,561 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:22,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:22,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,562 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:22,562 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,576 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:22,603 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:22,603 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:22,603 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 01:19:22,603 INFO ]: Interpolant automaton has 3 states [2018-06-22 01:19:22,603 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 01:19:22,604 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,604 INFO ]: Start difference. First operand 11 states and 17 transitions. Second operand 3 states. [2018-06-22 01:19:22,627 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:22,628 INFO ]: Finished difference Result 11 states and 16 transitions. [2018-06-22 01:19:22,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 01:19:22,628 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 01:19:22,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:22,628 INFO ]: With dead ends: 11 [2018-06-22 01:19:22,628 INFO ]: Without dead ends: 11 [2018-06-22 01:19:22,629 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 01:19:22,629 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:19:22,631 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-22 01:19:22,631 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-22 01:19:22,632 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-06-22 01:19:22,632 INFO ]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 8 [2018-06-22 01:19:22,632 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:22,632 INFO ]: Abstraction has 11 states and 16 transitions. [2018-06-22 01:19:22,632 INFO ]: Interpolant automaton has 3 states. [2018-06-22 01:19:22,632 INFO ]: Start isEmpty. Operand 11 states and 16 transitions. [2018-06-22 01:19:22,632 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:19:22,632 INFO ]: Found error trace [2018-06-22 01:19:22,632 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:22,632 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:22,633 INFO ]: Analyzing trace with hash -176249086, now seen corresponding path program 1 times [2018-06-22 01:19:22,633 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:22,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:22,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:22,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:22,650 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:22,968 WARN ]: Spent 282.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-06-22 01:19:22,974 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:22,974 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:22,974 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:19:22,974 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:19:22,975 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:19:22,975 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:19:22,975 INFO ]: Start difference. First operand 11 states and 16 transitions. Second operand 4 states. [2018-06-22 01:19:23,076 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:23,077 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-22 01:19:23,080 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:19:23,080 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:19:23,080 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:23,080 INFO ]: With dead ends: 12 [2018-06-22 01:19:23,080 INFO ]: Without dead ends: 12 [2018-06-22 01:19:23,081 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:19:23,081 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-22 01:19:23,082 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-22 01:19:23,082 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 01:19:23,082 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2018-06-22 01:19:23,082 INFO ]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 8 [2018-06-22 01:19:23,082 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:23,083 INFO ]: Abstraction has 12 states and 17 transitions. [2018-06-22 01:19:23,083 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:19:23,083 INFO ]: Start isEmpty. Operand 12 states and 17 transitions. [2018-06-22 01:19:23,083 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:19:23,083 INFO ]: Found error trace [2018-06-22 01:19:23,083 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:23,083 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:23,083 INFO ]: Analyzing trace with hash -1289919952, now seen corresponding path program 1 times [2018-06-22 01:19:23,083 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:23,083 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:23,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:23,084 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:23,084 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:23,103 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:23,149 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:19:23,149 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:23,149 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:19:23,149 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:19:23,149 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:19:23,150 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:19:23,150 INFO ]: Start difference. First operand 12 states and 17 transitions. Second operand 4 states. [2018-06-22 01:19:23,197 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:23,197 INFO ]: Finished difference Result 12 states and 15 transitions. [2018-06-22 01:19:23,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 01:19:23,198 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 01:19:23,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:23,198 INFO ]: With dead ends: 12 [2018-06-22 01:19:23,198 INFO ]: Without dead ends: 11 [2018-06-22 01:19:23,198 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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 01:19:23,199 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-22 01:19:23,199 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-22 01:19:23,200 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 01:19:23,200 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-22 01:19:23,200 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2018-06-22 01:19:23,200 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:23,200 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-22 01:19:23,200 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:19:23,200 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-22 01:19:23,200 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 01:19:23,200 INFO ]: Found error trace [2018-06-22 01:19:23,200 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:19:23,200 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:19:23,200 INFO ]: Analyzing trace with hash -1170875116, now seen corresponding path program 1 times [2018-06-22 01:19:23,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:19:23,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:19:23,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:23,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:19:23,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:19:23,220 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:19:23,360 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:19:23,360 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:19:23,360 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 01:19:23,360 INFO ]: Interpolant automaton has 5 states [2018-06-22 01:19:23,360 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 01:19:23,360 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:19:23,360 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2018-06-22 01:19:23,441 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:19:23,441 INFO ]: Finished difference Result 6 states and 7 transitions. [2018-06-22 01:19:23,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:19:23,441 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-22 01:19:23,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:19:23,441 INFO ]: With dead ends: 6 [2018-06-22 01:19:23,441 INFO ]: Without dead ends: 0 [2018-06-22 01:19:23,442 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 01:19:23,442 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 01:19:23,442 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 01:19:23,442 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 01:19:23,442 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 01:19:23,442 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-22 01:19:23,442 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:19:23,442 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 01:19:23,442 INFO ]: Interpolant automaton has 5 states. [2018-06-22 01:19:23,442 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 01:19:23,442 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 01:19:23,446 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:19:23 BoogieIcfgContainer [2018-06-22 01:19:23,446 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:19:23,447 INFO ]: Toolchain (without parser) took 2150.58 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 193.6 MB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:23,448 INFO ]: SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:19:23,451 INFO ]: ChcToBoogie took 67.35 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 01:19:23,452 INFO ]: Boogie Preprocessor took 53.68 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.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 01:19:23,452 INFO ]: RCFGBuilder took 342.36 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 246.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:23,453 INFO ]: TraceAbstraction took 1679.14 ms. Allocated memory is still 309.3 MB. Free memory was 246.7 MB in the beginning and 193.6 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:19:23,462 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.09 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 67.35 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. * Boogie Preprocessor took 53.68 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 342.36 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 246.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 1679.14 ms. Allocated memory is still 309.3 MB. Free memory was 246.7 MB in the beginning and 193.6 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 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 2 procedures, 12 locations, 1 error locations. SAFE Result, 1.6s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 44 SDslu, 90 SDs, 0 SdLazy, 49 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred 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, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 67 ConstructedInterpolants, 0 QuantifiedInterpolants, 901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 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/002b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-19-23-476.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/002b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-19-23-476.csv Received shutdown request...