java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:44:41,255 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:44:41,257 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:44:41,267 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:44:41,267 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:44:41,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:44:41,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:44:41,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:44:41,273 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:44:41,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:44:41,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:44:41,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:44:41,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:44:41,276 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:44:41,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:44:41,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:44:41,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:44:41,293 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:44:41,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:44:41,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:44:41,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:44:41,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:44:41,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:44:41,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:44:41,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:44:41,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:44:41,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:44:41,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:44:41,309 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:44:41,309 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:44:41,310 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:44:41,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:44:41,311 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:44:41,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:44:41,312 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:44:41,313 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 03:44:41,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:44:41,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:44:41,334 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:44:41,334 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:44:41,335 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:44:41,336 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:44:41,337 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:44:41,338 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:44:41,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:44:41,338 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:44:41,338 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:44:41,338 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:44:41,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:44:41,339 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:44:41,339 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:44:41,339 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:44:41,339 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:44:41,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:44:41,340 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:44:41,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:44:41,340 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:44:41,342 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:44:41,342 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:44:41,400 INFO ]: Repository-Root is: /tmp [2018-06-25 03:44:41,418 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:44:41,425 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:44:41,428 INFO ]: Initializing SmtParser... [2018-06-25 03:44:41,428 INFO ]: SmtParser initialized [2018-06-25 03:44:41,429 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590.smt2 [2018-06-25 03:44:41,430 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-25 03:44:41,516 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590.smt2 unknown [2018-06-25 03:44:41,788 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e7_590.smt2 [2018-06-25 03:44:41,792 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:44:41,796 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:44:41,797 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:44:41,797 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:44:41,797 INFO ]: ChcToBoogie initialized [2018-06-25 03:44:41,802 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:44:41" (1/1) ... [2018-06-25 03:44:41,858 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41 Unit [2018-06-25 03:44:41,858 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:44:41,859 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:44:41,859 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:44:41,859 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:44:41,875 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41" (1/1) ... [2018-06-25 03:44:41,875 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41" (1/1) ... [2018-06-25 03:44:41,880 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41" (1/1) ... [2018-06-25 03:44:41,880 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41" (1/1) ... [2018-06-25 03:44:41,883 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41" (1/1) ... [2018-06-25 03:44:41,885 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41" (1/1) ... [2018-06-25 03:44:41,886 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41" (1/1) ... [2018-06-25 03:44:41,891 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:44:41,892 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:44:41,892 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:44:41,892 INFO ]: RCFGBuilder initialized [2018-06-25 03:44:41,893 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41" (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-25 03:44:41,910 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:44:41,910 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:44:41,910 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:44:41,911 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:44:41,911 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:44:41,911 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-25 03:44:42,183 INFO ]: Using library mode [2018-06-25 03:44:42,184 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:44:42 BoogieIcfgContainer [2018-06-25 03:44:42,184 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:44:42,185 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:44:42,185 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:44:42,186 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:44:42,186 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:44:42" (1/1) ... [2018-06-25 03:44:42,201 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:44:42,203 INFO ]: Using Remove infeasible edges [2018-06-25 03:44:42,203 INFO ]: Using Maximize final states [2018-06-25 03:44:42,204 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:44:42,204 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:44:42,208 INFO ]: Using Remove sink states [2018-06-25 03:44:42,208 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:44:42,208 INFO ]: Using Use SBE [2018-06-25 03:44:42,214 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:44:44,231 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:44:44,231 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:44:44,921 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:44:44,922 INFO ]: SBE split 2 edges [2018-06-25 03:44:44,938 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:44:44,943 INFO ]: 0 new accepting states [2018-06-25 03:44:55,793 INFO ]: Removed 2058 edges and 2 locations by large block encoding [2018-06-25 03:44:55,796 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:44:55,808 INFO ]: Removed 5 edges and 0 locations because of local infeasibility [2018-06-25 03:44:55,812 INFO ]: 0 new accepting states [2018-06-25 03:44:55,814 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:44:55,814 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:44:55,821 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:44:55,823 INFO ]: 0 new accepting states [2018-06-25 03:44:55,825 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:44:55,825 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:44:55,834 INFO ]: Encoded RCFG 6 locations, 2055 edges [2018-06-25 03:44:55,835 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:44:55 BasicIcfg [2018-06-25 03:44:55,835 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:44:55,836 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:44:55,837 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:44:55,839 INFO ]: TraceAbstraction initialized [2018-06-25 03:44:55,840 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:44:41" (1/4) ... [2018-06-25 03:44:55,840 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c163989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:44:55, skipping insertion in model container [2018-06-25 03:44:55,840 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:44:41" (2/4) ... [2018-06-25 03:44:55,841 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c163989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:44:55, skipping insertion in model container [2018-06-25 03:44:55,841 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:44:42" (3/4) ... [2018-06-25 03:44:55,842 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c163989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:44:55, skipping insertion in model container [2018-06-25 03:44:55,842 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:44:55" (4/4) ... [2018-06-25 03:44:55,843 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:44:55,854 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:44:55,862 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:44:55,909 INFO ]: Using default assertion order modulation [2018-06-25 03:44:55,910 INFO ]: Interprodecural is true [2018-06-25 03:44:55,910 INFO ]: Hoare is false [2018-06-25 03:44:55,910 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:44:55,910 INFO ]: Backedges is TWOTRACK [2018-06-25 03:44:55,910 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:44:55,910 INFO ]: Difference is false [2018-06-25 03:44:55,910 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:44:55,910 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:44:55,931 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:44:55,952 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:44:55,952 INFO ]: Found error trace [2018-06-25 03:44:55,952 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:44:55,953 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:55,959 INFO ]: Analyzing trace with hash 161073493, now seen corresponding path program 1 times [2018-06-25 03:44:55,961 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:55,961 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:56,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:56,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:56,008 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:56,052 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:56,151 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:56,153 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:56,154 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:56,155 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:56,170 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:56,171 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:56,173 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:44:59,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:44:59,241 INFO ]: Finished difference Result 7 states and 2056 transitions. [2018-06-25 03:44:59,242 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:44:59,242 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:44:59,243 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:44:59,256 INFO ]: With dead ends: 7 [2018-06-25 03:44:59,256 INFO ]: Without dead ends: 7 [2018-06-25 03:44:59,257 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-25 03:44:59,275 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:44:59,323 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:44:59,324 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:44:59,329 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2056 transitions. [2018-06-25 03:44:59,330 INFO ]: Start accepts. Automaton has 7 states and 2056 transitions. Word has length 5 [2018-06-25 03:44:59,331 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:44:59,331 INFO ]: Abstraction has 7 states and 2056 transitions. [2018-06-25 03:44:59,331 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:44:59,331 INFO ]: Start isEmpty. Operand 7 states and 2056 transitions. [2018-06-25 03:44:59,332 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:44:59,332 INFO ]: Found error trace [2018-06-25 03:44:59,332 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:44:59,332 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:44:59,333 INFO ]: Analyzing trace with hash 579668008, now seen corresponding path program 1 times [2018-06-25 03:44:59,333 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:44:59,333 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:44:59,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:59,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:44:59,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:44:59,365 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:44:59,525 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:44:59,525 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:44:59,525 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:44:59,526 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:44:59,526 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:44:59,526 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:44:59,526 INFO ]: Start difference. First operand 7 states and 2056 transitions. Second operand 3 states. [2018-06-25 03:45:02,371 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:02,374 INFO ]: Finished difference Result 8 states and 2056 transitions. [2018-06-25 03:45:02,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:02,374 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:02,374 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:02,377 INFO ]: With dead ends: 8 [2018-06-25 03:45:02,377 INFO ]: Without dead ends: 7 [2018-06-25 03:45:02,378 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-25 03:45:02,378 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:02,387 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:02,387 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:02,391 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1544 transitions. [2018-06-25 03:45:02,391 INFO ]: Start accepts. Automaton has 7 states and 1544 transitions. Word has length 6 [2018-06-25 03:45:02,391 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:02,391 INFO ]: Abstraction has 7 states and 1544 transitions. [2018-06-25 03:45:02,391 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:02,391 INFO ]: Start isEmpty. Operand 7 states and 1544 transitions. [2018-06-25 03:45:02,392 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:02,392 INFO ]: Found error trace [2018-06-25 03:45:02,392 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:02,392 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:02,393 INFO ]: Analyzing trace with hash 581515050, now seen corresponding path program 1 times [2018-06-25 03:45:02,393 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:02,393 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:02,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:02,393 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:02,393 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:02,424 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:02,483 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:02,483 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:02,483 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:02,483 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:02,483 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:02,483 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:02,483 INFO ]: Start difference. First operand 7 states and 1544 transitions. Second operand 3 states. [2018-06-25 03:45:04,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:04,678 INFO ]: Finished difference Result 8 states and 1544 transitions. [2018-06-25 03:45:04,679 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:04,679 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:04,679 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:04,681 INFO ]: With dead ends: 8 [2018-06-25 03:45:04,681 INFO ]: Without dead ends: 7 [2018-06-25 03:45:04,681 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-25 03:45:04,681 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:04,690 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:04,690 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:04,693 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1160 transitions. [2018-06-25 03:45:04,693 INFO ]: Start accepts. Automaton has 7 states and 1160 transitions. Word has length 6 [2018-06-25 03:45:04,693 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:04,693 INFO ]: Abstraction has 7 states and 1160 transitions. [2018-06-25 03:45:04,693 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:04,694 INFO ]: Start isEmpty. Operand 7 states and 1160 transitions. [2018-06-25 03:45:04,694 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:04,694 INFO ]: Found error trace [2018-06-25 03:45:04,694 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:04,694 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:04,695 INFO ]: Analyzing trace with hash 582438571, now seen corresponding path program 1 times [2018-06-25 03:45:04,695 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:04,695 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:04,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:04,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:04,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:04,726 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:04,866 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:04,866 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:04,866 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:04,867 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:04,867 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:04,867 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:04,867 INFO ]: Start difference. First operand 7 states and 1160 transitions. Second operand 3 states. [2018-06-25 03:45:06,104 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:06,104 INFO ]: Finished difference Result 8 states and 1160 transitions. [2018-06-25 03:45:06,104 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:06,104 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:06,104 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:06,106 INFO ]: With dead ends: 8 [2018-06-25 03:45:06,106 INFO ]: Without dead ends: 7 [2018-06-25 03:45:06,106 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-25 03:45:06,106 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:06,111 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:06,111 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:06,112 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2018-06-25 03:45:06,112 INFO ]: Start accepts. Automaton has 7 states and 776 transitions. Word has length 6 [2018-06-25 03:45:06,113 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:06,113 INFO ]: Abstraction has 7 states and 776 transitions. [2018-06-25 03:45:06,113 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:06,113 INFO ]: Start isEmpty. Operand 7 states and 776 transitions. [2018-06-25 03:45:06,113 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:06,113 INFO ]: Found error trace [2018-06-25 03:45:06,113 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:06,113 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:06,113 INFO ]: Analyzing trace with hash 583362092, now seen corresponding path program 1 times [2018-06-25 03:45:06,114 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:06,114 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:06,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:06,114 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:06,114 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:06,143 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:06,186 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:06,186 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:06,186 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:06,187 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:06,187 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:06,187 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:06,187 INFO ]: Start difference. First operand 7 states and 776 transitions. Second operand 3 states. [2018-06-25 03:45:06,866 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:06,866 INFO ]: Finished difference Result 8 states and 776 transitions. [2018-06-25 03:45:06,866 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:06,867 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:06,867 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:06,867 INFO ]: With dead ends: 8 [2018-06-25 03:45:06,867 INFO ]: Without dead ends: 7 [2018-06-25 03:45:06,868 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-25 03:45:06,868 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:06,874 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:06,874 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:06,875 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 584 transitions. [2018-06-25 03:45:06,875 INFO ]: Start accepts. Automaton has 7 states and 584 transitions. Word has length 6 [2018-06-25 03:45:06,875 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:06,875 INFO ]: Abstraction has 7 states and 584 transitions. [2018-06-25 03:45:06,875 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:06,875 INFO ]: Start isEmpty. Operand 7 states and 584 transitions. [2018-06-25 03:45:06,875 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:06,875 INFO ]: Found error trace [2018-06-25 03:45:06,875 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:06,875 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:06,876 INFO ]: Analyzing trace with hash 585209134, now seen corresponding path program 1 times [2018-06-25 03:45:06,876 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:06,877 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:06,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:06,878 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:06,878 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:06,894 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:06,927 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:06,927 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:06,927 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:06,927 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:06,928 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:06,928 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:06,928 INFO ]: Start difference. First operand 7 states and 584 transitions. Second operand 3 states. [2018-06-25 03:45:07,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:07,391 INFO ]: Finished difference Result 8 states and 584 transitions. [2018-06-25 03:45:07,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:07,391 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:07,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:07,391 INFO ]: With dead ends: 8 [2018-06-25 03:45:07,391 INFO ]: Without dead ends: 7 [2018-06-25 03:45:07,392 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-25 03:45:07,392 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:07,394 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:07,394 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:07,397 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 392 transitions. [2018-06-25 03:45:07,397 INFO ]: Start accepts. Automaton has 7 states and 392 transitions. Word has length 6 [2018-06-25 03:45:07,398 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:07,398 INFO ]: Abstraction has 7 states and 392 transitions. [2018-06-25 03:45:07,398 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:07,398 INFO ]: Start isEmpty. Operand 7 states and 392 transitions. [2018-06-25 03:45:07,398 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:07,398 INFO ]: Found error trace [2018-06-25 03:45:07,398 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:07,398 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:07,398 INFO ]: Analyzing trace with hash 107748777, now seen corresponding path program 1 times [2018-06-25 03:45:07,398 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:07,398 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:07,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:07,399 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:07,399 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:07,418 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:07,517 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:07,517 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:07,517 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:07,517 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:07,517 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:07,517 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:07,518 INFO ]: Start difference. First operand 7 states and 392 transitions. Second operand 3 states. [2018-06-25 03:45:08,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:08,041 INFO ]: Finished difference Result 8 states and 392 transitions. [2018-06-25 03:45:08,044 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:08,044 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:08,044 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:08,045 INFO ]: With dead ends: 8 [2018-06-25 03:45:08,045 INFO ]: Without dead ends: 7 [2018-06-25 03:45:08,045 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-25 03:45:08,045 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:08,047 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:08,047 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:08,047 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 264 transitions. [2018-06-25 03:45:08,048 INFO ]: Start accepts. Automaton has 7 states and 264 transitions. Word has length 6 [2018-06-25 03:45:08,048 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:08,048 INFO ]: Abstraction has 7 states and 264 transitions. [2018-06-25 03:45:08,048 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:08,048 INFO ]: Start isEmpty. Operand 7 states and 264 transitions. [2018-06-25 03:45:08,048 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:08,048 INFO ]: Found error trace [2018-06-25 03:45:08,048 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:08,048 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:08,048 INFO ]: Analyzing trace with hash 110519340, now seen corresponding path program 1 times [2018-06-25 03:45:08,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:08,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:08,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:08,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:08,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:08,064 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:08,125 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:08,125 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:08,125 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:08,125 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:08,125 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:08,125 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:08,125 INFO ]: Start difference. First operand 7 states and 264 transitions. Second operand 3 states. [2018-06-25 03:45:08,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:08,352 INFO ]: Finished difference Result 8 states and 264 transitions. [2018-06-25 03:45:08,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:08,352 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:08,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:08,352 INFO ]: With dead ends: 8 [2018-06-25 03:45:08,352 INFO ]: Without dead ends: 7 [2018-06-25 03:45:08,353 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-25 03:45:08,353 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:08,354 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:08,354 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:08,354 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2018-06-25 03:45:08,354 INFO ]: Start accepts. Automaton has 7 states and 200 transitions. Word has length 6 [2018-06-25 03:45:08,354 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:08,355 INFO ]: Abstraction has 7 states and 200 transitions. [2018-06-25 03:45:08,355 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:08,355 INFO ]: Start isEmpty. Operand 7 states and 200 transitions. [2018-06-25 03:45:08,355 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:08,355 INFO ]: Found error trace [2018-06-25 03:45:08,355 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:08,355 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:08,355 INFO ]: Analyzing trace with hash -1074358103, now seen corresponding path program 1 times [2018-06-25 03:45:08,355 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:08,355 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:08,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:08,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:08,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:08,365 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:08,500 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:08,500 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:08,500 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-25 03:45:08,515 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:08,570 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:08,579 INFO ]: Computing forward predicates... [2018-06-25 03:45:08,643 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:08,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:08,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 03:45:08,670 INFO ]: Interpolant automaton has 4 states [2018-06-25 03:45:08,670 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 03:45:08,670 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 03:45:08,670 INFO ]: Start difference. First operand 7 states and 200 transitions. Second operand 4 states. [2018-06-25 03:45:10,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:10,307 INFO ]: Finished difference Result 11 states and 203 transitions. [2018-06-25 03:45:10,307 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:45:10,307 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 03:45:10,307 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:10,308 INFO ]: With dead ends: 11 [2018-06-25 03:45:10,308 INFO ]: Without dead ends: 10 [2018-06-25 03:45:10,308 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:45:10,308 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 03:45:10,311 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-25 03:45:10,311 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:10,311 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2018-06-25 03:45:10,311 INFO ]: Start accepts. Automaton has 8 states and 185 transitions. Word has length 6 [2018-06-25 03:45:10,311 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:10,311 INFO ]: Abstraction has 8 states and 185 transitions. [2018-06-25 03:45:10,311 INFO ]: Interpolant automaton has 4 states. [2018-06-25 03:45:10,311 INFO ]: Start isEmpty. Operand 8 states and 185 transitions. [2018-06-25 03:45:10,313 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:10,313 INFO ]: Found error trace [2018-06-25 03:45:10,313 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:10,313 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:10,314 INFO ]: Analyzing trace with hash -834242643, now seen corresponding path program 1 times [2018-06-25 03:45:10,314 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:10,314 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:10,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:10,314 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:10,314 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:10,336 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:10,413 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:10,413 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:10,413 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:10,413 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:10,413 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:10,413 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:10,414 INFO ]: Start difference. First operand 8 states and 185 transitions. Second operand 3 states. [2018-06-25 03:45:10,700 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:10,701 INFO ]: Finished difference Result 9 states and 185 transitions. [2018-06-25 03:45:10,701 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:10,701 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:10,701 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:10,701 INFO ]: With dead ends: 9 [2018-06-25 03:45:10,701 INFO ]: Without dead ends: 8 [2018-06-25 03:45:10,701 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-25 03:45:10,701 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:10,703 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:10,703 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:10,703 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-06-25 03:45:10,703 INFO ]: Start accepts. Automaton has 8 states and 57 transitions. Word has length 6 [2018-06-25 03:45:10,703 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:10,703 INFO ]: Abstraction has 8 states and 57 transitions. [2018-06-25 03:45:10,703 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:10,703 INFO ]: Start isEmpty. Operand 8 states and 57 transitions. [2018-06-25 03:45:10,703 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:10,703 INFO ]: Found error trace [2018-06-25 03:45:10,704 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:10,704 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:10,704 INFO ]: Analyzing trace with hash 935994196, now seen corresponding path program 2 times [2018-06-25 03:45:10,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:10,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:10,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:10,704 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:10,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:10,736 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:11,058 WARN ]: Spent 218.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2018-06-25 03:45:11,131 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:11,131 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:11,131 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-25 03:45:11,137 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 03:45:11,194 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 03:45:11,194 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:11,197 INFO ]: Computing forward predicates... [2018-06-25 03:45:11,654 WARN ]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-25 03:45:11,664 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 03:45:11,686 WARN ]: expecting exponential blowup for input size 7 [2018-06-25 03:45:12,297 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:12,315 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:12,315 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 03:45:12,316 INFO ]: Interpolant automaton has 7 states [2018-06-25 03:45:12,316 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 03:45:12,316 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:45:12,316 INFO ]: Start difference. First operand 8 states and 57 transitions. Second operand 7 states. [2018-06-25 03:45:12,561 WARN ]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-25 03:45:13,185 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:13,185 INFO ]: Finished difference Result 17 states and 62 transitions. [2018-06-25 03:45:13,185 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 03:45:13,185 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 03:45:13,185 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:13,186 INFO ]: With dead ends: 17 [2018-06-25 03:45:13,186 INFO ]: Without dead ends: 9 [2018-06-25 03:45:13,186 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-25 03:45:13,186 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 03:45:13,187 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-25 03:45:13,187 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:13,187 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-06-25 03:45:13,187 INFO ]: Start accepts. Automaton has 8 states and 33 transitions. Word has length 7 [2018-06-25 03:45:13,187 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:13,187 INFO ]: Abstraction has 8 states and 33 transitions. [2018-06-25 03:45:13,187 INFO ]: Interpolant automaton has 7 states. [2018-06-25 03:45:13,187 INFO ]: Start isEmpty. Operand 8 states and 33 transitions. [2018-06-25 03:45:13,187 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:13,187 INFO ]: Found error trace [2018-06-25 03:45:13,187 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:13,188 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:13,188 INFO ]: Analyzing trace with hash 216102899, now seen corresponding path program 1 times [2018-06-25 03:45:13,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:13,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:13,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:13,188 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 03:45:13,188 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:13,200 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:13,257 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 03:45:13,257 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:13,257 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:13,257 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:13,257 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:13,257 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:13,257 INFO ]: Start difference. First operand 8 states and 33 transitions. Second operand 3 states. [2018-06-25 03:45:13,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:13,282 INFO ]: Finished difference Result 9 states and 33 transitions. [2018-06-25 03:45:13,282 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:13,282 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 03:45:13,282 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:13,282 INFO ]: With dead ends: 9 [2018-06-25 03:45:13,282 INFO ]: Without dead ends: 8 [2018-06-25 03:45:13,283 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-25 03:45:13,283 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:13,284 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:13,284 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:13,284 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-06-25 03:45:13,284 INFO ]: Start accepts. Automaton has 8 states and 27 transitions. Word has length 7 [2018-06-25 03:45:13,284 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:13,284 INFO ]: Abstraction has 8 states and 27 transitions. [2018-06-25 03:45:13,284 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:13,284 INFO ]: Start isEmpty. Operand 8 states and 27 transitions. [2018-06-25 03:45:13,284 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:13,284 INFO ]: Found error trace [2018-06-25 03:45:13,284 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:13,284 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:13,284 INFO ]: Analyzing trace with hash 1907601392, now seen corresponding path program 1 times [2018-06-25 03:45:13,284 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:13,284 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:13,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:13,285 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:13,285 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:13,298 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:13,325 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 03:45:13,325 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:13,325 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:13,325 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:13,325 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:13,325 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:13,325 INFO ]: Start difference. First operand 8 states and 27 transitions. Second operand 3 states. [2018-06-25 03:45:13,347 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:13,347 INFO ]: Finished difference Result 9 states and 27 transitions. [2018-06-25 03:45:13,347 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:13,347 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 03:45:13,347 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:13,348 INFO ]: With dead ends: 9 [2018-06-25 03:45:13,348 INFO ]: Without dead ends: 8 [2018-06-25 03:45:13,348 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-25 03:45:13,348 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:13,348 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:13,349 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:13,349 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 15 transitions. [2018-06-25 03:45:13,349 INFO ]: Start accepts. Automaton has 8 states and 15 transitions. Word has length 7 [2018-06-25 03:45:13,349 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:13,349 INFO ]: Abstraction has 8 states and 15 transitions. [2018-06-25 03:45:13,349 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:13,349 INFO ]: Start isEmpty. Operand 8 states and 15 transitions. [2018-06-25 03:45:13,349 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:13,349 INFO ]: Found error trace [2018-06-25 03:45:13,349 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:13,349 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:13,349 INFO ]: Analyzing trace with hash -1127683260, now seen corresponding path program 1 times [2018-06-25 03:45:13,349 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:13,349 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:13,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:13,350 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:13,350 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:13,360 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:13,465 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 03:45:13,466 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:13,466 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:13,466 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:13,466 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:13,466 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:13,466 INFO ]: Start difference. First operand 8 states and 15 transitions. Second operand 3 states. [2018-06-25 03:45:13,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:13,528 INFO ]: Finished difference Result 9 states and 15 transitions. [2018-06-25 03:45:13,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:13,528 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 03:45:13,528 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:13,528 INFO ]: With dead ends: 9 [2018-06-25 03:45:13,528 INFO ]: Without dead ends: 8 [2018-06-25 03:45:13,528 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-25 03:45:13,528 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:13,529 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:13,529 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:13,529 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-25 03:45:13,529 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-25 03:45:13,529 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:13,529 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-25 03:45:13,529 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:13,529 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-25 03:45:13,530 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:13,530 INFO ]: Found error trace [2018-06-25 03:45:13,530 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:13,530 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:13,530 INFO ]: Analyzing trace with hash 734400847, now seen corresponding path program 1 times [2018-06-25 03:45:13,530 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:13,530 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:13,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:13,530 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:13,531 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:13,546 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:13,639 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:13,640 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:13,640 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:45:13,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:13,682 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:13,685 INFO ]: Computing forward predicates... [2018-06-25 03:45:14,066 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:14,100 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:14,100 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-25 03:45:14,100 INFO ]: Interpolant automaton has 6 states [2018-06-25 03:45:14,101 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 03:45:14,101 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-25 03:45:14,101 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. [2018-06-25 03:45:14,351 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:14,351 INFO ]: Finished difference Result 10 states and 12 transitions. [2018-06-25 03:45:14,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:45:14,352 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-25 03:45:14,352 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:14,352 INFO ]: With dead ends: 10 [2018-06-25 03:45:14,352 INFO ]: Without dead ends: 8 [2018-06-25 03:45:14,352 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:45:14,352 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:14,353 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:14,353 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:14,353 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-25 03:45:14,353 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 7 [2018-06-25 03:45:14,353 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:14,353 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-25 03:45:14,353 INFO ]: Interpolant automaton has 6 states. [2018-06-25 03:45:14,353 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-25 03:45:14,353 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:14,353 INFO ]: Found error trace [2018-06-25 03:45:14,353 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:14,353 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:14,354 INFO ]: Analyzing trace with hash -1901264983, now seen corresponding path program 1 times [2018-06-25 03:45:14,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:14,354 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:14,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:14,354 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:14,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:14,366 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:14,468 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:14,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:14,468 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:45:14,476 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:14,528 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:14,530 INFO ]: Computing forward predicates... [2018-06-25 03:45:14,802 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 03:45:14,821 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:14,821 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 03:45:14,821 INFO ]: Interpolant automaton has 7 states [2018-06-25 03:45:14,821 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 03:45:14,822 INFO ]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-06-25 03:45:14,822 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2018-06-25 03:45:14,863 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:14,863 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 03:45:14,863 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 03:45:14,863 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-25 03:45:14,863 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:14,863 INFO ]: With dead ends: 4 [2018-06-25 03:45:14,863 INFO ]: Without dead ends: 0 [2018-06-25 03:45:14,863 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-25 03:45:14,863 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 03:45:14,863 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 03:45:14,863 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 03:45:14,863 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 03:45:14,863 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 03:45:14,863 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:14,863 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 03:45:14,863 INFO ]: Interpolant automaton has 7 states. [2018-06-25 03:45:14,864 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 03:45:14,864 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 03:45:14,866 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:45:14,867 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:45:14 BasicIcfg [2018-06-25 03:45:14,867 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:45:14,868 INFO ]: Toolchain (without parser) took 33074.98 ms. Allocated memory was 309.9 MB in the beginning and 1.1 GB in the end (delta: 836.8 MB). Free memory was 262.2 MB in the beginning and 538.7 MB in the end (delta: -276.5 MB). Peak memory consumption was 560.2 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:14,869 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:45:14,869 INFO ]: ChcToBoogie took 62.03 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 259.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:14,870 INFO ]: Boogie Preprocessor took 32.25 ms. Allocated memory is still 309.9 MB. Free memory was 259.2 MB in the beginning and 258.2 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:14,870 INFO ]: RCFGBuilder took 292.38 ms. Allocated memory is still 309.9 MB. Free memory was 258.2 MB in the beginning and 244.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:14,871 INFO ]: BlockEncodingV2 took 13650.87 ms. Allocated memory was 309.9 MB in the beginning and 764.9 MB in the end (delta: 455.1 MB). Free memory was 244.2 MB in the beginning and 471.1 MB in the end (delta: -226.9 MB). Peak memory consumption was 426.6 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:14,871 INFO ]: TraceAbstraction took 19030.58 ms. Allocated memory was 764.9 MB in the beginning and 1.1 GB in the end (delta: 381.7 MB). Free memory was 471.1 MB in the beginning and 538.7 MB in the end (delta: -67.6 MB). Peak memory consumption was 314.1 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:14,875 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 10 edges - StatisticsResult: Encoded RCFG 6 locations, 2055 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 309.9 MB. Free memory is still 275.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 62.03 ms. Allocated memory is still 309.9 MB. Free memory was 262.2 MB in the beginning and 259.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 32.25 ms. Allocated memory is still 309.9 MB. Free memory was 259.2 MB in the beginning and 258.2 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 292.38 ms. Allocated memory is still 309.9 MB. Free memory was 258.2 MB in the beginning and 244.2 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 13650.87 ms. Allocated memory was 309.9 MB in the beginning and 764.9 MB in the end (delta: 455.1 MB). Free memory was 244.2 MB in the beginning and 471.1 MB in the end (delta: -226.9 MB). Peak memory consumption was 426.6 MB. Max. memory is 3.6 GB. * TraceAbstraction took 19030.58 ms. Allocated memory was 764.9 MB in the beginning and 1.1 GB in the end (delta: 381.7 MB). Free memory was 471.1 MB in the beginning and 538.7 MB in the end (delta: -67.6 MB). Peak memory consumption was 314.1 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, 6 locations, 1 error locations. SAFE Result, 18.9s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 14.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9337 SDtfs, 0 SDslu, 74 SDs, 0 SdLazy, 5496 SolverSat, 4230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=9, 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 1509 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1003 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 17/37 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/ex3_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-45-14-886.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-45-14-886.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-45-14-886.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e7_590.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-45-14-886.csv Received shutdown request...