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_e8_381_e7_224.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 03:45:17,565 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 03:45:17,567 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 03:45:17,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 03:45:17,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 03:45:17,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 03:45:17,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 03:45:17,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 03:45:17,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 03:45:17,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 03:45:17,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 03:45:17,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 03:45:17,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 03:45:17,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 03:45:17,591 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 03:45:17,591 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 03:45:17,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 03:45:17,597 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 03:45:17,611 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 03:45:17,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 03:45:17,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 03:45:17,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 03:45:17,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 03:45:17,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 03:45:17,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 03:45:17,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 03:45:17,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 03:45:17,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 03:45:17,619 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 03:45:17,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 03:45:17,622 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 03:45:17,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 03:45:17,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 03:45:17,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 03:45:17,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 03:45:17,625 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:45:17,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 03:45:17,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 03:45:17,649 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 03:45:17,649 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 03:45:17,653 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 03:45:17,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 03:45:17,653 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 03:45:17,653 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 03:45:17,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 03:45:17,654 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 03:45:17,654 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 03:45:17,654 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 03:45:17,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:45:17,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 03:45:17,655 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 03:45:17,655 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 03:45:17,655 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 03:45:17,655 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 03:45:17,655 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 03:45:17,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 03:45:17,656 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 03:45:17,658 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 03:45:17,658 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 03:45:17,702 INFO ]: Repository-Root is: /tmp [2018-06-25 03:45:17,714 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 03:45:17,719 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 03:45:17,720 INFO ]: Initializing SmtParser... [2018-06-25 03:45:17,720 INFO ]: SmtParser initialized [2018-06-25 03:45:17,721 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e8_381_e7_224.smt2 [2018-06-25 03:45:17,722 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:45:17,814 INFO ]: Executing SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e8_381_e7_224.smt2 unknown [2018-06-25 03:45:18,108 INFO ]: Succesfully executed SMT file /storage/chc-comp/vmt-chc-benchmarks/lustre/ex3_e8_381_e7_224.smt2 [2018-06-25 03:45:18,111 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 03:45:18,116 INFO ]: Walking toolchain with 5 elements. [2018-06-25 03:45:18,116 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 03:45:18,116 INFO ]: Initializing ChcToBoogie... [2018-06-25 03:45:18,116 INFO ]: ChcToBoogie initialized [2018-06-25 03:45:18,119 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:45:18" (1/1) ... [2018-06-25 03:45:18,171 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18 Unit [2018-06-25 03:45:18,171 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 03:45:18,172 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 03:45:18,172 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 03:45:18,172 INFO ]: Boogie Preprocessor initialized [2018-06-25 03:45:18,192 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18" (1/1) ... [2018-06-25 03:45:18,192 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18" (1/1) ... [2018-06-25 03:45:18,199 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18" (1/1) ... [2018-06-25 03:45:18,200 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18" (1/1) ... [2018-06-25 03:45:18,204 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18" (1/1) ... [2018-06-25 03:45:18,213 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18" (1/1) ... [2018-06-25 03:45:18,215 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18" (1/1) ... [2018-06-25 03:45:18,216 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 03:45:18,217 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 03:45:18,217 INFO ]: Initializing RCFGBuilder... [2018-06-25 03:45:18,217 INFO ]: RCFGBuilder initialized [2018-06-25 03:45:18,227 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 03:45:18,244 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 03:45:18,244 INFO ]: Found specification of procedure gotoProc [2018-06-25 03:45:18,244 INFO ]: Found implementation of procedure gotoProc [2018-06-25 03:45:18,244 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 03:45:18,244 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 03:45:18,244 INFO ]: Found implementation of procedure Ultimate.START [2018-06-25 03:45:18,530 INFO ]: Using library mode [2018-06-25 03:45:18,530 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:45:18 BoogieIcfgContainer [2018-06-25 03:45:18,530 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 03:45:18,531 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-25 03:45:18,531 INFO ]: Initializing BlockEncodingV2... [2018-06-25 03:45:18,532 INFO ]: BlockEncodingV2 initialized [2018-06-25 03:45:18,532 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:45:18" (1/1) ... [2018-06-25 03:45:18,549 INFO ]: Initial Icfg 10 locations, 10 edges [2018-06-25 03:45:18,550 INFO ]: Using Remove infeasible edges [2018-06-25 03:45:18,551 INFO ]: Using Maximize final states [2018-06-25 03:45:18,551 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-25 03:45:18,551 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-25 03:45:18,553 INFO ]: Using Remove sink states [2018-06-25 03:45:18,554 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-25 03:45:18,554 INFO ]: Using Use SBE [2018-06-25 03:45:18,559 WARN ]: expecting exponential blowup for input size 12 [2018-06-25 03:45:20,569 WARN ]: expecting exponential blowup for input size 11 [2018-06-25 03:45:20,859 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:45:21,162 WARN ]: aborting because of expected exponential blowup for input size 41 [2018-06-25 03:45:21,163 INFO ]: SBE split 2 edges [2018-06-25 03:45:21,179 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-25 03:45:21,184 INFO ]: 0 new accepting states [2018-06-25 03:45:34,041 INFO ]: Removed 2058 edges and 2 locations by large block encoding [2018-06-25 03:45:34,043 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:45:34,090 INFO ]: Removed 5 edges and 0 locations because of local infeasibility [2018-06-25 03:45:34,091 INFO ]: 0 new accepting states [2018-06-25 03:45:34,093 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:45:34,094 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:45:34,100 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-25 03:45:34,102 INFO ]: 0 new accepting states [2018-06-25 03:45:34,104 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-25 03:45:34,104 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-25 03:45:34,116 INFO ]: Encoded RCFG 6 locations, 2055 edges [2018-06-25 03:45:34,116 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:45:34 BasicIcfg [2018-06-25 03:45:34,116 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-25 03:45:34,118 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 03:45:34,118 INFO ]: Initializing TraceAbstraction... [2018-06-25 03:45:34,121 INFO ]: TraceAbstraction initialized [2018-06-25 03:45:34,122 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 03:45:18" (1/4) ... [2018-06-25 03:45:34,122 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659f5e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 03:45:34, skipping insertion in model container [2018-06-25 03:45:34,122 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 03:45:18" (2/4) ... [2018-06-25 03:45:34,123 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659f5e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 03:45:34, skipping insertion in model container [2018-06-25 03:45:34,123 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 03:45:18" (3/4) ... [2018-06-25 03:45:34,123 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659f5e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:45:34, skipping insertion in model container [2018-06-25 03:45:34,123 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 25.06 03:45:34" (4/4) ... [2018-06-25 03:45:34,124 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-25 03:45:34,131 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 03:45:34,137 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 03:45:34,184 INFO ]: Using default assertion order modulation [2018-06-25 03:45:34,185 INFO ]: Interprodecural is true [2018-06-25 03:45:34,185 INFO ]: Hoare is false [2018-06-25 03:45:34,185 INFO ]: Compute interpolants for FPandBP [2018-06-25 03:45:34,185 INFO ]: Backedges is TWOTRACK [2018-06-25 03:45:34,185 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 03:45:34,185 INFO ]: Difference is false [2018-06-25 03:45:34,185 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 03:45:34,185 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 03:45:34,206 INFO ]: Start isEmpty. Operand 6 states. [2018-06-25 03:45:34,236 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:45:34,236 INFO ]: Found error trace [2018-06-25 03:45:34,237 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:45:34,238 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:34,243 INFO ]: Analyzing trace with hash 161071571, now seen corresponding path program 1 times [2018-06-25 03:45:34,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:34,245 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:34,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:34,277 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:34,277 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:34,323 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:34,428 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:45:34,431 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:34,431 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:34,433 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:34,448 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:34,449 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:34,452 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-25 03:45:37,515 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:37,515 INFO ]: Finished difference Result 7 states and 2056 transitions. [2018-06-25 03:45:37,516 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:37,516 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:45:37,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:37,534 INFO ]: With dead ends: 7 [2018-06-25 03:45:37,534 INFO ]: Without dead ends: 7 [2018-06-25 03:45:37,536 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:37,551 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:37,595 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:37,596 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:37,599 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2056 transitions. [2018-06-25 03:45:37,600 INFO ]: Start accepts. Automaton has 7 states and 2056 transitions. Word has length 5 [2018-06-25 03:45:37,601 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:37,601 INFO ]: Abstraction has 7 states and 2056 transitions. [2018-06-25 03:45:37,601 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:37,601 INFO ]: Start isEmpty. Operand 7 states and 2056 transitions. [2018-06-25 03:45:37,602 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-25 03:45:37,602 INFO ]: Found error trace [2018-06-25 03:45:37,602 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-25 03:45:37,603 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:37,603 INFO ]: Analyzing trace with hash 161101362, now seen corresponding path program 1 times [2018-06-25 03:45:37,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:37,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:37,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:37,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:37,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:37,630 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:37,676 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:45:37,676 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:37,676 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:37,677 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:37,677 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:37,677 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:37,677 INFO ]: Start difference. First operand 7 states and 2056 transitions. Second operand 3 states. [2018-06-25 03:45:40,177 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:40,177 INFO ]: Finished difference Result 8 states and 2057 transitions. [2018-06-25 03:45:40,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:40,177 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-25 03:45:40,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:40,180 INFO ]: With dead ends: 8 [2018-06-25 03:45:40,180 INFO ]: Without dead ends: 8 [2018-06-25 03:45:40,181 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:40,181 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:40,195 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-06-25 03:45:40,195 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:40,198 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2056 transitions. [2018-06-25 03:45:40,198 INFO ]: Start accepts. Automaton has 7 states and 2056 transitions. Word has length 5 [2018-06-25 03:45:40,198 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:40,198 INFO ]: Abstraction has 7 states and 2056 transitions. [2018-06-25 03:45:40,199 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:40,199 INFO ]: Start isEmpty. Operand 7 states and 2056 transitions. [2018-06-25 03:45:40,200 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:40,200 INFO ]: Found error trace [2018-06-25 03:45:40,200 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:40,200 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:40,200 INFO ]: Analyzing trace with hash 579695877, now seen corresponding path program 1 times [2018-06-25 03:45:40,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:40,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:40,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:40,201 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:40,201 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:40,235 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:40,310 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:40,310 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:40,311 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:40,311 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:40,311 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:40,311 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:40,311 INFO ]: Start difference. First operand 7 states and 2056 transitions. Second operand 3 states. [2018-06-25 03:45:43,306 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:43,306 INFO ]: Finished difference Result 8 states and 2056 transitions. [2018-06-25 03:45:43,306 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:43,306 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:43,306 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:43,308 INFO ]: With dead ends: 8 [2018-06-25 03:45:43,308 INFO ]: Without dead ends: 7 [2018-06-25 03:45:43,308 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:43,308 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:43,314 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:43,315 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:43,317 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1032 transitions. [2018-06-25 03:45:43,317 INFO ]: Start accepts. Automaton has 7 states and 1032 transitions. Word has length 6 [2018-06-25 03:45:43,317 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:43,317 INFO ]: Abstraction has 7 states and 1032 transitions. [2018-06-25 03:45:43,317 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:43,317 INFO ]: Start isEmpty. Operand 7 states and 1032 transitions. [2018-06-25 03:45:43,318 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:43,318 INFO ]: Found error trace [2018-06-25 03:45:43,318 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:43,318 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:43,318 INFO ]: Analyzing trace with hash 580619398, now seen corresponding path program 1 times [2018-06-25 03:45:43,318 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:43,318 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:43,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:43,320 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:43,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:43,349 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:43,394 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:43,394 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:43,394 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:43,394 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:43,394 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:43,394 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:43,394 INFO ]: Start difference. First operand 7 states and 1032 transitions. Second operand 3 states. [2018-06-25 03:45:44,294 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:44,294 INFO ]: Finished difference Result 8 states and 1032 transitions. [2018-06-25 03:45:44,294 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:44,294 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:44,294 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:44,295 INFO ]: With dead ends: 8 [2018-06-25 03:45:44,295 INFO ]: Without dead ends: 7 [2018-06-25 03:45:44,296 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:44,296 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:44,303 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:44,303 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:44,305 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2018-06-25 03:45:44,305 INFO ]: Start accepts. Automaton has 7 states and 776 transitions. Word has length 6 [2018-06-25 03:45:44,305 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:44,305 INFO ]: Abstraction has 7 states and 776 transitions. [2018-06-25 03:45:44,305 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:44,305 INFO ]: Start isEmpty. Operand 7 states and 776 transitions. [2018-06-25 03:45:44,305 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:44,305 INFO ]: Found error trace [2018-06-25 03:45:44,306 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:44,306 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:44,306 INFO ]: Analyzing trace with hash -365989627, now seen corresponding path program 1 times [2018-06-25 03:45:44,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:44,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:44,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:44,306 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:44,306 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:44,339 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:44,427 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:44,427 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:44,427 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:44,427 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:44,427 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:44,427 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:44,428 INFO ]: Start difference. First operand 7 states and 776 transitions. Second operand 3 states. [2018-06-25 03:45:45,138 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:45,138 INFO ]: Finished difference Result 8 states and 776 transitions. [2018-06-25 03:45:45,140 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:45,140 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:45,140 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:45,141 INFO ]: With dead ends: 8 [2018-06-25 03:45:45,141 INFO ]: Without dead ends: 7 [2018-06-25 03:45:45,141 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:45,141 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:45,144 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:45,144 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:45,145 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 648 transitions. [2018-06-25 03:45:45,145 INFO ]: Start accepts. Automaton has 7 states and 648 transitions. Word has length 6 [2018-06-25 03:45:45,145 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:45,145 INFO ]: Abstraction has 7 states and 648 transitions. [2018-06-25 03:45:45,145 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:45,145 INFO ]: Start isEmpty. Operand 7 states and 648 transitions. [2018-06-25 03:45:45,146 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:45,146 INFO ]: Found error trace [2018-06-25 03:45:45,146 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:45,146 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:45,146 INFO ]: Analyzing trace with hash -365066106, now seen corresponding path program 1 times [2018-06-25 03:45:45,146 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:45,146 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:45,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:45,147 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:45,147 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:45,173 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:45,202 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:45,202 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:45,253 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:45,253 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:45,253 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:45,253 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:45,253 INFO ]: Start difference. First operand 7 states and 648 transitions. Second operand 3 states. [2018-06-25 03:45:45,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:45,818 INFO ]: Finished difference Result 8 states and 648 transitions. [2018-06-25 03:45:45,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:45,819 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:45,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:45,819 INFO ]: With dead ends: 8 [2018-06-25 03:45:45,819 INFO ]: Without dead ends: 7 [2018-06-25 03:45:45,820 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:45,820 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:45,822 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:45,822 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:45,823 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 392 transitions. [2018-06-25 03:45:45,823 INFO ]: Start accepts. Automaton has 7 states and 392 transitions. Word has length 6 [2018-06-25 03:45:45,823 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:45,823 INFO ]: Abstraction has 7 states and 392 transitions. [2018-06-25 03:45:45,823 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:45,823 INFO ]: Start isEmpty. Operand 7 states and 392 transitions. [2018-06-25 03:45:45,824 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:45,824 INFO ]: Found error trace [2018-06-25 03:45:45,824 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:45,824 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:45,824 INFO ]: Analyzing trace with hash 581542919, now seen corresponding path program 1 times [2018-06-25 03:45:45,824 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:45,824 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:45,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:45,825 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:45,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:45,848 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:45,962 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:45,962 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:45,962 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:45,962 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:45,962 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:45,962 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:45,962 INFO ]: Start difference. First operand 7 states and 392 transitions. Second operand 3 states. [2018-06-25 03:45:46,298 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:46,298 INFO ]: Finished difference Result 8 states and 392 transitions. [2018-06-25 03:45:46,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:46,303 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:46,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:46,304 INFO ]: With dead ends: 8 [2018-06-25 03:45:46,304 INFO ]: Without dead ends: 7 [2018-06-25 03:45:46,304 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:46,304 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:46,306 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:46,306 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:46,307 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 200 transitions. [2018-06-25 03:45:46,307 INFO ]: Start accepts. Automaton has 7 states and 200 transitions. Word has length 6 [2018-06-25 03:45:46,307 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:46,307 INFO ]: Abstraction has 7 states and 200 transitions. [2018-06-25 03:45:46,307 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:46,307 INFO ]: Start isEmpty. Operand 7 states and 200 transitions. [2018-06-25 03:45:46,307 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:46,307 INFO ]: Found error trace [2018-06-25 03:45:46,307 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:46,307 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:46,307 INFO ]: Analyzing trace with hash 582466440, now seen corresponding path program 1 times [2018-06-25 03:45:46,307 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:46,307 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:46,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:46,308 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:46,308 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:46,326 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:46,450 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:46,450 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:46,450 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:46,450 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:46,450 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:46,450 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:46,450 INFO ]: Start difference. First operand 7 states and 200 transitions. Second operand 3 states. [2018-06-25 03:45:46,626 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:46,626 INFO ]: Finished difference Result 8 states and 200 transitions. [2018-06-25 03:45:46,626 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:46,626 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:46,626 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:46,627 INFO ]: With dead ends: 8 [2018-06-25 03:45:46,627 INFO ]: Without dead ends: 7 [2018-06-25 03:45:46,627 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:46,627 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:46,628 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:46,628 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:46,628 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2018-06-25 03:45:46,628 INFO ]: Start accepts. Automaton has 7 states and 104 transitions. Word has length 6 [2018-06-25 03:45:46,628 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:46,628 INFO ]: Abstraction has 7 states and 104 transitions. [2018-06-25 03:45:46,628 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:46,628 INFO ]: Start isEmpty. Operand 7 states and 104 transitions. [2018-06-25 03:45:46,629 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:46,629 INFO ]: Found error trace [2018-06-25 03:45:46,629 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:46,629 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:46,629 INFO ]: Analyzing trace with hash -1193464443, now seen corresponding path program 1 times [2018-06-25 03:45:46,629 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:46,629 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:46,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:46,629 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:46,629 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:46,642 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:46,771 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:46,771 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:46,771 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:46,772 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:46,772 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:46,772 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:46,772 INFO ]: Start difference. First operand 7 states and 104 transitions. Second operand 3 states. [2018-06-25 03:45:46,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:46,918 INFO ]: Finished difference Result 8 states and 104 transitions. [2018-06-25 03:45:46,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:46,918 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-25 03:45:46,918 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:46,919 INFO ]: With dead ends: 8 [2018-06-25 03:45:46,919 INFO ]: Without dead ends: 7 [2018-06-25 03:45:46,919 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:46,919 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-25 03:45:46,919 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-25 03:45:46,919 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-25 03:45:46,920 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2018-06-25 03:45:46,920 INFO ]: Start accepts. Automaton has 7 states and 56 transitions. Word has length 6 [2018-06-25 03:45:46,920 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:46,920 INFO ]: Abstraction has 7 states and 56 transitions. [2018-06-25 03:45:46,920 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:46,920 INFO ]: Start isEmpty. Operand 7 states and 56 transitions. [2018-06-25 03:45:46,920 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-25 03:45:46,920 INFO ]: Found error trace [2018-06-25 03:45:46,920 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-25 03:45:46,920 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:46,920 INFO ]: Analyzing trace with hash -11357563, now seen corresponding path program 1 times [2018-06-25 03:45:46,920 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:46,920 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:46,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:46,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:46,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:46,930 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:46,997 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:46,997 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:46,997 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:47,004 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:47,057 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:47,068 INFO ]: Computing forward predicates... [2018-06-25 03:45:47,136 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:47,171 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:47,171 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-25 03:45:47,171 INFO ]: Interpolant automaton has 4 states [2018-06-25 03:45:47,171 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 03:45:47,171 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 03:45:47,172 INFO ]: Start difference. First operand 7 states and 56 transitions. Second operand 4 states. [2018-06-25 03:45:48,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:48,042 INFO ]: Finished difference Result 9 states and 57 transitions. [2018-06-25 03:45:48,043 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:45:48,043 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-25 03:45:48,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:48,043 INFO ]: With dead ends: 9 [2018-06-25 03:45:48,043 INFO ]: Without dead ends: 8 [2018-06-25 03:45:48,043 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 03:45:48,043 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:48,044 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:48,044 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:48,044 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-06-25 03:45:48,044 INFO ]: Start accepts. Automaton has 8 states and 25 transitions. Word has length 6 [2018-06-25 03:45:48,045 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:48,045 INFO ]: Abstraction has 8 states and 25 transitions. [2018-06-25 03:45:48,045 INFO ]: Interpolant automaton has 4 states. [2018-06-25 03:45:48,045 INFO ]: Start isEmpty. Operand 8 states and 25 transitions. [2018-06-25 03:45:48,045 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:48,045 INFO ]: Found error trace [2018-06-25 03:45:48,045 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:48,045 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:48,045 INFO ]: Analyzing trace with hash -470639981, now seen corresponding path program 2 times [2018-06-25 03:45:48,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:48,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:48,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:48,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:48,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:48,074 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:48,197 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:48,197 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:48,197 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:48,204 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 03:45:48,252 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 03:45:48,252 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:48,254 INFO ]: Computing forward predicates... [2018-06-25 03:45:48,798 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:48,829 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:48,829 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 03:45:48,829 INFO ]: Interpolant automaton has 8 states [2018-06-25 03:45:48,829 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 03:45:48,829 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:45:48,829 INFO ]: Start difference. First operand 8 states and 25 transitions. Second operand 8 states. [2018-06-25 03:45:49,092 WARN ]: Spent 146.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2018-06-25 03:45:49,703 WARN ]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-06-25 03:45:49,932 WARN ]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-25 03:45:50,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:50,301 INFO ]: Finished difference Result 13 states and 27 transitions. [2018-06-25 03:45:50,332 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 03:45:50,332 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 03:45:50,332 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:50,332 INFO ]: With dead ends: 13 [2018-06-25 03:45:50,332 INFO ]: Without dead ends: 8 [2018-06-25 03:45:50,332 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-06-25 03:45:50,332 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:50,333 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:50,333 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:50,333 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-06-25 03:45:50,333 INFO ]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 7 [2018-06-25 03:45:50,333 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:50,333 INFO ]: Abstraction has 8 states and 13 transitions. [2018-06-25 03:45:50,333 INFO ]: Interpolant automaton has 8 states. [2018-06-25 03:45:50,333 INFO ]: Start isEmpty. Operand 8 states and 13 transitions. [2018-06-25 03:45:50,334 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:50,334 INFO ]: Found error trace [2018-06-25 03:45:50,334 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:50,334 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:50,334 INFO ]: Analyzing trace with hash 1163600210, now seen corresponding path program 1 times [2018-06-25 03:45:50,334 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:50,334 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:50,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:50,334 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 03:45:50,334 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:50,350 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:50,467 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:50,467 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 03:45:50,467 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 03:45:50,467 INFO ]: Interpolant automaton has 3 states [2018-06-25 03:45:50,467 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 03:45:50,467 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 03:45:50,467 INFO ]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2018-06-25 03:45:50,558 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:50,558 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-25 03:45:50,559 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 03:45:50,559 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 03:45:50,559 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:50,559 INFO ]: With dead ends: 9 [2018-06-25 03:45:50,559 INFO ]: Without dead ends: 8 [2018-06-25 03:45:50,559 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:50,559 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:50,560 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:50,560 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:50,560 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-25 03:45:50,560 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2018-06-25 03:45:50,560 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:50,560 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-25 03:45:50,560 INFO ]: Interpolant automaton has 3 states. [2018-06-25 03:45:50,560 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-25 03:45:50,560 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:50,560 INFO ]: Found error trace [2018-06-25 03:45:50,560 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:50,560 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:50,561 INFO ]: Analyzing trace with hash -640036303, now seen corresponding path program 1 times [2018-06-25 03:45:50,561 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:50,561 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:50,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:50,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:50,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:50,576 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:50,815 WARN ]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-25 03:45:51,073 WARN ]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 03:45:51,216 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:51,216 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:51,216 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) [2018-06-25 03:45:51,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 03:45:51,290 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:51,292 INFO ]: Computing forward predicates... [2018-06-25 03:45:51,944 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:51,964 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:51,964 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 03:45:51,965 INFO ]: Interpolant automaton has 8 states [2018-06-25 03:45:51,965 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 03:45:51,965 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:45:51,965 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 8 states. [2018-06-25 03:45:52,036 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:52,036 INFO ]: Finished difference Result 10 states and 12 transitions. [2018-06-25 03:45:52,036 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 03:45:52,036 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 03:45:52,036 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:52,036 INFO ]: With dead ends: 10 [2018-06-25 03:45:52,036 INFO ]: Without dead ends: 8 [2018-06-25 03:45:52,037 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-25 03:45:52,037 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-25 03:45:52,037 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-25 03:45:52,037 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-25 03:45:52,038 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-25 03:45:52,038 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 7 [2018-06-25 03:45:52,038 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:52,038 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-25 03:45:52,038 INFO ]: Interpolant automaton has 8 states. [2018-06-25 03:45:52,038 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-25 03:45:52,038 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 03:45:52,038 INFO ]: Found error trace [2018-06-25 03:45:52,038 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-25 03:45:52,038 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 03:45:52,038 INFO ]: Analyzing trace with hash 307698910, now seen corresponding path program 1 times [2018-06-25 03:45:52,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 03:45:52,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 03:45:52,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:52,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:52,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 03:45:52,052 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:52,616 WARN ]: Spent 515.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-25 03:45:52,880 WARN ]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-06-25 03:45:52,905 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:52,905 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 03:45:52,905 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:52,913 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 03:45:52,948 INFO ]: Conjunction of SSA is unsat [2018-06-25 03:45:52,950 INFO ]: Computing forward predicates... [2018-06-25 03:45:52,996 WARN ]: expecting exponential blowup for input size 6 [2018-06-25 03:45:53,109 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:53,129 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 03:45:53,129 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-06-25 03:45:53,129 INFO ]: Interpolant automaton has 8 states [2018-06-25 03:45:53,129 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 03:45:53,129 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-25 03:45:53,130 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 8 states. [2018-06-25 03:45:53,202 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 03:45:53,202 INFO ]: Finished difference Result 4 states and 3 transitions. [2018-06-25 03:45:53,203 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 03:45:53,203 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-25 03:45:53,203 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 03:45:53,203 INFO ]: With dead ends: 4 [2018-06-25 03:45:53,203 INFO ]: Without dead ends: 0 [2018-06-25 03:45:53,203 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-06-25 03:45:53,203 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-25 03:45:53,203 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-25 03:45:53,203 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-25 03:45:53,203 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-25 03:45:53,203 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-06-25 03:45:53,203 INFO ]: Finished accepts. word is rejected. [2018-06-25 03:45:53,203 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-25 03:45:53,203 INFO ]: Interpolant automaton has 8 states. [2018-06-25 03:45:53,203 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-25 03:45:53,203 INFO ]: Finished isEmpty. No accepting run. [2018-06-25 03:45:53,205 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-25 03:45:53,207 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 03:45:53 BasicIcfg [2018-06-25 03:45:53,207 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 03:45:53,208 INFO ]: Toolchain (without parser) took 35096.29 ms. Allocated memory was 303.6 MB in the beginning and 1.0 GB in the end (delta: 745.5 MB). Free memory was 256.1 MB in the beginning and 251.0 MB in the end (delta: 5.1 MB). Peak memory consumption was 750.7 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:53,209 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.6 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:45:53,210 INFO ]: ChcToBoogie took 55.21 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 252.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:53,210 INFO ]: Boogie Preprocessor took 44.82 ms. Allocated memory is still 303.6 MB. Free memory is still 252.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 03:45:53,210 INFO ]: RCFGBuilder took 313.29 ms. Allocated memory is still 303.6 MB. Free memory was 252.1 MB in the beginning and 238.1 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:53,211 INFO ]: BlockEncodingV2 took 15585.57 ms. Allocated memory was 303.6 MB in the beginning and 732.4 MB in the end (delta: 428.9 MB). Free memory was 238.1 MB in the beginning and 324.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 394.4 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:53,211 INFO ]: TraceAbstraction took 19088.64 ms. Allocated memory was 732.4 MB in the beginning and 1.0 GB in the end (delta: 316.7 MB). Free memory was 324.2 MB in the beginning and 251.0 MB in the end (delta: 73.3 MB). Peak memory consumption was 389.9 MB. Max. memory is 3.6 GB. [2018-06-25 03:45:53,219 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 303.6 MB. Free memory is still 268.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.21 ms. Allocated memory is still 303.6 MB. Free memory was 256.1 MB in the beginning and 252.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 44.82 ms. Allocated memory is still 303.6 MB. Free memory is still 252.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 313.29 ms. Allocated memory is still 303.6 MB. Free memory was 252.1 MB in the beginning and 238.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 15585.57 ms. Allocated memory was 303.6 MB in the beginning and 732.4 MB in the end (delta: 428.9 MB). Free memory was 238.1 MB in the beginning and 324.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 394.4 MB. Max. memory is 3.6 GB. * TraceAbstraction took 19088.64 ms. Allocated memory was 732.4 MB in the beginning and 1.0 GB in the end (delta: 316.7 MB). Free memory was 324.2 MB in the beginning and 251.0 MB in the end (delta: 73.3 MB). Peak memory consumption was 389.9 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, 19.0s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9406 SDtfs, 0 SDslu, 78 SDs, 0 SdLazy, 4375 SolverSat, 5191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=10, 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, 14 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 1323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1007 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 10/30 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_e8_381_e7_224.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-25_03-45-53-233.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e8_381_e7_224.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-25_03-45-53-233.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e8_381_e7_224.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-25_03-45-53-233.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ex3_e8_381_e7_224.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_03-45-53-233.csv Received shutdown request...