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/llreve-bench/smt2/loop__digits10_inl.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 02:12:11,632 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 02:12:11,634 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 02:12:11,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 02:12:11,646 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 02:12:11,648 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 02:12:11,649 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 02:12:11,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 02:12:11,655 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 02:12:11,656 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 02:12:11,657 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 02:12:11,657 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 02:12:11,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 02:12:11,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 02:12:11,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 02:12:11,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 02:12:11,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 02:12:11,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 02:12:11,666 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 02:12:11,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 02:12:11,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 02:12:11,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 02:12:11,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 02:12:11,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 02:12:11,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 02:12:11,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 02:12:11,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 02:12:11,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 02:12:11,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 02:12:11,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 02:12:11,679 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 02:12:11,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 02:12:11,680 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 02:12:11,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 02:12:11,681 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 02:12:11,682 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 02:12:11,699 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 02:12:11,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 02:12:11,700 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 02:12:11,701 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 02:12:11,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 02:12:11,703 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 02:12:11,703 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 02:12:11,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 02:12:11,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 02:12:11,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 02:12:11,704 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 02:12:11,704 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 02:12:11,704 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 02:12:11,704 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 02:12:11,704 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 02:12:11,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 02:12:11,705 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 02:12:11,706 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 02:12:11,707 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 02:12:11,756 INFO ]: Repository-Root is: /tmp [2018-06-22 02:12:11,774 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 02:12:11,782 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 02:12:11,784 INFO ]: Initializing SmtParser... [2018-06-22 02:12:11,784 INFO ]: SmtParser initialized [2018-06-22 02:12:11,784 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 [2018-06-22 02:12:11,786 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 02:12:11,882 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@41cf1731 [2018-06-22 02:12:12,345 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/loop__digits10_inl.smt2 [2018-06-22 02:12:12,351 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 02:12:12,357 INFO ]: Walking toolchain with 4 elements. [2018-06-22 02:12:12,358 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 02:12:12,358 INFO ]: Initializing ChcToBoogie... [2018-06-22 02:12:12,358 INFO ]: ChcToBoogie initialized [2018-06-22 02:12:12,362 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:12:12" (1/1) ... [2018-06-22 02:12:12,443 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12 Unit [2018-06-22 02:12:12,443 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 02:12:12,444 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 02:12:12,444 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 02:12:12,444 INFO ]: Boogie Preprocessor initialized [2018-06-22 02:12:12,466 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12" (1/1) ... [2018-06-22 02:12:12,466 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12" (1/1) ... [2018-06-22 02:12:12,478 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12" (1/1) ... [2018-06-22 02:12:12,478 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12" (1/1) ... [2018-06-22 02:12:12,504 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12" (1/1) ... [2018-06-22 02:12:12,507 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12" (1/1) ... [2018-06-22 02:12:12,509 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12" (1/1) ... [2018-06-22 02:12:12,520 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 02:12:12,520 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 02:12:12,520 INFO ]: Initializing RCFGBuilder... [2018-06-22 02:12:12,520 INFO ]: RCFGBuilder initialized [2018-06-22 02:12:12,521 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12" (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 02:12:12,544 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 02:12:12,544 INFO ]: Found specification of procedure gotoProc [2018-06-22 02:12:12,544 INFO ]: Found implementation of procedure gotoProc [2018-06-22 02:12:12,544 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 02:12:12,544 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 02:12:12,544 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 02:12:13,242 INFO ]: Using library mode [2018-06-22 02:12:13,243 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:12:13 BoogieIcfgContainer [2018-06-22 02:12:13,243 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 02:12:13,244 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 02:12:13,244 INFO ]: Initializing TraceAbstraction... [2018-06-22 02:12:13,250 INFO ]: TraceAbstraction initialized [2018-06-22 02:12:13,251 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 02:12:12" (1/3) ... [2018-06-22 02:12:13,252 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1bb249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 02:12:13, skipping insertion in model container [2018-06-22 02:12:13,252 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 02:12:12" (2/3) ... [2018-06-22 02:12:13,252 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1bb249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:12:13, skipping insertion in model container [2018-06-22 02:12:13,252 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:12:13" (3/3) ... [2018-06-22 02:12:13,256 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 02:12:13,265 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 02:12:13,279 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 02:12:13,348 INFO ]: Using default assertion order modulation [2018-06-22 02:12:13,348 INFO ]: Interprodecural is true [2018-06-22 02:12:13,348 INFO ]: Hoare is false [2018-06-22 02:12:13,348 INFO ]: Compute interpolants for FPandBP [2018-06-22 02:12:13,348 INFO ]: Backedges is TWOTRACK [2018-06-22 02:12:13,348 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 02:12:13,348 INFO ]: Difference is false [2018-06-22 02:12:13,348 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 02:12:13,349 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 02:12:13,375 INFO ]: Start isEmpty. Operand 10 states. [2018-06-22 02:12:13,389 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-22 02:12:13,389 INFO ]: Found error trace [2018-06-22 02:12:13,390 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:13,390 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:13,394 INFO ]: Analyzing trace with hash 1901270574, now seen corresponding path program 1 times [2018-06-22 02:12:13,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:13,397 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:13,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:13,441 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:13,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:13,508 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:13,579 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:13,581 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:12:13,581 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:12:13,582 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:12:13,594 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:12:13,594 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:12:13,596 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-22 02:12:14,082 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:14,082 INFO ]: Finished difference Result 9 states and 60 transitions. [2018-06-22 02:12:14,082 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:12:14,084 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-22 02:12:14,084 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:14,092 INFO ]: With dead ends: 9 [2018-06-22 02:12:14,092 INFO ]: Without dead ends: 9 [2018-06-22 02:12:14,094 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 02:12:14,110 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 02:12:14,129 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 02:12:14,130 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 02:12:14,133 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2018-06-22 02:12:14,134 INFO ]: Start accepts. Automaton has 9 states and 60 transitions. Word has length 7 [2018-06-22 02:12:14,135 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:14,135 INFO ]: Abstraction has 9 states and 60 transitions. [2018-06-22 02:12:14,135 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:12:14,135 INFO ]: Start isEmpty. Operand 9 states and 60 transitions. [2018-06-22 02:12:14,135 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:12:14,135 INFO ]: Found error trace [2018-06-22 02:12:14,135 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:14,135 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:14,136 INFO ]: Analyzing trace with hash -1139098095, now seen corresponding path program 1 times [2018-06-22 02:12:14,136 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:14,136 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:14,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:14,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:14,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:14,154 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:14,233 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:14,233 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:12:14,233 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:12:14,235 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:12:14,235 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:12:14,235 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:12:14,235 INFO ]: Start difference. First operand 9 states and 60 transitions. Second operand 3 states. [2018-06-22 02:12:15,113 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:15,113 INFO ]: Finished difference Result 11 states and 85 transitions. [2018-06-22 02:12:15,113 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:12:15,114 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 02:12:15,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:15,114 INFO ]: With dead ends: 11 [2018-06-22 02:12:15,114 INFO ]: Without dead ends: 9 [2018-06-22 02:12:15,115 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 02:12:15,115 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-22 02:12:15,118 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-22 02:12:15,119 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-22 02:12:15,119 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2018-06-22 02:12:15,119 INFO ]: Start accepts. Automaton has 9 states and 56 transitions. Word has length 8 [2018-06-22 02:12:15,119 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:15,119 INFO ]: Abstraction has 9 states and 56 transitions. [2018-06-22 02:12:15,119 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:12:15,119 INFO ]: Start isEmpty. Operand 9 states and 56 transitions. [2018-06-22 02:12:15,120 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:12:15,120 INFO ]: Found error trace [2018-06-22 02:12:15,120 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:15,120 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:15,120 INFO ]: Analyzing trace with hash -1168650767, now seen corresponding path program 1 times [2018-06-22 02:12:15,120 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:15,120 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:15,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:15,121 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:15,121 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:15,146 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:15,202 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:15,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:15,203 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:15,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:15,246 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:15,257 INFO ]: Computing forward predicates... [2018-06-22 02:12:15,316 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:15,349 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 02:12:15,349 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-22 02:12:15,349 INFO ]: Interpolant automaton has 5 states [2018-06-22 02:12:15,349 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 02:12:15,349 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-22 02:12:15,349 INFO ]: Start difference. First operand 9 states and 56 transitions. Second operand 5 states. [2018-06-22 02:12:16,684 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:16,684 INFO ]: Finished difference Result 17 states and 176 transitions. [2018-06-22 02:12:16,684 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 02:12:16,685 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-22 02:12:16,685 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:16,687 INFO ]: With dead ends: 17 [2018-06-22 02:12:16,687 INFO ]: Without dead ends: 17 [2018-06-22 02:12:16,687 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-06-22 02:12:16,687 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 02:12:16,691 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-06-22 02:12:16,692 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-22 02:12:16,692 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2018-06-22 02:12:16,692 INFO ]: Start accepts. Automaton has 12 states and 107 transitions. Word has length 8 [2018-06-22 02:12:16,692 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:16,692 INFO ]: Abstraction has 12 states and 107 transitions. [2018-06-22 02:12:16,692 INFO ]: Interpolant automaton has 5 states. [2018-06-22 02:12:16,692 INFO ]: Start isEmpty. Operand 12 states and 107 transitions. [2018-06-22 02:12:16,693 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:12:16,693 INFO ]: Found error trace [2018-06-22 02:12:16,693 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:16,693 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:16,693 INFO ]: Analyzing trace with hash -1135404011, now seen corresponding path program 1 times [2018-06-22 02:12:16,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:16,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:16,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:16,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:16,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:16,703 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:16,740 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:16,740 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:12:16,740 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:12:16,740 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:12:16,740 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:12:16,740 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:12:16,740 INFO ]: Start difference. First operand 12 states and 107 transitions. Second operand 3 states. [2018-06-22 02:12:16,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:16,855 INFO ]: Finished difference Result 13 states and 131 transitions. [2018-06-22 02:12:16,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:12:16,857 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 02:12:16,857 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:16,858 INFO ]: With dead ends: 13 [2018-06-22 02:12:16,858 INFO ]: Without dead ends: 13 [2018-06-22 02:12:16,858 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 02:12:16,858 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-22 02:12:16,862 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-22 02:12:16,862 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-22 02:12:16,863 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 131 transitions. [2018-06-22 02:12:16,863 INFO ]: Start accepts. Automaton has 13 states and 131 transitions. Word has length 8 [2018-06-22 02:12:16,863 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:16,863 INFO ]: Abstraction has 13 states and 131 transitions. [2018-06-22 02:12:16,863 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:12:16,863 INFO ]: Start isEmpty. Operand 13 states and 131 transitions. [2018-06-22 02:12:16,864 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:12:16,864 INFO ]: Found error trace [2018-06-22 02:12:16,864 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:16,864 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:16,864 INFO ]: Analyzing trace with hash -1105851339, now seen corresponding path program 1 times [2018-06-22 02:12:16,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:16,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:16,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:16,865 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:16,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:16,878 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:16,906 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:16,906 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 02:12:16,906 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 02:12:16,916 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:16,930 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:16,932 INFO ]: Computing forward predicates... [2018-06-22 02:12:16,935 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:16,956 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 02:12:16,956 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 02:12:16,956 INFO ]: Interpolant automaton has 4 states [2018-06-22 02:12:16,956 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 02:12:16,956 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 02:12:16,956 INFO ]: Start difference. First operand 13 states and 131 transitions. Second operand 4 states. [2018-06-22 02:12:17,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:17,177 INFO ]: Finished difference Result 19 states and 255 transitions. [2018-06-22 02:12:17,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 02:12:17,177 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 02:12:17,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:17,178 INFO ]: With dead ends: 19 [2018-06-22 02:12:17,178 INFO ]: Without dead ends: 19 [2018-06-22 02:12:17,179 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 9 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 02:12:17,179 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 02:12:17,182 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-06-22 02:12:17,182 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 02:12:17,183 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 180 transitions. [2018-06-22 02:12:17,183 INFO ]: Start accepts. Automaton has 15 states and 180 transitions. Word has length 8 [2018-06-22 02:12:17,183 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:17,183 INFO ]: Abstraction has 15 states and 180 transitions. [2018-06-22 02:12:17,183 INFO ]: Interpolant automaton has 4 states. [2018-06-22 02:12:17,183 INFO ]: Start isEmpty. Operand 15 states and 180 transitions. [2018-06-22 02:12:17,184 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 02:12:17,184 INFO ]: Found error trace [2018-06-22 02:12:17,184 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:17,184 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:17,184 INFO ]: Analyzing trace with hash -1161262599, now seen corresponding path program 1 times [2018-06-22 02:12:17,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:17,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:17,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:17,185 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:17,185 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:17,193 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:17,218 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:17,218 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:12:17,218 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:12:17,218 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:12:17,218 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:12:17,218 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:12:17,218 INFO ]: Start difference. First operand 15 states and 180 transitions. Second operand 3 states. [2018-06-22 02:12:17,616 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:17,616 INFO ]: Finished difference Result 17 states and 201 transitions. [2018-06-22 02:12:17,617 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:12:17,617 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-22 02:12:17,617 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:17,618 INFO ]: With dead ends: 17 [2018-06-22 02:12:17,618 INFO ]: Without dead ends: 15 [2018-06-22 02:12:17,618 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 02:12:17,618 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 02:12:17,620 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-06-22 02:12:17,620 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-22 02:12:17,624 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 119 transitions. [2018-06-22 02:12:17,624 INFO ]: Start accepts. Automaton has 14 states and 119 transitions. Word has length 8 [2018-06-22 02:12:17,624 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:17,624 INFO ]: Abstraction has 14 states and 119 transitions. [2018-06-22 02:12:17,624 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:12:17,624 INFO ]: Start isEmpty. Operand 14 states and 119 transitions. [2018-06-22 02:12:17,625 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:12:17,625 INFO ]: Found error trace [2018-06-22 02:12:17,625 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:17,625 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:17,625 INFO ]: Analyzing trace with hash -1802602818, now seen corresponding path program 1 times [2018-06-22 02:12:17,625 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:17,625 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:17,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:17,626 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:17,626 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:17,639 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:17,719 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:17,720 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:12:17,720 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:12:17,720 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:12:17,720 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:12:17,720 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:12:17,720 INFO ]: Start difference. First operand 14 states and 119 transitions. Second operand 3 states. [2018-06-22 02:12:17,767 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:17,768 INFO ]: Finished difference Result 14 states and 60 transitions. [2018-06-22 02:12:17,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:12:17,768 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 02:12:17,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:17,768 INFO ]: With dead ends: 14 [2018-06-22 02:12:17,768 INFO ]: Without dead ends: 10 [2018-06-22 02:12:17,769 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 02:12:17,769 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-22 02:12:17,769 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-22 02:12:17,769 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-22 02:12:17,770 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2018-06-22 02:12:17,770 INFO ]: Start accepts. Automaton has 10 states and 20 transitions. Word has length 9 [2018-06-22 02:12:17,770 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:17,770 INFO ]: Abstraction has 10 states and 20 transitions. [2018-06-22 02:12:17,770 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:12:17,770 INFO ]: Start isEmpty. Operand 10 states and 20 transitions. [2018-06-22 02:12:17,770 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 02:12:17,770 INFO ]: Found error trace [2018-06-22 02:12:17,770 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 02:12:17,770 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 02:12:17,770 INFO ]: Analyzing trace with hash 29662846, now seen corresponding path program 1 times [2018-06-22 02:12:17,770 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 02:12:17,770 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 02:12:17,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:17,771 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 02:12:17,771 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 02:12:17,782 INFO ]: Conjunction of SSA is unsat [2018-06-22 02:12:17,810 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 02:12:17,810 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 02:12:17,810 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-22 02:12:17,810 INFO ]: Interpolant automaton has 3 states [2018-06-22 02:12:17,810 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-22 02:12:17,810 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-22 02:12:17,811 INFO ]: Start difference. First operand 10 states and 20 transitions. Second operand 3 states. [2018-06-22 02:12:17,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 02:12:17,833 INFO ]: Finished difference Result 5 states and 8 transitions. [2018-06-22 02:12:17,833 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-22 02:12:17,833 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-22 02:12:17,833 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 02:12:17,833 INFO ]: With dead ends: 5 [2018-06-22 02:12:17,833 INFO ]: Without dead ends: 0 [2018-06-22 02:12:17,833 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 02:12:17,833 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-22 02:12:17,833 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-22 02:12:17,833 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-22 02:12:17,833 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-22 02:12:17,833 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2018-06-22 02:12:17,833 INFO ]: Finished accepts. word is rejected. [2018-06-22 02:12:17,833 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-22 02:12:17,834 INFO ]: Interpolant automaton has 3 states. [2018-06-22 02:12:17,834 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-22 02:12:17,834 INFO ]: Finished isEmpty. No accepting run. [2018-06-22 02:12:17,838 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:12:17 BoogieIcfgContainer [2018-06-22 02:12:17,838 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 02:12:17,838 INFO ]: Toolchain (without parser) took 5487.29 ms. Allocated memory was 309.3 MB in the beginning and 338.2 MB in the end (delta: 28.8 MB). Free memory was 255.7 MB in the beginning and 296.9 MB in the end (delta: -41.1 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:12:17,840 INFO ]: SmtParser took 0.09 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 02:12:17,840 INFO ]: ChcToBoogie took 85.77 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 253.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 02:12:17,841 INFO ]: Boogie Preprocessor took 76.23 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 251.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 02:12:17,841 INFO ]: RCFGBuilder took 722.30 ms. Allocated memory is still 309.3 MB. Free memory was 251.7 MB in the beginning and 227.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. [2018-06-22 02:12:17,842 INFO ]: TraceAbstraction took 4593.53 ms. Allocated memory was 309.3 MB in the beginning and 338.2 MB in the end (delta: 28.8 MB). Free memory was 227.7 MB in the beginning and 296.9 MB in the end (delta: -69.2 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 02:12:17,845 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 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 85.77 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 253.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 76.23 ms. Allocated memory is still 309.3 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 722.30 ms. Allocated memory is still 309.3 MB. Free memory was 251.7 MB in the beginning and 227.7 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 4593.53 ms. Allocated memory was 309.3 MB in the beginning and 338.2 MB in the end (delta: 28.8 MB). Free memory was 227.7 MB in the beginning and 296.9 MB in the end (delta: -69.2 MB). There was no memory consumed. 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, 10 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 158 SDtfs, 5 SDslu, 55 SDs, 0 SdLazy, 511 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 881 SizeOfPredicates, 5 NumberOfNonLiveVariables, 154 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10/13 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/loop__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_02-12-17-856.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop__digits10_inl.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_02-12-17-856.csv Received shutdown request...